The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A proof of Alon’s second eigenvalue conjecture and related problems
Abstract
Ad-regular graph has largest or rst (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d=2 uniform, independent permutations on f1;:::;ng. We shall show that for any >0 we have all eigenvalues aside from 1 = d are bounded by 2 p d 1+ with probability 1 O(n ), where =d p d 1+ 1 =2e 1. We also show that this probability is at most 1 c=n 0 , for a constant c and a 0 that is either or +1 (\more often than + 1). We prove related theorems for other models of random graphs, including models with d odd. These theorems resolve the conjecture of Alon, that says that for any > 0a ndd, the second largest eigenvalue of \most random dregular graphs are at most 2 p d 1+ (Alon did not specify precisely what \most should mean or what model of random graph one should take).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
The Mathematical Theory of Communication
Shannon, C. E., Weaver, W., & Wiener, N. (1950) · Physics Today · doi:10.1063/1.3067010 · Cited by 9,801
An Introduction to Symbolic Dynamics and Coding
Lind, D., & Marcus, B. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108899727 · Cited by 2,696
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Random Walks on Infinite Graphs and Groups
Woess, W. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511470967 · Cited by 844
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Characteristic Vectors of Bordered Matrices with Infinite Dimensions II
Wigner, E. P. (1993) · The Collected Works of Eugene Paul Wigner · doi:10.1007/978-3-662-02781-3_36 · Cited by 668
Models of Random Regular Graphs
Wormald, N. C. (1999) · Surveys in Combinatorics, 1999 · doi:10.1017/cbo9780511721335.010 · Cited by 598
Difference equations, isoperimetric inequality and transience of certain random walks
Dodziuk, J. (1984) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1984-0743744-x · Cited by 475
A Limit Theorem for the Norm of Random Matrices
Geman, S. (1980) · The Annals of Probability · doi:10.1214/aop/1176994775 · Cited by 419
Cited by
Brouwer, A. E., & Haemers, W. H. (2012) · Universitext · doi:10.1007/978-1-4614-1939-6 · Cited by 1,564
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Community detection thresholds and the weak Ramanujan property
Massoulié, L. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591857 · Cited by 316
Metadata
- Authors
- Friedman, J.
- Venue
- Memoirs of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 2008
- Volume
- 195
- Issue
- 910
- Pages
- 0-0
- ISSN
- 0065-9266 (ISSN-L)
- 1947-6221
- OpenAlex
- W1650240946
- Cited by
- 328
- References
- 13
- FWCI
- 22.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A proof of Alon’s second eigenvalue conjecture and related problems. https://app.cochat.ai/papers/10.1090/memo/0910
- The paper
- Friedman, J. (2008). A proof of Alon’s second eigenvalue conjecture and related problems. Memoirs of the American Mathematical Society. https://doi.org/10.1090/memo/0910
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.