Highly symmetric expanders

DOI10.1006/FFTA.2001.0341MaRDI QIDQ700158zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, San Ling

Publication date 30 September 2002

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4eb57e0ba72931b1fb4d5d1e00371b9ab3c1cd5a

zbMATH Keywords

expander graphssymmetric graphsRamanujan graphsswitching graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1465652
• Expander graphs in pure and applied mathematics
• Symmetric groups and expander graphs.
• Expander graphs and their applications
• Symmetric groups and expanders

Cites work

• scientific article; zbMATH DE number 3125713 (Why is no real title available?)
• scientific article; zbMATH DE number 5783701 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3980487 (Why is no real title available?)
• scientific article; zbMATH DE number 1263215 (Why is no real title available?)
• scientific article; zbMATH DE number 3311770 (Why is no real title available?)
• A note on time-space tradeoffs for computing continuous functions
• A unified theory of interconnection network structure
• Asymptotically optimal switching circuits
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Eigenvalues and expanders
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• Explicit Concentrators from Generalized N-Gons
• Explicit constructions of linear-sized superconcentrators
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Graph-theoretic properties in computational complexity
• Hard examples for resolution
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• Pseudorandomness for network algorithms
• Ramanujan graphs
• Random Cayley graphs and expanders
• Sorting in \(c \log n\) parallel steps
• Space bounds for a game on graphs
• Superconcentrators
• The complexity of testing whether a graph is a superconcentrator
• Time-Space trade-offs for some algebraic problems
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits

Cited in

(9)

• Expansion of product replacement graphs
• Expander graphs from Curtis-Tits groups.
• Limiting distributions of maximum likelihood estimators for unstable autoregressive moving-average time series with general autoregressive heteroscedastic errors
• On high-girth expander graphs with localized eigenvectors
• Symmetric unique neighbor expanders and good LDPC codes
• Symmetric groups and expander graphs.
• HIGH DIMENSIONAL EXPANDERS
• Hypergraph expanders of all uniformities from Cayley graphs
• Constructing highly regular expanders from hyperbolic Coxeter groups

This page was built for publication: Highly symmetric expanders

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