Expanders and Diffusers
From MaRDI portal
Publication:3753504
random walkbipartite graphsorting networksdoubly-stochastic matricessuperconcentratorsExpander graphsconcentratornorm of a diffusion operator on an infinite discrete group
Computational methods for sparse matrices (65F50) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Sums of independent random variables; random walks (60G50) Stochastic matrices (15B51) Applications of graph theory to circuits and networks (94C15) Linear algebraic groups over finite fields (20G40)
Recommendations
Cites work
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 3187168 (Why is no real title available?)
- Asymptotically optimal switching circuits
- Better expanders and superconcentrators
- Convolutions, means, and spectra
- Eigenvalues and expanders
- Explicit Concentrators from Generalized N-Gons
- Explicit constructions of linear-sized superconcentrators
- Full Banach Mean Values on Countable groups.
- Limitations on Explicit Constructions of Expanding Graphs
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- On the complexity of an optimal non-blocking commutation scheme without reorganization
- Sorting in \(c \log n\) parallel steps
- Superconcentrators
- Symmetric Random Walks on Groups
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(6)- The spectral geometry of \(k\)-regular groups
- Diameters and Eigenvalues
- The Ramanujan property for regular cubical complexes
- Better expanders and superconcentrators
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- Relative expanders or weakly relatively Ramanujan graphs.
This page was built for publication: Expanders and Diffusers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753504)