Fetching the paper…
Reading the bibliography…
The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of edges.
Aldous, D.: Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11, 581-598 (1981)
1981
Earlier work this paper cites.
Hoover, D.: Row-column exchangeability and a generalized model for probability. In: Koch, G., Spizzichino, F. (eds.) Exchangeability in Probability and Statistics, pp. 281-291. North-Holland, Amsterdam (1982)
1982
Earlier work this paper cites.
Frank, O., Strauss, D.: Markov graphs. J. Amer. Statist. Assoc. 81, 832-842 (1986)
1986
Earlier work this paper cites.
Häggström, O., Jonasson, J.: Phase transition in the random triangle model. J. Appl. Probab. 36, 1101-1115 (1999)
1999
Earlier work this paper cites.
Bollobás, B.: Random Graphs, Volume 73 of Cambridge Studies in Advanced Mathematics. 2nd ed. Cambridge University Press, Cambridge (2001)
2001
Earlier work this paper cites.
Touchette, H., Ellis, R.S., Turkington, B.: An introduction to the thermodynamic and macrostate levels of nonequivalent ensembles. Physica A 340, 138-146 (2004)
2004
Earlier work this paper cites.
Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Vesztergombi, K.: Counting graph homomorphisms. In: Klazar, M., Kratochvil, J., Loebl, M., Thomas, R., Valtr, P. (eds.) Topics in Discrete Mathematics, Volume 26, pp. 315-371. Springer, Berlin (2006)
2006
Earlier work this paper cites.
Lovász, L., Szegedy B.: Limits of dense graph sequences. J. Combin. Theory Ser. B 96, 933-957 (2006)
2006
Earlier work this paper cites.
Borgs, C., Chayes, J.T., Lovász, L., Sós, V.T., Vesztergombi, K.: Convergent sequences of dense graphs I. Subgraph frequencies, metric properties and testing. Adv. Math. 219, 1801-1851 (2008)
2008
Earlier work this paper cites.
Razborov, A.: On the minimal density of triangles in graphs. Combin. Probab. Comput. 17, 603-618 (2008)
2008
Cited alongside, same era.
Newman, M.: Networks: An Introduction. Oxford University Press, New York (2010)
2010
Cited alongside, same era.
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (2010)
2010
Cited alongside, same era.
Chatterjee, S., Diaconis, P., Sly, A.: Random graphs with a given degree sequence. Ann. Appl. Prob. 21, 1400-1435 (2011)
2011
Cited alongside, same era.
Chatterjee, S., Varadhan, S.R.S.: The large deviation principle for the Erdős-Rényi random graph. European J. Combin. 32, 1000-1017 (2011)
2011
Cited alongside, same era.
Radin, C., Sadun, L.: Phase transitions in a complex network. J. Phys. A 46, 305002 (2013)
2013
Later among the works it cites.
Radin, C., Sadun, L.: Singularities in the entropy of asymptotically large simple graphs. arXiv: 1302.3531 (2013)
2013
Later among the works it cites.
Radin, C., Yin, M.: Phase transitions in exponential random graphs. Ann. Appl. Probab. 23, 2458-2471 (2013)
2013
Later among the works it cites.
Yin, M.: Critical phenomena in exponential random graphs. J. Stat. Phys. 153, 1008-1021 (2013)
2013
Later among the works it cites.
Yin, M., Rinaldo, A., Fadnavis, S.: Asymptotic quantization of exponential random graphs. arXiv: 1311.1738 (2013)
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Borgs, C., Chayes, J.T., Lovász, L., Sós, V.T., Vesztergombi, K.: Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. 176, 151-219 (2012)
2012
Cited alongside, same era.
Lovász, L.: Large Networks and Graph Limits. American Mathematical Society, Providence (2012)
2012
Cited alongside, same era.
Aristoff, D, Radin, C.: Emergent structures in large networks. J. Appl. Prob. 50, 883-888 (2013)
2013
Cited alongside, same era.
Chatterjee, S., Diaconis, P.: Estimating and understanding exponential random graph models. Ann. Statist. 41, 2428-2461 (2013)
2013
Cited alongside, same era.
Borgs, C., Chayes, J.T., Cohn, H., Zhao, Y: An L p L^{p} theory of sparse graph convergence I. Limits, sparse random graph models, and power law distributions. arXiv: 1401.2906 (2014)
2014
Closest in time.
Lubetzky, E., Zhao, Y.: On the variational problem for upper tails in sparse random graphs. arXiv: 1402.6011 (2014)
2014
Closest in time.
Radin, C., Ren, K., Sadun, L.: The asymptotics of large constrained graphs. arXiv: 1401.1170 (2014)
2014
Closest in time.
van der Hofstad, R.: Random Graphs and Complex Networks. http://www.win.tue.nl/ ∼ \scriptstyle\mathtt{\sim}
2014
Closest in time.