Expander graph
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.
Expander graph - Wikipedia Jump to content From Wikipedia, the free encyclopedia Sparse graph with strong connectivity In graph theory , an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex , edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory , design of robust computer networks , and the theory of error-correcting codes . [ 1 ] Definitions [ edit ] Intuitively, an expander graph is a finite, undirected multigraph in which every subset of the ver
related reading
- Sublinear expandersias.edu
- Thatchaphol Saranurak - Graph Decompositionsites.google.com
- Understanding Convolutions on Graphsdistill.pub
- Fernando Granha Jeronimo | Theoretical Computer Science | UIUCgranha.github.io
- random subgraphs rainbowarxiv.org
- Induced rational exponents near twoarxiv.org
- Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizesarxiv.org
- What’s up with the Graph Laplacian? – with high probabilitysamidavies.wordpress.com
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Cover times - spectralarxiv.org
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- GraphTheoreticProperties.pdfcs.rice.edu