Fetching the paper…
Reading the bibliography…
We describe the asymptotic properties of the edge-triangle exponential random graph model as the natural parameters diverge along straight lines.
Goodman, A.W.: On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66, 778-783 (1959)
1959
Earlier work this paper cites.
Bollobás, B: Relations between sets of complete subgraphs. In: Nash-Williams, C., Sheehan, J. (eds.) Proceedings of the Fifth British Combinatorial Conference, Congressus Numerantium, No. XV, pp. 79-84. Utilitas Mathematica Publishing, Winnipeg (1976)
1976
Earlier work this paper cites.
Erdős, P., Kleitman, D.J., Rothschild, B.L.: Asymptotic enumeration of K n K_{n} -free graphs. International Colloquium on Combinatorial Theory, Volume 2, pp. 19-27. Atti dei Convegni Lincei, Rome (1976)
1976
Earlier work this paper cites.
Barndorff-Nielsen, O.: Information and Exponential Families in Statistical Theory. John Wiley & Sons, New York (1978)
1978
Earlier work this paper cites.
Aldous, D.: Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11, 581-598 (1981)
1981
Earlier work this paper cites.
Holland, P., Leinhardt, S.: An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76, 33-50 (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.
Lovász, L., Simonovits, M.: On the number of complete subgraphs of a graph II. In: Erdős, P. et al. (eds.) Studies in Pure Mathematics, To the Memory of Paul Turán, pp. 459-495. Springer, Basel (1983)
1983
Earlier work this paper cites.
Ma, S.-K.: Statistical Mechanics. World Scientific, Singapore (1985)
1985
Earlier work this paper cites.
Brown, L.: Fundamentals of Statistical Exponential Families. IMS Lecture Notes – Monograph Series, Volume 9. Institute of Mathematical Statistics, Hayward (1986)
1986
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.
Fisher, D.C.: Lower bounds on the number of triangles in a graph. J. Graph Theory 13, 505-512 (1989)
1989
Earlier work this paper cites.
Geyer, C.J., Thompson, E.A.: Constrained Monte Carlo maximum likelihood for dependent data. J. R. Statist. Soc. B 54, 657-699 (1992)
1992
Earlier work this paper cites.
Wasserman, S., Pattison, P.E.: Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p*. Psychometrika 61, 401-425 (1996)
1996
Earlier work this paper cites.
Watts, D., Strogatz, S.: Collective dynamics of ‘small-world’ networks. Nature 393, 440-442 (1998)
1998
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.
Pattison, P.E., Wasserman, S.: Logit models and logistic regressions for social networks: II. Multivariate relations. Br. J. Math. Stat. Psychol. 52, 169-194 (1999)
1999
Earlier work this paper cites.
Robins, G.L., Pattison, P.E., Wasserman, S.: Logit models and logistic regressions for social networks: III. Valued relations. Psychometrika 64, 371-394 (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.
Handcock, M.S.: Assessing degeneracy in statistical models of social networks. Working paper no. 39, Center for Statistics and the Social Sciences, University of Washington (2003)
2003
Cited alongside, same era.
Lauritzen, S.L.: Rasch models with exchangeable rows and columns. In: Bernardo, J.M., Bayarri, M.J., Berger, J.O., Dawid, A.P., Heckerman, D., Smith, A.F.M., West, M. (eds.) Bayesian Statistics 7, pp. 215-232. Oxford University Press, Oxford (2003)
2003
Cited alongside, same era.
Csiszár, I., Matúš, F.: Closure of exponential families. Ann. Probab. 33, 582-600 (2005)
2005
Cited alongside, same era.
Diestel, R.: Graph Theory. Springer, New York (2005)
2005
Cited alongside, same era.
Kallenberg, O.: Probabilistic Symmetries and Invariance Principles. Springer, New York (2005)
2005
Cited alongside, same era.
Rinaldo, A., Fienberg, S., Zhou, Y.: On the geometry of discrete exponential families with application to exponential random graph models. Electron. J. Stat. 3, 446-484 (2009)
2009
Later among the works it cites.
Fienberg, S.: Introduction to papers on the modeling and analysis of network data. Ann. Appl. Statist. 4, 1-4 (2010)
2010
Later among the works it cites.
Fienberg, S.: Introduction to papers on the modeling and analysis of network data II. Ann. Appl. Statist. 4, 533-534 (2010)
2010
Later among the works it cites.
Newman, M.: Networks: An Introduction. Oxford University Press, New York (2010)
2010
Later among the works it cites.
Pikhurko, O.: An analytic approach to stability. Discrete Math. 310, 2951-2964 (2010)
2010
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., 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
Cited alongside, same era.
Lovász, L., Szegedy, B.: Limits of dense graph sequences. J. Combin. Theory Ser. B 96, 933-957 (2006)
2006
Cited alongside, same era.
Snijders, T., Pattison, P., Robins, G., Handcock, M.: New specifications for exponential random graph models. Sociol. Method. 36, 99-153 (2006)
2006
Cited alongside, same era.
Robins, G.L., Pattison, P.E., Kalish, Y., Lusher, D.: An introduction to exponential random graph (p*) models for social networks. Social Networks 29, 173-191 (2007)
2007
Cited alongside, same era.
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
Cited alongside, same era.
Csiszár, I., Matúš, F.: Generalized maximum likelihood estimates for exponential families. Probab. Theory Related Fields 141, 213-246 (2008)
2008
Cited alongside, same era.
Diaconis, P., Janson, S.: Graph limits and exchangeable random graphs. Rendiconti di Matematica 28, 33-61 (2008)
2008
Cited alongside, same era.
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (2010)
2010
Later among the works it cites.
Bhamidi, S., Bresler, G., Sly, A.: Mixing time of exponential random graphs. Ann. Appl. Probab. 21, 2146-2170 (2011)
2011
Later among the works it cites.
Chatterjee, S., Diaconis, P.: Estimating and understanding exponential random graph models. arXiv: 1102.2650 (2011)
2011
Later among the works it cites.
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
Later among the works it cites.
Engström, A., Norén, P.: Polytopes from subraph statistics. arXiv: 1011.3552 (2011)
2011
Later among the works it cites.
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
Later among the works it cites.
Fadnavis, S.: Graph colorings and graph limits. http://purl.stanford.edu/dr620kx9292 (2012)
2012
Later among the works it cites.
Lovász, L.: Large Networks and Graph Limits. American Mathematical Society, Providence (2012)
2012
Later among the works it cites.
Lubetzky, E., Zhao, Y.: On replica symmetry of large deviations in random graphs. arXiv: 1210.7013 (2012)
2012
Later among the works it cites.
Radin, C., Sadun, L.: Phase transitions in a complex network. J. Phys. A 46, 305002 (2013)
2013
Closest in time.
Radin, C., Yin, M.: Phase transitions in exponential random graphs. Ann. Appl. Probab. 23, 2458-2471 (2013)
2013
Closest in time.
Shalizi, C.R., Rinaldo, A.: Consistency under sampling of exponential random graph models. Ann. Statist. 41, 508-535 (2013)
2013
Closest in time.
Yan, T., Xu, J.: A central limit theorem in the β \beta -model for undirected random graphs with a diverging number of vertices. Biometrika 100, 519-524 (2013)
2013
Closest in time.