Fetching the paper…
Reading the bibliography…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter.
Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung
E. Zermelo · 1929
Earlier work this paper cites.
Rank analysis of incomplete block designs. I. The method of paired comparisons
R. A. Bradley and M. E. Terry · 1952
Earlier work this paper cites.
Asymptotic enumeration of partial orders on a finite set
D. J. Kleitman and B. L. Rothschild · 1975
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.
An exponential family of probability distributions for directed graphs
P. W. Holland and S. Leinhardt · 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.
Exchangeability and related topics
D. J. Aldous · 1985
Earlier work this paper cites.
Stochastic blockmodels for directed graphs
Y. J. Wang and G. Y. Wong · 1987
Earlier work this paper cites.
Bayesian models for directed graphs
G. Y. Wong · 1987
Earlier work this paper cites.
The computational complexity of asymptotic problems. I. Partial orders
K. J. Compton · 1988
Earlier work this paper cites.
Quasi-random tournaments
F. R. K. Chung and R. L. Graham · 1991
Earlier work this paper cites.
Social network analysis: methods and applications
S. Wasserman and K. Faust · 1994
Earlier work this paper cites.
The two-parameter Poisson–Dirichlet distribution derived from a stable subordinator
J. Pitman and M. Yor · 1997
Earlier work this paper cites.
Multivariate sampling and the estimation problem for exchangeable arrays
O. Kallenberg · 1999
Earlier work this paper cites.
Estimation and prediction for stochastic blockstructures
K. Nowicki and T. A. B. Snijders · 2001
Earlier work this paper cites.
Minimal actions of the group 𝕊 ( ℤ ) \mathbb{S}(\mathbb{Z}) of permutations of the integers
E. Glasner and B. Weiss · 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.
Testing subgraphs in directed graphs
N. Alon and A. Shapira · 2004
Earlier work this paper cites.
Bayesian analysis of directed graphs data with applications to social networks
P. S. Gill and T. B. Swartz · 2004
Cited alongside, same era.
Discovering latent classes in relational data
C. Kemp, T. L. Griffiths, and J. B. Tenenbaum · 2004
Cited alongside, same era.
Compatible prior distributions for directed acyclic graph models
A. Roverato and G. Consonni · 2004
Cited alongside, same era.
Learning systems of concepts with an infinite relational model
C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda · 2006
Cited alongside, same era.
Limits of dense graph sequences
L. Lovász and B. Szegedy · 2006
Cited alongside, same era.
Fast inference in infinite hidden relational models
Z. Xu, V. Tresp, S. Yu, K. Yu, and H. Kriegel · 2007
Cited alongside, same era.
Dynamic probabilistic models for latent feature propagation in social networks
C. Heaukulani and Z. Ghahramani · 2013
Later among the works it cites.
Nonparametric multi-group membership model for dynamic networks
M. Kim and J. Leskovec · 2013
Later among the works it cites.
Exchangeable databases and their functional representation
J. R. Lloyd, P. Orbanz, Z. Ghahramani, and D. M. Roy · 2013
Later among the works it cites.
Limits, regularity and removal for finite structures
A. Aroskar and J. Cummings · 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.
A consistent histogram estimator for exchangeable graph models
S. H. Chan and E. Airoldi · 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…
Mixed membership stochastic blockmodels
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing · 2008
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.
Dynamic mixed membership blockmodel for evolving networks
W. Fu, L. Song, and E. P. Xing · 2009
Cited alongside, same era.
Nonparametric latent feature models for link prediction
K. T. Miller, T. L. Griffiths, and M. I. Jordan · 2009
Cited alongside, same era.
Extremal problems on the hypercube
D. Offner · 2009
Cited alongside, same era.
Multigraph limits, unbounded kernels, and Banach space decorated graphs
D. Kunszenti-Kovács, L. Lovász, and B. Szegedy · 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.
Matrix estimation by universal singular value thresholding
S. Chatterjee · 2015
Closest in time.
Poset limits can be totally ordered
J. Hladký, A. Máthé, V. Patel, and O. Pikhurko · 2015
Closest in time.
Bayesian models of graphs, arrays and other exchangeable random structures
P. Orbanz and D. M. Roy · 2015
Closest in time.
The class of random graphs arising from exchangeable random measures
V. Veitch and D. M. Roy · 2015
Closest in time.
Sparse exchangeable graphs and their limits via graphon processes
C. Borgs, J. T. Chayes, H. Cohn, and N. Holden · 2016
Closest in time.
Edge-exchangeable graphs and sparsity
D. Cai, T. Campbell, and T. Broderick · 2016
Closest in time.
On estimation in tournaments and graphs under monotonicity constraints
S. Chatterjee and S. Mukherjee · 2016
Closest in time.
Edge exchangeable models for network data
H. Crane and W. Dempsey · 2016
Closest in time.
Completely random measures for modelling block-structured sparse networks
T. Herlau and M. Schmidt · 2016
Closest in time.
Decomposition of tournament limits
E. Thörnblad · 2016
Closest in time.