Fetching the paper…
Reading the bibliography…
We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges.
A. A. Markov, Sur quelques formules limites du calcul des probabilités (Russian). Bulletin de l’Académie Impériale des Sciences, Petrograd 11
1917
Earlier work this paper cites.
G. Pólya, Sur quelques points de la théorie des probabilités. Ann. Inst. Poincaré 1
1930
Earlier work this paper cites.
Miloslav Jiřina, Stochastic branching processes with continuous state space. Czechoslovak Math. J. 8 (83)
1958
Earlier work this paper cites.
On the evolution of random graphs
Paul Erdős and Alfréd Rényi · 1960
Earlier work this paper cites.
Donald A. Darling. Some limit theorems associated with multinomial trials. Proc. Fifth Berkeley Sympos. Math. Statist. and Probability (Berkeley, Calif., 1965/66) , Vol. II: Contributions to Probability Theory, Part 1, pp. 345–350, Univ. California Press, Berkeley, CA, 1967
1967
Earlier work this paper cites.
Samuel Karlin. Central limit theorems for certain infinite urn schemes. J. Math. Mech. 17
1967
Earlier work this paper cites.
Harry Kesten (1968). Review of Darling, Some limit theorems associated with multinomial trials. Math. Reviews 35
1968
Earlier work this paper cites.
R. T. Smythe. Strong laws of large numbers for r r -dimensional arrays of random variables. Ann. Probability 1
1973
Earlier work this paper cites.
Norman L. Johnson and Samuel Kotz, Urn Models and their Application . Wiley, New York, 1977
1977
Earlier work this paper cites.
Michael Dutko. Central limit theorems for infinite urn models. Ann. Probab. 17
1989
Earlier work this paper cites.
Svante Janson, Donald E. Knuth, Tomasz Łuczak and Boris Pittel. The birth of the giant component. Random Struct. Alg. 4
1994
Earlier work this paper cites.
Svante Janson, Tomasz Łuczak and Andrzej Ruciński. Random Graphs . Wiley, New York, 2000
2000
Earlier work this paper cites.
Béla Bollobás. Random Graphs . 2nd ed. Cambridge Univ. Press, Cambridge, 2001
2001
Earlier work this paper cites.
Svante Janson, Functional limit theorems for multitype branching processes and generalized Pólya urns. Stoch. Process. Appl. 110
2004
Cited alongside, same era.
Svante Janson, Limit theorems for triangular urn schemes. Probab. Theory Rel. Fields 134
2005
Cited alongside, same era.
Jim Pitman. Combinatorial Stochastic Processes . Ecole d’Eté de Probabilités de Saint-Flour XXXII – 2002. Lecture Notes in Mathematics, 1875. Springer-Verlag, Berlin, 2006
2006
Cited alongside, same era.
Béla Bollobás, Svante Janson and Oliver Riordan. The phase transition in inhomogeneous random graphs. Random Struct. Alg. 31
2007
Cited alongside, same era.
Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós and Katalin Vesztergombi. Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Advances in Math. 219
2008
2015
Later among the works it cites.
Peter Orbanz and Daniel M. Roy. Bayesian models of graphs, arrays and other exchangeable structures. IEEE Trans. Pattern Analysis and Machine Intelligence 37
2015
Later among the works it cites.
2015
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Percy Diaconis and Svante Janson. Graph limits and exchangeable random graphs. Rendiconti di Matematica 28
2008
Cited alongside, same era.
Hsien-Kuei Hwang and Svante Janson. Local limit theorems for finite and infinite urn models. Ann. Probab. 36
2008
Cited alongside, same era.
Christian Borgs, Jennifer Chayes and László Lovász. Moments of two-variable functions and the uniqueness of graph limits. Geom. Funct. Anal. 19
2010
Cited alongside, same era.
Boris Pittel. On a random graph evolving by degrees. Adv. Math. 223
2010
Cited alongside, same era.
Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós and Katalin Vesztergombi. Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176
2012
Cited alongside, same era.
László Lovász, Large Networks and Graph Limits . American Mathematical Society, Providence, RI, 2012
2012
Cited alongside, same era.
Svante Janson. Graphons, cut norm and distance, rearrangements and coupling. New York J. Math. Monographs 4
2013
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
Harry Crane. The ubiquitous Ewens sampling formula. Statist. Sci. 31
2016
Later among the works it cites.
2016
Later among the works it cites.
Harry Crane and Walter Dempsey. Relational exchangeability. Preprint, 2016. arXiv:1607.06762v1
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
Remco van der Hofstad. Random Graphs and Complex Networks, Volume 1 . Cambridge University Press, Cambridge, 2017
2017
Closest in time.
Svante Janson. On convergence for graphexes. Preprint, 2017
2017
Closest in time.