Fetching the paper…
Reading the bibliography…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n).
Béla Bollobás and Oliver Riordan. “Metrics for sparse graphs.” Arxiv: 0708.1919
1919
Earlier work this paper cites.
Herman Chernoff. “A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations.” Annals of Mathematical Statistics 23(4):493-507 (1952)
1952
Earlier work this paper cites.
Wassily Hoeffding. “Probability Inequalities for Sums of Bounded Random Variables.” Journal of the American Statistical Association 58(301):13-30 (1963)
1963
Earlier work this paper cites.
C.J. Thompson. “Inequality with applications in statistical mechanics.” Journal of Mathematical Physics, 6: 1812-1813 (1965)
1965
Earlier work this paper cites.
David Freedman. “On tail probabilities for martingales.” Annals of Probability 3:100-118 (1975)
1975
Earlier work this paper cites.
Zoltan Füredi and Janos Komlos. “The eigenvalues of random symmetric matrices”. Combinatorica, 1(3):233241 (1981)
1981
Earlier work this paper cites.
Eli Shamir and Joel Spencer. “Sharp concentration of the chromatic number on random graphs G n , p G_{n,p} .” Combinatorica 7(1): 121–129 (1987)
1987
Earlier work this paper cites.
Roger Horn and Charles Johnson. Matrix Analysis
1990
Earlier work this paper cites.
Pascal Massart. “The Tight Constant in the Dvoretzky-Kiefer-Wolfowitz Inequality.” Annals of Probability 18(3):1269-1283 (1990)
1990
Earlier work this paper cites.
Frigyes Riesz and Béla Sz.-Nagy. Functional Analysis
1990
Earlier work this paper cites.
Michel Ledoux and Michel Talagrand. Probability in Banach Spaces
1991
Earlier work this paper cites.
Françoise Lust-Piquard and Gilles Pisier. “Non commutative Khintchine and Paley inequalities.” Arkiv för Matematik, 29(2): 241-260 (1991)
1991
Earlier work this paper cites.
Tosio Kato. Perturbation Theory for Linear Operators
1995
Earlier work this paper cites.
Noga Alon and Nabil Kahale. “A Spectral Technique for Coloring Random 3-Colorable Graphs.” SIAM Journal of Computing 26: 1733-1748 (1997)
1997
Earlier work this paper cites.
Noga Alon and Michael Krivelevich. “The concentration of the chromatic number of random graphs.” Combinatorica 17(3):303-313 (1997)
1997
Earlier work this paper cites.
Fan Chung Graham. Spectral Graph Theory
1997
Earlier work this paper cites.
Mark Rudelson. “Random vectors in the isotropic position.” Journal of Functional Analysis, 164 (1): 60-72 (1999)
1999
Earlier work this paper cites.
Béla Bollobás. Random Graphs
2001
Cited alongside, same era.
Michel Ledoux. The concentration of measure phenomenon
2001
Cited alongside, same era.
Rudolf Ahlswede and Andreas Winter. “Strong converse for identification via quantum channels.” IEEE Transactions on Information Theory 48(3): 569-579 (2002)
2002
Cited alongside, same era.
Noga Alon, Michael Krivelevich and Van Vu. “On the concentration of eigenvalues of random symmetric matrices.” Israel Journal of Mathematics 131(1):259-267 (2002)
2002
Cited alongside, same era.
Alon Amit and Nathan Linial. “Random graph coverings, I: General theory and graph connectivity.” Combinatorica 22:1-18 (2002)
2002
Cited alongside, same era.
Peter Lax. Functional Analysis
2002
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade and Joel Spencer. “Random subgraphs of finite graphs: I. The scaling window under the triangle condition.” Random Structures and Algorithms 27: 137-184 (2005)
2005
Later among the works it cites.
Stéphane Boucheron, Olivier Bousquet, Gábor Lugosi, and Pascal Massart. “Moment inequalities for functions of independent random variables.” Annals of Probability, 33:514-560 (2005)
2005
Later among the works it cites.
Igor Devetak. “The private classical capacity and quantum capacity of a quantum channel.” IEEE Transactions on Information Theory 51(1): 44-55 (2005)
2005
Later among the works it cites.
Uriel Feige and Eran Ofek. “Spectral Techniques Applied to Sparse Random Graphs.” Random Structures and Algorithms 27(2): 251-275 (2005)
2005
Later among the works it cites.
Michael Krivelevich and Benjamin Sudakov. “Pseudo-random graphs.” In More Sets, Graphs and Numbers
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Joel Friedman. “Relative expanders or weakly relatively Ramanujan graphs.” Duke Mathematical Journal 118(1):19-35 (2003)
2003
Cited alongside, same era.
Alan Frieze, Michael Krivelevich and Ryan Martin. “The emergence of a giant component in a random subgraph of pseudo-random graphs.” Random Structures and Algorithms 24(1):42-50 (2003)
2003
Cited alongside, same era.
Michael Krivelevich and Benjamin Sudakov. “The largest eigenvalue of sparse random graphs.” Combinatorics, Probability and Computing 12:61-72 (2003)
2003
Cited alongside, same era.
Noga Alon, Itai Benjamini and Alan Stacey. “Percolation on Finite Graphs and Isoperimetric Inequalities.” Annals of Probability 32(3):1727-1745 (2004)
2004
Cited alongside, same era.
Noga Alon and Joel Spencer. The Probabilistic Method
2004
Cited alongside, same era.
Stéphane Boucheron, Olivier Bousquet and Gábor Lugosi. “Concentration inequalities.” In O. Bousquet, U.v. Luxburg, and G. Rätsch (editors), Advanced Lectures in Machine Learning, Springer, 208-240 (2004)
2004
Cited alongside, same era.
2006
Later among the works it cites.
Béla Bollobás, Svante Janson and Oliver Riordan. “The phase transition in inhomogeneous random graphs.” Random Structures and Algorithms 31(1):3-122 (2007)
2007
Later among the works it cites.
Demetres Christofides and Klas Markström. “Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales.” Random Structures and Algorithms 32(1):88-100 (2007)
2007
Later among the works it cites.
Fan Chung, Ronald Graham and Richard Wilson. “Quasi-Random Graphs.” Combinatorica 22(2):217-244 (2007)
2007
Later among the works it cites.
Fan Chung and Ronald Graham. “Sparse Quasi-Random Graphs.” Combinatorica 22(2):217-244 (2007)
2007
Later among the works it cites.
Fan Chung and Ronald Graham. “Quasi-random graphs with given degree sequences.” Random Structures and Algorithms 32(1):1-19 (2007)
2007
Later among the works it cites.
Fan Chung and Paul Horn. “The Spectral Gap of a Random Subgraph of a Graph.” Internet Mathematics 4(2-3):225-244 (2007)
2007
Later among the works it cites.
Christian Borgs, Jennifer T. Chayes, Lazsló Lóvasz, Vera T. Sós and Katalin Vesztergombi. “Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing.” Advances in Mathematics 219(6): 1901-1851 (2008)
2008
Later among the works it cites.
Joel Friedman. “A Proof of Alon’s Second Eigenvalue Conjecture and Related Problems.” Memoirs of the American Mathematical Society 195 (2008)
2008
Later among the works it cites.
2008
Later among the works it cites.
Avi Widgerson and David Xiao. “Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications.” Theory of Computing 4: 53-76 (2008)
2008
Later among the works it cites.
Fan Chung, Paul Horn and Linyuan Liu. “The giant component in a random subgraph of a given graph.” In Proceedings of the Workshop on Algorithms and Models for the Web-Graph (WAW 2009)
2009
Closest in time.