Fetching the paper…
Reading the bibliography…
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons.
Hierarchical grouping to optimize an objective function
J. H. Ward, Jr · 1963
Earlier work this paper cites.
Some methods for classification and analysis of multivariate observations
J. MacQueen · 1967
Earlier work this paper cites.
Relations on probability spaces and arrays of random variables
D. N. Hoover · 1979
Earlier work this paper cites.
Representations for partially exchangeable arrays of random variables
D. J. Aldous · 1981
Earlier work this paper cites.
Stochastic blockmodels: first steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Multivariate sampling and the estimation problem for exchangeable arrays
O. Kallenberg · 1999
Earlier work this paper cites.
The structure of scientific collaboration networks
M. E. J. Newman · 2001
Earlier work this paper cites.
Community structure in social and biological networks
M. Girvan and M. E. J. Newman · 2002
Earlier work this paper cites.
Latent space approaches to social network analysis
P. D. Hoff, A. E. Raftery, and M. S. Handcock · 2002
Earlier work this paper cites.
Trust management for the semantic web
M. Richardson, R. Agrawal, and P. Domingos · 2003
Earlier work this paper cites.
Probabilistic symmetries and invariance principles
O. Kallenberg · 2005
Earlier work this paper cites.
Learning systems of concepts with an infinite relational model
C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda · 2006
Earlier work this paper cites.
The phase transition in inhomogeneous random graphs
B. Bollobás, S. Janson, and O. Riordan · 2007
Earlier work this paper cites.
Euclidean embedding of co-occurrence data
A. Globerson, G. Chechik, F. Pereira, and N. Tishby · 2007
Cited alongside, same era.
Modeling homophily and stochastic equivalence in symmetric relational data
P. Hoff · 2007
Cited alongside, same era.
On exchangeable random variables and the statistics of large graphs and hypergraphs
T. Austin · 2008
Cited alongside, same era.
Graph limits and exchangeable random graphs
P. Diaconis and S. Janson · 2008
Cited alongside, same era.
The Mondrian process
D. M. Roy and Y. W. Teh · 2008
Cited alongside, same era.
A nonparametric view of network models and Newman-Girvan and other modularities
P. J. Bickel and A. Chen · 2009
Cited alongside, same era.
An infinite latent attribute model for network data
K. Palla, D. A. Knowles, and Z. Ghahramani · 2012
Later among the works it cites.
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
E. M. Airoldi, T. B. Costa, and S. H. Chan · 2013
Later among the works it cites.
Graphons, cut norm and distance, couplings and rearrangements , volume 4 of New York J. Math. Monographs
S. Janson · 2013
Later among the works it cites.
Nonparametric graphon estimation
P. J. Wolfe and S. C. Olhede · 2013
Later among the works it cites.
On semidefinite relaxations for the block model
A. A. Amini and E. Levina · 2014
Closest in time.
A consistent histogram estimator for exchangeable graph models
S. H. Chan and E. Airoldi · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nonparametric latent feature models for link prediction
K. T. Miller, T. L. Griffiths, and M. I. Jordan · 2009
Cited alongside, same era.
Introduction to nonparametric estimation
A. B. Tsybakov · 2009
Cited alongside, same era.
The method of moments and degree distributions for network models
P. J. Bickel, A. Chen, and E. Levina · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, et al · 2011
Cited alongside, same era.
Random function priors for exchangeable arrays with applications to graphs and relational data
J. R. Lloyd, P. Orbanz, Z. Ghahramani, and D. M. Roy · 2012
Cited alongside, same era.
Large networks and graph limits , volume 60 of American Math. Soc. Colloq. Publ
L. Lovász · 2012
Cited alongside, same era.
Matrix estimation by universal singular value thresholding
S. Chatterjee · 2014
Closest in time.
Co-clustering separately exchangeable network data
D. Choi and P. J. Wolfe · 2014
Closest in time.
Rate-optimal graphon estimation
C. Gao, Y. Lu, and H. H. Zhou · 2014
Closest in time.
Network histograms and universality of blockmodel approximation
S. C. Olhede and P. J. Wolfe · 2014
Closest in time.
Nonparametric estimation and testing of exchangeable graph models
J. Yang, C. Han, and E. Airoldi · 2014
Closest in time.
Bayesian models of graphs, arrays and other exchangeable random structures
P. Orbanz and D. M. Roy · 2015
Closest in time.