Fetching the paper…
Reading the bibliography…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs).
Gale, DavidD. (1957). A theorem on flows in networks. Pacific J. Math. 7 1073–1082
1957
Earlier work this paper cites.
Ryser, H. J.H. J. (1957). Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9 371–377
1957
Earlier work this paper cites.
Erdős, P.P. andRényi, A.A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 17–61
1960
Earlier work this paper cites.
Erdős, P.P. andGallai, T.T. (1960). Graphen mit punkten vorgeschriebenen grades. Mat. Lapok 11 264–274
1960
Earlier work this paper cites.
Hoeffding, WassilyW. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13–30
1963
Earlier work this paper cites.
Bishop, Yvonne M. M.Y. M. M., Fienberg, Stephen E.S. E. andHolland, Paul W.P. W. (1975). Discrete Multivariate Analysis: Theory and Practice. MIT Press, Cambridge, MA
1975
Earlier work this paper cites.
Barndorff-Nielsen, OleO. (1978). Information and Exponential Families in Statistical Theory. Wiley, Chichester
1978
Earlier work this paper cites.
Diaconis, PersiP. andYlvisaker, DonaldD. (1979). Conjugate priors for exponential families. Ann. Statist. 7 269–281
1979
Earlier work this paper cites.
Aldous, David J.D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581–598
1981
Earlier work this paper cites.
Diaconis, P.P. andFreedman, D.D. (1984). Partial exchangeability and sufficiency. In Statistics: Applications and New Directions (Calcutta, 1981)
1981
Earlier work this paper cites.
Holland, Paul W.P. W. andLeinhardt, SamuelS. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33–65
1981
Earlier work this paper cites.
Hoover, D. N.D. N. (1982). Row-column exchangeability and a generalized model for probability. In Exchangeability in Probability and Statistics (Rome, 1981)
1981
Earlier work this paper cites.
Portnoy, StephenS. (1984). Asymptotic behavior of M M -estimators of p p regression parameters when p 2 / n p^{2}/n is large. I. Consistency. Ann. Statist. 12 1298–1309
1984
Earlier work this paper cites.
Portnoy, StephenS. (1985). Asymptotic behavior of M M estimators of p p regression parameters when p 2 / n p^{2}/n is large. II. Normal approximation. Ann. Statist. 13 1403–1417
1985
Earlier work this paper cites.
Brown, Lawrence D.L. D. (1986). Fundamentals of Statistical Exponential Families with Applications in Statistical Decision Theory. Institute of Mathematical Statistics Lecture Notes—Monograph Series 9. IMS, Hayward, CA
1986
Earlier work this paper cites.
Lauritzen, Steffen L.S. L. (1988). Extremal Families and Systems of Sufficient Statistics. Lecture Notes in Statistics 49. Springer, New York
1988
Earlier work this paper cites.
Portnoy, StephenS. (1988). Asymptotic behavior of likelihood methods for exponential families when the number of parameters tends to infinity. Ann. Statist. 16 356–366
1988
Earlier work this paper cites.
McDiarmid, ColinC. (1989). On the method of bounded differences. In Surveys in Combinatorics, 1989 (Norwich, 1989)
1989
Earlier work this paper cites.
McKay, Brendan D.B. D. andWormald, Nicholas C.N. C. (1990). Asymptotic enumeration by degree sequence of graphs of high degree. European J. Combin. 11 565–580
1990
Cited alongside, same era.
Portnoy, StephenS. (1991). Correction: “Asymptotic behavior of M M estimators of p p regression parameters when p 2 / n p^{2}/n is large. II. Normal approximation.” Ann. Statist. 19 2282
1991
Cited alongside, same era.
Gutiérrez-Peña, E.E. andSmith, A. F. M.A. F. M. (1995). Conjugate parameterizations for natural exponential families. J. Amer. Statist. Assoc. 90 1347–1356
1995
Cited alongside, same era.
Mahadev, N. V. R.N. V. R. andPeled, U. N.U. N. (1995). Threshold Graphs and Related Topics. Annals of Discrete Mathematics 56. North-Holland, Amsterdam
1995
Cited alongside, same era.
Molloy, MichaelM. andReed, BruceB. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 161–179
Austin, TimT. (2008). On exchangeable random variables and the statistics of large graphs and hypergraphs. Probab. Surv. 5 80–145
2008
Later among the works it cites.
Borgs, C.C., Chayes, J. T.J. T., Lovász, L.L., Sós, V. T.V. T. andVesztergombi, K.K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801–1851
2008
Later among the works it cites.
Diaconis, PersiP. andJanson, SvanteS. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7)
2008
Later among the works it cites.
Jackson, Matthew O.M. O. (2008). Social and Economic Networks. Princeton Univ. Press, Princeton, NJ
2008
Later among the works it cites.
Tsourakakis, C.C. (2008). Fast counting of triangles in large real networks: Algorithms and laws. In Proc. of ICDM 2008
2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1995
Cited alongside, same era.
Gutiérrez-Peña, EduardoE. andSmith, Adrian F. M.A. F. M. (1996). Erratum: “Conjugate parameterizations for natural exponential families.” J. Amer. Statist. Assoc. 91 1757
1996
Cited alongside, same era.
Molloy, MichaelM. andReed, BruceB. (1998). The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 7 295–305
1998
Cited alongside, same era.
Simons, GordonG. andYao, Yi-ChingY.-C. (1999). Asymptotics when the number of parameters tends to infinity in the Bradley–Terry model for paired comparisons. Ann. Statist. 27 1041–1060
1999
Cited alongside, same era.
Wormald, N. C.N. C. (1999). Models of random regular graphs. In Surveys in Combinatorics, 1999 (Canterbury)
1999
Cited alongside, same era.
Newman, M. E. J.M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45 167–256 (electronic)
2003
Cited alongside, same era.
Hunter, David R.D. R. (2004). MM algorithms for generalized Bradley–Terry models. Ann. Statist. 32 384–406
2004
Cited alongside, same era.
Park, JuyongJ. andNewman, M. E. J.M. E. J. (2004). Statistical mechanics of networks. Phys. Rev. E (3)
2004
Cited alongside, same era.
Wainwright, M. J.M. J. andJordan, M. I.M. I. (2008). Graphical models, exponential families and variational inference. Foundations and Trends in Machine Learning 1 1–305
2008
Later among the works it cites.
2009
Later among the works it cites.
2009
Later among the works it cites.
Blitzstein, J.J. andDiaconis, P.P. (2009). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Preprint. Available at http://www.people.fas.harvard.edu/~blitz/ BlitzsteinDiaconisGraphAlgorithm.pdf
2009
Later among the works it cites.
Diaconis, PersiP., Holmes, SusanS. andJanson, SvanteS. (2008). Threshold graph limits and random threshold graphs. Internet Math. 5 267–320 (2009)
2009
Later among the works it cites.
Kolaczyk, E. D.E. D. (2009). Statistical Analysis of Network Data: Methods and Models. Springer, New York
2009
Later among the works it cites.
Willinger, WalterW., Alderson, DavidD. andDoyle, John C.J. C. (2009). Mathematics and the Internet: A source of enormous confusion and great potential. Notices Amer. Math. Soc. 56 586–599
2009
Later among the works it cites.
Austin, TimT. andTao, TerenceT. (2010). Testability and repair of hereditary hypergraph properties. Random Structures Algorithms 36 373–463
2010
Closest in time.
Barvinok, AlexanderA. (2010). What does a random contingency table look like? Combin. Probab. Comput. 19 517–539
2010
Closest in time.
Barvinok, AlexanderA. (2010). On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries. Adv. Math. 224 316–339
2010
Closest in time.
Barvinok, AlexanderA. andHartigan, J. A.J. A. (2010). Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes. Adv. in Appl. Math. 45 252–289
2010
Closest in time.
2010
Closest in time.