Beyond the expanders

DOI10.1155/2011/787596zbMath1236.05122arXiv1101.5926OpenAlexW2166772092WikidataQ58655897 ScholiaQ58655897MaRDI QIDQ666522

Marianna Bolla

Publication date: 8 March 2012

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.5926

zbMATH Keywords

random walkspectral walk

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items

Unnamed Item, Modularity spectra, eigen-subspaces, and structure of weighted graphs

Cites Work

• Unnamed Item
• Szemerédi's lemma for the analyst
• Noisy random graphs and their laplacians
• Eigenvalues and expanders
• Spectra and optimal partitions of weighted graphs
• Optimization problems for weighted graphs and related correlation estimates
• The spectral gap of random graphs with given expected degrees
• Generalized quasirandom graphs
• Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
• Expander graphs and their applications
• Community structure in social and biological networks
• Quasi‐random graphs with given degree sequences