Fetching the paper…
Reading the bibliography…
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks.
“Funzione caratteristica di un fenomeno aleatorio”
Bruno Finetti · 1930
Earlier work this paper cites.
“La prévision: ses lois logiques, ses sources subjectives”
Bruno Finetti · 1937
Earlier work this paper cites.
“Symmetric Measures on Cartesian Products”
E. Hewitt and L.˜J. Savage · 1955
Earlier work this paper cites.
“Relations on probability spaces and arrays of random variables”, 1979
D.˜N. Hoover · 1979
Earlier work this paper cites.
“Representations for partially exchangeable arrays of random variables”
David˜J. Aldous · 1981
Earlier work this paper cites.
“Exchangeability and Related Topics”
D.˜J. Aldous · 1985
Earlier work this paper cites.
“Upper bounds on Poisson tail probabilities”
Peter˜W. Glynn · 1987
Earlier work this paper cites.
“Tutorial on large deviations for the binomial distribution”
R. Arratia and L. Gordon · 1989
Earlier work this paper cites.
“Exchangeable random measures in the plane”
Olav Kallenberg · 1990
Earlier work this paper cites.
“Poisson Processes”
J.˜F.˜C. Kingman · 1993
Earlier work this paper cites.
“Emergence of Scaling in Random Networks”
Albert-L\’aszl\’o Barab\’asi and Réka Albert · 1999
Earlier work this paper cites.
“Multivariate sampling and the estimation problem for exchangeable arrays”
Olav Kallenberg · 1999
Earlier work this paper cites.
“Random Graphs”
B. Bollob\’as · 2001
Earlier work this paper cites.
“Foundations of Modern Probability”
O. Kallenberg · 2001
Earlier work this paper cites.
“Estimation and prediction for stochastic blockstructures”
Krzysztof Nowicki and Tom A.˜B. Snijders · 2001
Cited alongside, same era.
“Latent Space Approaches to Social Network Analysis”
Peter˜D. Hoff, Adrian˜E Raftery and Mark˜S Handcock · 2002
Cited alongside, same era.
“Probabilistic Symmetries and Invariance Principles”
O. Kallenberg · 2005
Cited alongside, same era.
“Random Graph Dynamics”
R. Durrett · 2006
Cited alongside, same era.
“Limits of dense graph sequences”
L. Lov\’asz and B. Szegedy · 2006
Cited alongside, same era.
“The phase transition in inhomogeneous random graphs”
B. Bollob\’as, S. Janson and O. Riordan · 2007
Cited alongside, same era.
“Large Networks and Graph Limits”
L. Lov\’asz · 2013
Later among the works it cites.
“Nonparametric graphon estimation”
P.˜J. Wolfe and S.˜C. Olhede · 2013
Later among the works it cites.
“Mixed Membership Stochastic Blockmodels.”
Edoardo˜M Airoldi, David˜M Blei, Stephen˜E Fienberg and Eric˜P Xing · 2014
Later among the works it cites.
“Asymptotic behavior and distributional limits of preferential attachment graphs”
N. Berger, C. Borgs, J.˜T. Chayes and A. Saberi · 2014
Later among the works it cites.
C. Borgs, J.˜T. Chayes, H. Cohn and Y. Zhao · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Bollob\’as and O. Riordan · 2007
Cited alongside, same era.
“Szemerédi’s Lemma for the Analyst”
L\’aszl\’o Lov\’asz and Bal\’azs Szegedy · 2007
Cited alongside, same era.
“Graph limits and exchangeable random graphs”
Persi Diaconis and Svante Janson · 2008
Cited alongside, same era.
“A nonparametric view of network models and Newman-Girvan and other modularities”
Peter˜J. Bickel and Aiyou Chen · 2009
Cited alongside, same era.
“Nonparametric latent feature models for link prediction”
Kurt˜T. Miller, Thomas˜L. Griffiths and Michael˜I. Jordan · 2009
Cited alongside, same era.
“Networks. An Introduction”
M. Newman · 2009
Cited alongside, same era.
C. Borgs, J.˜T. Chayes, H. Cohn and Y. Zhao · 2014
Later among the works it cites.
“Sparse graphs using exchangeable random measures”
F. Caron and E.˜B. Fox · 2014
Later among the works it cites.
“Ergodic Theory: Independence and Dichotomies”, 2014
D. Kerr · 2014
Later among the works it cites.
“Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures”
P. Orbanz and D.M. Roy · 2014
Later among the works it cites.
“Consistent nonparametric estimation for heavy-tailed sparse graphs”
C. Borgs, J.˜T. Chayes, H. Cohn and S. Ganguly · 2015
Closest in time.
“Private Graphon Estimation for Sparse Graphs”
C. Borgs, J.˜T. Chayes and A. Smith · 2015
Closest in time.
“Priors on exchangeable directed graphs”
D. Cai, N. Ackerman and C. Freer · 2015
Closest in time.
“Completely random measures for modelling block-structured networks”
T. Herlau, M. Schmidt and M. Mrup · 2015
Closest in time.