Explicit Concentrators from Generalized N-Gons

Recommendations

Natural bounded concentrators
Using combinatorial designs to construct partial concentrators
Explicit bounded-degree unique-neighbor concentrators
On the Expected Capacity of Binomial and Random Concentrators
Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators

Cites work

A recursive approach to low complexity codes
Explicit constructions of linear-sized superconcentrators
Generalized Connectors
scientific article; zbMATH DE number 3668628 (Why is no real title available?)
scientific article; zbMATH DE number 3717357 (Why is no real title available?)
scientific article; zbMATH DE number 3487716 (Why is no real title available?)
scientific article; zbMATH DE number 3521893 (Why is no real title available?)
scientific article; zbMATH DE number 3555946 (Why is no real title available?)
scientific article; zbMATH DE number 3577144 (Why is no real title available?)
scientific article; zbMATH DE number 3445271 (Why is no real title available?)
scientific article; zbMATH DE number 3257050 (Why is no real title available?)
On the complexity of an optimal non-blocking commutation scheme without reorganization
Superconcentrators
The nonexistence of certain generalized polygons

Cited in

(75)

Eigenvalues and expanders
A geometric condition for incidence-matrix nullvectors
Eigenvalues, diameter, and mean distance in graphs
On the second eigenvalue and random walks in random d-regular graphs
On the spectra of certain graphs arising from finite fields
Expansion properties of Cayley graphs of the alternating groups
Constant time parallel sorting: An empirical view.
Intrinsic isoperimetry of the giant component of supercritical bond percolation in dimension two
On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
Natural bounded concentrators
Tough Ramsey graphs without short cycles
Simulating BPP using a general weak random source
Codes, cubes, and graphical designs
Sparse SYK and traversable wormholes
Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes
On the spectrum of dense random geometric graphs
Graphical designs and extremal combinatorics
Absorbing sets of codes from finite geometries
Trivalent expanders, \((\Delta - Y)\)-transformation, and hyperbolic surfaces
Lower bounds for boxicity
Isoperimetric inequalities in simplicial complexes
Heegaard splittings, the virtually Haken conjecture and property \((\tau)\)
Explicit bounded-degree unique-neighbor concentrators
Some elementary Ramanujan graphs
Dense expanders and pseudo-random bipartite graphs
Inverse expander mixing for hypergraphs
Discrepancy and eigenvalues of Cayley graphs
On the Banach-space-valued Azuma inequality and small-set isoperimetry of Alon-Roichman graphs
Random Latin square graphs
Simplicial complexes: spectrum, homology and random walks
The minimum distance of graph codes
Formal zeta function expansions and the frequency of Ramanujan graphs
Algorithms for \#BIS-hard problems on expander graphs
Expander graphs and their applications
Expanders and Diffusers
Diameters and Eigenvalues
Some recent results on Ramsey-type numbers
The influence of Miroslav Fiedler on spectral graph theory
Randomised broadcasting: memory vs. randomness
Outlaw distributions and locally decodable codes
Ramanujan complexes and high dimensional expanders
Multi-way dual Cheeger constants and spectral bounds of graphs
Extremal results for odd cycles in sparse pseudorandom graphs
Non-representability of finite projective planes by convex sets
The Ramanujan conjecture and its applications
Property \(F\ell_q\) implies property \(F\ell_{p}\) for \(1<p<q<\infty\)
Fast algorithms for general spin systems on bipartite expanders
Distributed corruption detection in networks
Deterministic approximation of random walks in small space
scientific article; zbMATH DE number 4193718 (Why is no real title available?)
Doing-it-all with bounded work and communication
Mixing in high-dimensional expanders
Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
Eigenvalues and linear quasirandom hypergraphs
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
Sparse and limited wavelength conversion in all-optical tree networks
On the cop number of graphs of high girth
Graphical designs and gale duality
Efficient proofs of retrievability using expander codes
Explicit non-malleable codes from bipartite graphs
Improved upper bounds on even-cycle creating Hamilton paths
Parameterized complexity classes defined by threshold circuits and their connection with sorting networks
Measured expanders
Zeta functions for spherical Tits buildings of finite general linear groups
Cheeger's inequalities for vertex expansion and reweighted eigenvalues
Minimum bisections of graphs without even cycles
Counting odd cycles in sparse pseudorandom graphs
Eigenvalues and expansion of bipartite graphs
Highly symmetric expanders
A generalized Alon-Boppana bound and weak Ramanujan graphs
On a conjecture of Brouwer involving the connectivity of strongly regular graphs
A geometric construction of a superconcentrator of depth 2
\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
The spectra of Manhattan street networks
Some constructive bounds on Ramsey numbers

This page was built for publication: Explicit Concentrators from Generalized N-Gons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216690)