Fetching the paper…
Reading the bibliography…
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data.
Representations for partially exchangeable arrays of random variables
David J Aldous · 1981
Earlier work this paper cites.
Row-column exchangeability and a generalized model for probability
David N Hoover · 1982
Earlier work this paper cites.
Perturbation of spectral subspaces and solution of linear operator equations
Rajendra Bhatia, Chandler Davis, and Alan McIntosh · 1983
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Introduction to the theory of linear nonselfadjoint operators
I. Gohberg and M. G. Kreĭn · 1988
Earlier work this paper cites.
On the representation theorem for exchangeable arrays
Olav Kallenberg · 1989
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Functional analysis
Peter D Lax · 2002
Earlier work this paper cites.
Random geometric graphs
Mathew Penrose · 2003
Earlier work this paper cites.
Social network analysis software & services for organizations, communities, and their consultants
Valdis Krebs · 2004
Earlier work this paper cites.
Learning with non-positive kernels
Cheng Soon Ong, Xavier Mary, Stéphane Canu, and Alexander J Smola · 2004
Earlier work this paper cites.
The political blogosphere and the 2004 us election: divided they blog
Lada A Adamic and Natalie Glance · 2005
Earlier work this paper cites.
The phase transition in inhomogeneous random graphs
Béla Bollobás, Svante Janson, and Oliver Riordan · 2007
Earlier work this paper cites.
Methodology and convergence rates for functional linear regression
Peter Hall and Joel L Horowitz · 2007
Earlier work this paper cites.
Mixed membership stochastic blockmodels
Edoardo M Airoldi, David M Blei, Stephen E Fienberg, and Eric P Xing · 2008
Earlier work this paper cites.
Modeling homophily and stochastic equivalence in symmetric relational data
Peter Hoff · 2008
Earlier work this paper cites.
Random dot product graphs a model for social networks
Christine Leigh Myers Nickel · 2008
Earlier work this paper cites.
A nonparametric view of network models and newman–girvan and other modularities
Peter J Bickel and Aiyou Chen · 2009
Earlier work this paper cites.
Statistical analysis of network data
Eric D Kolaczyk · 2009
Earlier work this paper cites.
Networks: an introduction
Mark Newman · 2009
Cited alongside, same era.
Graph partitioning via adaptive spectral techniques
Amin Coja-Oghlan · 2010
Cited alongside, same era.
A survey of statistical network models
Anna Goldenberg, Alice X Zheng, Stephen E Fienberg, and Edoardo M Airoldi · 2010
Cited alongside, same era.
The method of moments and degree distributions for network models
Peter J Bickel, Aiyou Chen, and Elizaveta Levina · 2011
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
Brian Karrer and Mark EJ Newman · 2011
Cited alongside, same era.
Asymptotic equivalence of functional linear regression and a white noise inverse problem
Alexander Meister · 2011
Cited alongside, same era.
Fast community detection by score
Jiashun Jin · 2015
Later among the works it cites.
Bayesian models of graphs, arrays and other exchangeable random structures
Peter Orbanz and Daniel M Roy · 2015
Later among the works it cites.
Latent space models for dynamic networks
Daniel K Sewell and Yuguo Chen · 2015
Later among the works it cites.
A goodness-of-fit test for stochastic block models
Jing Lei · 2016
Later among the works it cites.
Statistical inference on random dot product graphs: a survey
Avanti Athreya, Donniell E Fishkind, Keith Levin, Vince Lyzinski, Youngser Park, Yichen Qin, Daniel L Sussman, Minh Tang, Joshua T Vogelstein, and Carey E Priebe · 2017
Later among the works it cites.
Sparse graphs using exchangeable random measures
François Caron and Emily B Fox · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Spectral clustering and the high-dimensional stochastic blockmodel
Karl Rohe, Sourav Chatterjee, and Bin Yu · 2011
Cited alongside, same era.
Large networks and graph limits
László Lovász · 2012
Cited alongside, same era.
Consistency of community detection in networks under degree-corrected stochastic block models
Yunpeng Zhao, Elizaveta Levina, and Ji Zhu · 2012
Cited alongside, same era.
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
Edo M Airoldi, Thiago B Costa, and Stanley H Chan · 2013
Cited alongside, same era.
A consistent adjacency spectral embedding for stochastic blockmodel graphs
Daniel L. Sussman, Minh Tang, Donniell E. Fishkind, and Carey Priebe · 2013
Cited alongside, same era.
Nonparametric graphon estimation
Patrick J Wolfe and Sofia C Olhede · 2013
Cited alongside, same era.
Later among the works it cites.
Network cross-validation for determining the number of communities in network data
Kehui Chen and Jing Lei · 2017
Later among the works it cites.
Oracle inequalities for network models and sparse graphon estimation
Olga Klopp, Alexandre B Tsybakov, and Nicolas Verzelen · 2017
Later among the works it cites.
The generalised random dot product graph
Patrick Rubin-Delanchy, Carey E Priebe, and Minh Tang · 2017
Later among the works it cites.
A nonparametric two-sample hypothesis testing problem for random graphs
Minh Tang, Avanti Athreya, Daniel L Sussman, Vince Lyzinski, and Carey E Priebe · 2017
Later among the works it cites.
Estimating network edge probabilities by neighbourhood smoothing
Yuan Zhang, Elizaveta Levina, and Ji Zhu · 2017
Later among the works it cites.
Spectral clustering for multiple sparse networks: I
Sharmodeep Bhattacharyya and Shirshendu Chatterjee · 2018
Closest in time.
Edge exchangeable models for interaction networks
Harry Crane and Walter Dempsey · 2018
Closest in time.
Community detection in degree-corrected block models
Chao Gao, Zongming Ma, Anderson Y Zhang, and Harrison H Zhou · 2018
Closest in time.
Rates of convergence of spectral methods for graphon estimation
Jiaming Xu · 2018
Closest in time.
Optimal graphon estimation in cut distance
Olga Klopp and Nicolas Verzelen · 2019
Closest in time.
Supplementary material to “network representation using graph root distributions”
Jing Lei · 2019
Closest in time.
Convergence and concentration of empirical measures under wasserstein distance in unbounded functional spaces
Jing Lei · 2020
Closest in time.