Explicit Concentrators from Generalized N-Gons

DOI10.1137/0605030zbMath0554.05045OpenAlexW2121284046WikidataQ105584982 ScholiaQ105584982MaRDI QIDQ3216690

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605030

zbMATH Keywords

bipartite graph eigenvalues generalized N-gons concentrators

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Other finite incidence structures (geometric aspects) (51E30)

Related Items

Inverse expander mixing for hypergraphs, Unnamed Item, Tough Ramsey graphs without short cycles, On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon–Roichman Graphs, Random Latin square graphs, Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes, Dense expanders and pseudo-random bipartite graphs, Expansion properties of Cayley graphs of the alternating groups, Eigenvalues and expanders, Isoperimetric inequalities in simplicial complexes, Intrinsic isoperimetry of the giant component of supercritical bond percolation in dimension two, On the spectrum of dense random geometric graphs, A geometric condition for incidence-matrix nullvectors, Expanders and Diffusers, Simulating BPP using a general weak random source, Some recent results on Ramsey-type numbers, The influence of Miroslav Fiedler on spectral graph theory, Randomised broadcasting: memory vs. randomness, On the cop number of graphs of high girth, Constant time parallel sorting: An empirical view., Graphical designs and gale duality, Graphical designs and extremal combinatorics, Efficient proofs of retrievability using expander codes, Explicit non-malleable codes from bipartite graphs, Expander graphs and their applications, Mixing in High-Dimensional Expanders, Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs, Simplicial complexes: Spectrum, homology and random walks, Ramanujan complexes and high dimensional expanders, Multi-way dual Cheeger constants and spectral bounds of graphs, Eigenvalues, diameter, and mean distance in graphs, Formal Zeta function expansions and the frequency of Ramanujan graphs, Extremal results for odd cycles in sparse pseudorandom graphs, On the second eigenvalue and random walks in random \(d\)-regular graphs, Algorithms for #BIS-Hard Problems on Expander Graphs, The Minimum Distance of Graph Codes, Codes, cubes, and graphical designs, Property \(F\ell_q\) implies property \(F\ell_{p}\) for \(1<p<q<\infty\), The spectra of Manhattan street networks, Eigenvalues and expansion of bipartite graphs, Doing-it-all with bounded work and communication, Highly symmetric expanders, Non-representability of finite projective planes by convex sets, Some constructive bounds on Ramsey numbers, Heegaard splittings, the virtually Haken conjecture and property \((\tau)\), Unnamed Item, Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory, Sparse and limited wavelength conversion in all-optical tree networks, A generalized Alon-Boppana bound and weak Ramanujan graphs, Distributed Corruption Detection in Networks, On the spectra of certain graphs arising from finite fields, Discrepancy and eigenvalues of Cayley graphs, On a conjecture of Brouwer involving the connectivity of strongly regular graphs, Outlaw distributions and locally decodable codes, The Ramanujan conjecture and its applications, Absorbing sets of codes from finite geometries, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Trivalent expanders, \((\Delta - Y)\)-transformation, and hyperbolic surfaces, Sparse SYK and traversable wormholes, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), Natural bounded concentrators, Some elementary Ramanujan graphs, Unnamed Item, Lower bounds for boxicity, \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators, Diameters and Eigenvalues

Cites Work