Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
expander graphs
Description:
Sparse graphs with strong connectivity properties, studied in combinatorics, graph theory, and related areas of mathematics.
Related topics:
Limits and Structures in Graph Theory (19%),
Complexity and Algorithms in Graphs (15%),
Finite Group Theory Research (9%)
Wikidata ID:
wiki/Q776602
OpenAlex ID:
keywords/expander-graphs
Spectral Graph Theory
1996
·
Fan Chung
·
Regional conference series in mathematics
·
6,669
Computational Complexity: A Modern Approach
2009
·
Sanjeev Arora
, Boaz Barak
·
2,370
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
2009
·
Jure Leskovec
, Kevin J. Lang
, et al.
·
Internet Mathematics
·
1,913
PDF
Expander graphs and their applications
2006
·
Shlomo Hoory
, Nathan Linial
, et al.
·
Bulletin of the American Mathematical Society
·
1,730
Eigenvalues and expanders
1986
·
Noga Alon
·
COMBINATORICA
·
1,126
THE LAPLACIAN SPECTRUM OF GRAPHS y
1991
·
Bojan Mohar
·
1,090
Ramanujan graphs
1988
·
A. Lubotzky
, R. Phillips
, et al.
·
COMBINATORICA
·
1,086
The geometry of graphs and some of its algorithmic applications
1995
·
Nathan Linial
, Eran London
, et al.
·
COMBINATORICA
·
948
Expander codes
1996
·
M. Sipser
, D.A. Spielman
·
IEEE Transactions on Information Theory
·
939
λ1, Isoperimetric inequalities for graphs, and superconcentrators
1985
·
N Alon
, V.D Milman
·
Journal of Combinatorial Theory Series B
·
833
Discrete Groups, Expanding Graphs and Invariant Measures
1994
·
Alexander Lubotzky
·
Birkhäuser Basel eBooks
·
668
The PCP theorem by gap amplification
2006
·
Irit Dinur
·
Journal of the ACM
·
562
Random walks in peer-to-peer networks
2004
·
C. Gkantsidis
, M. Mihail
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
526
Hard examples for resolution
1987
·
Alasdair Urquhart
·
Journal of the ACM
·
475
PDF
A note on the isoperimetric constant
1982
·
Peter Buser
·
Annales Scientifiques de l École Normale Supérieure
·
470
PDF
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
2002
·
Omer Reingold
, Salil Vadhan
, et al.
·
Annals of Mathematics
·
408
Explicit constructions of linear-sized superconcentrators
1981
·
Ofer Gabber
, Zvi Galil
·
Journal of Computer and System Sciences
·
399
Extremal Combinatorics: With Applications in Computer Science
2011
·
Stasys Jukna
·
Texts in theoretical computer science
·
396
Cryptographic Hash Functions from Expander Graphs
2007
·
Denis X. Charles
, Kristin E. Lauter
, et al.
·
Journal of Cryptology
·
395
PDF
The electrical resistance of a graph captures its commute and cover times
1989
·
A. K. Chandra
, P. Raghavan
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
389
A proof of Alon’s second eigenvalue conjecture and related problems
2008
·
Joel Friedman
·
Memoirs of the American Mathematical Society
·
362
PDF
Pseudorandomness
2012
·
Salil P. Vadhan
·
Foundations and Trends® in Theoretical Computer Science
·
358
Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check Codes
2003
·
David J.C. MacKay
, Michael S. Postol
·
Electronic Notes in Theoretical Computer Science
·
341
PDF
Property Testing in Bounded Degree Graphs
2002
·
Goldreich
, Ron
·
Algorithmica
·
332
The electrical resistance of a graph captures its commute and cover times
1996
·
Ashok K. Chandra
, Prabhakar Raghavan
, et al.
·
Computational Complexity
·
330
Show more works
View as search
Works count:
2,123
Citation count:
56,510
Year
Topic
Type