Sparse graphs using exchangeable random measures

Journal of the Royal Statistical Society. Series B: Statistical Methodology

Volumn 79, Issue 5, 2017, Pages 1295-1366

  Caron, François ^a   Fox, Emily B ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Exchangeability; Generalized gamma process; L vy measure; Point process; Random graphs

Indexed keywords

EID: 85030247604     PISSN: 13697412     EISSN: 14679868     Source Type: Journal    
DOI: 10.1111/rssb.12233     Document Type: Article

References (228)

1. Aalen, O. (1992) Modelling heterogeneity in survival analysis by the compound Poisson distribution. Ann. Appl. Probab., 2, 951–972.
2. Adamic, L. A. and Glance, N. (2005) The political blogosphere and the 2004 US election: divided they blog. In Proc. 3rd Int. Wrkshp Link Discovery, pp. 36–43. New York: Association for Computing Machinery.
3. Airoldi, E. M., Blei, D., Fienberg, S. E. and Xing, E. (2008) Mixed membership stochastic blockmodels. J. Mach. Learn. Res., 9, 1981–2014.
4. Airoldi, E. M., Costa, T. B. and Chan, S. H. (2013) Stochastic blockmodel approximation of a graphon: theory and consistent estimation. In Advances in Neural Information Processing Systems, vol. Red Hook: Curran Associates
5. Aldous, D. (1985) Exchangeability and related topics. In École d’Été de Probabilités de Saint-Flour XIII–1983, pp. 1–198. Berlin: Springer.
6. Aldous, D. (1997) Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab., 25, 812–854.
7. Aldous, D. J. (1981) Representations for partially exchangeable arrays of random variables. J. Multiv. Anal., 11, 581–598.
8. Arcones, M. and Giné, E. (1992) On the bootstrap of U and V statistics. Ann. Statist., 20, 655–674.
9. Barabási, A. L. and Albert, R. (1999) Emergence of scaling in random networks. Science, 286, 509–512.
10. Bastian, M., Heymann, S. and Jacomy, M. (2009) Gephi: an open source software for exploring and manipulating networks. In Proc. 3rd Int. Conf. Weblogs and Social Media, vol. 8, pp. 361–362. Palo Alto: Association for the Advancement of Artificial Intelligence.
11. Berger, N., Borgs, C., Chayes, J. T. and Saberi, A. (2014) Asymptotic behavior and distributional limits of preferential attachment graphs. Ann. Probab., 42, 1–40.
12. Bertoin, J. (2006) Random Fragmentation and Coagulation Processes. Cambridge: Cambridge University Press.
13. Bickel, P. J. and Chen, A. (2009) A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Natn. Acad. Sci. USA, 106, 21068–21073.
14. Bickel, P. J., Chen, A. and Levina, E. (2011) The method of moments and degree distributions for network models. Ann. Statist., 39, 2280–2301.
15. Blackwell, D. and MacQueen, J. B. (1973) Ferguson distributions via Pólya urn schemes. Ann. Statist., 1, 353–355.
16. Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combin., 1, 311–316.
17. Bollobás, B. (2001) Random Graphs. Cambridge: Cambridge University Press.
18. Bollobás, B., Janson, S. and Riordan, O. (2007) The phase transition in inhomogeneous random graphs. Rand. Struct. Algs, 31, 3–122.
19. Bollobás, B. and Riordan, O. (2009) Metrics for sparse graphs. In Surveys in Combinatorics (eds S. Huczynska, J. Mitchell and C. Roney-Dougal), pp. 211–287. Cambridge: Cambridge University Press.
20. Borgs, C., Chayes, J. T., Cohn, H. and Holden, N. (2016) Sparse exchangeable graphs and their limits via graphon processes. Preprint arXiv:1601.07134. Microsoft Research, Cambridge.
21. p theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions. Preprint arXiv:1401.2906. Microsoft Research, Cambridge.
22. p theory of sparse graph convergence II: LD convergence, quotients, and right convergence. Preprint arXiv:1408.0744. Microsoft Research, Cambridge.
23. Borgs, C., Chayes, J. T. and Gamarnik, D. (2017) Convergent sequences of sparse graphs: a large deviations approach. Rand. Struct. Algs, 51, 52–89.
24. Borgs, C., Chayes, J. T. and Lovász, L. (2010) Moments of two-variable functions and the uniqueness of graph limits. Geometr. Functnl Anal., 19, 1597–1619.
25. Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T. and Vesztergombi, K. (2008) Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Adv. Math., 219, 1801–1851.
26. Britton, T., Deijfen, M. and Martin-Löf, A. (2006) Generating simple random graphs with prescribed degree distribution. J. Statist. Phys., 124, 1377–1397.
27. Brix, A. (1999) Generalized gamma measures and shot-noise Cox processes. Adv. Appl. Probab., 31, 929–953.
28. Brooks, S. P. and Gelman, A. (1998) General methods for monitoring convergence of iterative simulations. J. Computnl Graph. Statist., 7, 434–455.
29. Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L. and Zhang, N. (2003) Topological structure analysis of the protein–protein interaction network in budding yeast. Nucleic Acids Res., 31, 2443–2450.
30. Bühlmann, H. (1960) Austauschbare stochastische Variablen und ihre Grenzwertsätze. PhD Thesis. University of California at Berkeley, Berkeley.
31. Caron, F. (2012) Bayesian nonparametric models for bipartite graphs. In Advances in Neural Information Processing Systems, vol. Red Hook: Curran Associates
32. Caron, F. and Fox, E. B. (2014) Bayesian nonparametric models of sparse and exchangeable random graphs. Preprint arXiv 1401.1137.
33. Caron, F., Teh, Y. W. and Murphy, T. B. (2014) Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes. Ann. Appl. Statist., 8, 1145–1181.
34. Chen, T., Fox, E. and Guestrin, C. (2014) Stochastic gradient Hamiltonian Monte Carlo. J. Mach. Learn. Res., 32, 1683–1691.
35. Choi, D. and Wolfe, P. J. (2014) Co-clustering separately exchangeable network data. Ann. Statist., 42, 29–63.
36. Clauset, A., Shalizi, C. R. and Newman, M. E. J. (2009) Power-law distributions in empirical data. SIAM Rev., 51, 661–703.
37. Colizza, V., Pastor-Satorras, R. and Vespignani, A. (2007) Reaction–diffusion processes and metapopulation models in heterogeneous networks. Nat. Phys., 3, 276–282.
38. Daley, D. J. and Vere-Jones, D. (2003) An Introduction to the Theory of Point Processes, vol. I, Elementary Theory and Methods, 2nd edn. New York: Springer.
39. Daley, D. J. and Vere-Jones, D. (2008) An Introduction to the Theory of Point Processes, vol. II, General Theory and Structure, 2nd edn. New York: Springer.
40. Devroye, L. (2009) Random variate generation for exponentially and polynomially tilted stable distributions. ACM Trans. Modlng Comput. Simuln, 19, article 18.
41. Diaconis, P. and Janson, S. (2008) Graph limits and exchangeable random graphs. Rend. Mat. Applic. VII, 28, 33–61.
42. Duane, S., Kennedy, A. D., Pendleton, B. J. and Roweth, D. (1987) Hybrid Monte Carlo. Phys. Lett. B, 195, 216–222.
43. Durrett, R. (2007) Random Graph Dynamics. New York: Cambridge University Press.
44. Favaro, S. and Teh, Y. (2013) MCMC for normalized random measure mixture models. Statist. Sci., 28, 335–359.
45. Feller, W. (1971) An Introduction to Probability Theory and Its Applications, vol. II, 2nd edn. New York: Wiley.
46. Ferguson, T. and Klass, M. (1972) A representation of independent increment processes without gaussian components. Ann. Math. Statist., 43, 1634–1643.
47. Fienberg, S. E. (2012) A brief history of statistical models for network analysis and open challenges. J. Computnl Graph. Statist., 21, 825–839.
48. de Finetti, B. (1931) Funzione caratteristica di un fenomeno aleatorio. Atti R. Acad. Nazn. Linc., Ser. 6, 4, 251–299.
49. Freedman, D. A. (1996) De Finetti's theorem in continuous time. Lect. Notes Monogr. Ser., 30, 83–98.
50. Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D., Vehtari, A. and Rubin, D. (2014) Bayesian Data Analysis. Boca Raton: Chapman and Hall–CRC.
51. Giné, E. and Zinn, J. (1992). Marcinkiewicz type laws of large numbers and convergence of moments for U-statistics. In Proc. 8th Int. Conf. Probability in Banach Spaces, pp. 273–291. Berlin: Birkhäuser
52. Gnedin, A., Hansen, B. and Pitman, J. (2007) Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Probab. Surv., 4, 146–171.
53. Gnedin, A., Pitman, J. and Yor, M. (2006) Asymptotic laws for compositions derived from transformed subordinators. Ann. Probab., 34, 468–492.
54. Goldenberg, A., Zheng, A., Fienberg, S. and Airoldi, E. (2010) A survey of statistical network models. Foundns Trends Mach. Learn., 2, 129–233.
55. Herlau, T., Schmidt, M. N. and Mørup, M. (2014) Infinite-degree-corrected stochastic block model. Phys. Rev. E, 90, article 032819.
56. Herlau, T., Schmidt, M. N. and Mørup, M. (2016) Completely random measures for modelling block-structured sparse networks. In Advances in Neural Information Processing Systems, vol. Red Hook: Curran Associates
57. Hofert, M. (2011) Sampling exponentially tilted stable distributions. ACM Trans. Modlng Comput. Simuln, 22, article 3.
58. Hoff, P. D. (2009) Multiplicative latent factor models for description and prediction of social networks. Computnl Math. Organizn Theory, 15, 261–272.
59. Hoff, P. D., Raftery, A. E. and Handcock, M. S. (2002) Latent space approaches to social network analysis. J. Am. Statist. Ass., 97, 1090–1098.
60. van der Hofstad, R. (2014) Random Graphs and Complex Networks, vol. I, Technical Report. Eindhoven: Eindhoven University of Technology.
61. Hoover, D. N. (1979) Relations on probability spaces and arrays of random variables. Preprint. Institute for Advanced Study, Princeton.
62. Hougaard, P. (1986) Survival models for heterogeneous populations derived from stable distributions. Biometrika, 73, 387–396.
63. Jacobs, A. Z. and Clauset, A. (2014) A unified view of generative models for networks: models, methods, opportunities and challenges. Preprint arXiv:1411.4070. University of Colorado, Boulder.
64. James, L. F. (2002) Poisson process partition calculus with applications to exchangeable models and bayesian nonparametrics. Preprint arXiv math/0205093. University of Hong Kong, Hong Kong.
65. James, L. F. (2005) Bayesian Poisson process partition calculus with an application to Bayesian Lévy moving averages. Ann. Statist., 33, 1771–1799.
66. James, L. F., Lijoi, A. and Prünster, I. (2009) Posterior analysis for normalized random measures with independent increments. Scand. J. Statist., 36, 76–97.
67. Janson, S. (2011) Probability asymptotics: notes on notation. Preprint arXiv:1108.3924. Uppsala University, Uppsala.
68. Kallenberg, O. (1990) Exchangeable random measures in the plane. J. Theoret. Probab., 3, 81–136.
69. Kallenberg, O. (2005) Probabilistic Symmetries and Invariance Principles. New York: Springer.
70. Karlin, S. (1967) Central limit theorems for certain infinite urn schemes. J. Math. Mech., 17, 373–401.
71. Karrer, B. and Newman, M. E. (2011) Stochastic blockmodels and community structure in networks. Phys. Rev. E, 83, article, 016107.
72. Kemp, C., Tenenbaum, J. B., Griffiths, T. L., Yamada, T. and Ueda, N.(2006) Learning systems of concepts with an infinite relational model. In Proc. 21st Natn. Conf. Artificial Intelligence, Boston, July 16th–20th, vol, pp. 381–388. Palo Alto: Association for the Advancement of Artificial Intelligence
73. Khintchine, A. (1937) Zur theorie der unbeschrankt teilbaren Verteilungsgesetze. Mat. Sborn., 2, 79–119.
74. Kingman, J. F. C. (1967) Completely random measures. Pacif. J. Math., 21, 59–78.
75. Kingman, J. F. C. (1993) Poisson Processes, vol. 3. New York: Oxford University Press.
76. Lauritzen, S. (2008) Exchangeable Rasch matrices. Rend. Mat. Applic. VII, 28, 83–95.
77. Lee, M.-L. T. and Whitmore, G. A. (1993) Stochastic processes directed by randomized time. J. Appl. Probab., 30, 302–314.
78. Lewis, P. A. and Shedler, G. S. (1979) Simulation of nonhomogeneous Poisson processes by thinning. Navl Res. Logist. Q., 26, 403–413.
79. Lijoi, A., Mena, R. H. and Prünster, I. (2007) Controlling the reinforcement in Bayesian non-parametric mixture models. J. R. Statist. Soc. B, 69, 715–740.
80. Lijoi, A. and Prünster, I. (2003) On a normalized random measure with independent increments relevant to Bayesian nonparametric inference. In Proc. 13th Eur. Young Statisticians Meet., pp. 123–134. The Hague: Bernoulli Society.
81. Lijoi, A. and Prünster, I. (2010) Models beyond the Dirichlet process. In Bayesian Nonparametrics (eds N. L. Hjort, C. Holmes, P. Müller and S. G. Walker). Cambridge: Cambridge University Press.
82. Lijoi, A., Prünster, I. and Walker, S. G. (2008) Investigating nonparametric priors with Gibbs structure. Statist. Sin., 18, 1653–1688.
83. Lloyd, J., Orbanz, P., Ghahramani, Z. and Roy, D. (2012) Random function priors for exchangeable arrays with applications to graphs and relational data. In Advances in Neural Information Processing Systems, vol. Red Hook: Curran Associates
84. Lovász, L. (2013) Large Networks and Graph Limits, vol. 60. Providence: American Mathematical Society.
85. Lovász, L. and Szegedy, B. (2006) Limits of dense graph sequences. J. Combin. Theory B, 96, 933–957.
86. McAuley, J. and Leskovec, J. (2012) Learning to discover social circles in ego networks. In Advances in Neural Information Processing Systems, vol, pp. 539–547. Red Hook: Curran Associates
87. Miller, K., Griffiths, T. and Jordan, M. (2009) Nonparametric latent feature models for link prediction. In Advances in Neural Information Processing Systems, vol. Red Hook: Curran Associates
88. Neal, R. M. (2011) MCMC using Hamiltonian dynamics. In Handbook of Markov Chain Monte Carlo (eds S. Brooks, A. Gelman, G. Jones and X.-L. Meng), vol. 2. Boca Raton: Chapman and Hall–CRC
89. Nešetřil, J. and Ossona de Mendez, P. (2012) Sparsity (Graphs, Structures, and Algorithms). Berlin: Springer.
90. Newman, M. E. J. (2001) The structure of scientific collaboration networks. Proc. Natn. Acad. Sci. USA, 98, 404–409.
91. Newman, M. E. J. (2003) The structure and function of complex networks. SIAM Rev., 45, 167–256.
92. Newman, M. E. J. (2010) Networks: an Introduction. New York: Oxford University Press.
93. Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2001) Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E, 64, article 26118.
94. Norros, I. and Reittu, H. (2006) On a conditionally Poissonian graph process. Adv. Appl. Probab., 38, 59–75.
95. Nowicki, K. and Snijders, T. (2001) Estimation and prediction for stochastic blockstructures. J. Am. Statist. Ass., 96, 1077–1087.
96. Ogata, Y. (1981) On Lewis’ simulation method for point processes. IEEE Trans. Inform. Theory, 27, 23–31.
97. Olhede, S. C. and Wolfe, P. J. (2012) Degree-based network models. Preprint arXiv:1211.6537. University College London, London.
98. Opsahl, T. and Panzarasa, P. (2009) Clustering in weighted networks. Socl Netwrks, 31, 155–163.
99. Orbanz, P. and Roy, D. M. (2015) Bayesian models of graphs, arrays and other exchangeable random structures. IEEE Trans. Pattn Anal. Mach. Intell., 37, 437–461.
100. Palla, K., Knowles, D. A. and Ghahramani, Z. (2012) An infinite latent attribute model for network data. In Proc. 29th Int. Conf. Machine Learning, Edinburgh.
101. Penrose, M. (2003) Random Geometric Graphs, vol. 5. New York: Oxford University Press.
102. Pitman, J. (1995) Exchangeable and partially exchangeable random partitions. Probab. Theory Reltd Flds, 102, 145–158.
103. Pitman, J. (1996) Some developments of the Blackwell-MacQueen urn scheme. In Statistics, Probability and Game Theory: Papers in Honor of David Blackwell (eds T. S. Ferguson, L. S. Shapley and J. B. MacQueen), pp. 245–267. Hayward: Institute of Mathematical Statistics.
104. Pitman, J. (2003) Poisson-Kingman partitions. Lect. Notes Monogr. Ser., 40, 1–34.
105. Pitman, J. (2006) Combinatorial stochastic processes. In École d’Eté de Probabilités de Saint-Flour XXXII–2002. New York: Springer.
106. Prünster, I. (2002) Random probability measures derived from increasing additive processes and their application to Bayesian statistics. PhD Thesis. University of Pavia, Pavia.
107. Regazzini, E., Lijoi, A. and Prünster, I. (2003) Distributional results for means of normalized random measures with independent increments. Ann. Statist., 31, 560–585.
108. Resnick, S. (1987) Extreme Values, Point Processes and Regular Variation. New York: Springer.
109. Rohe, K., Chatterjee, S. and Yu, B. (2011) Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist., 39, 1878–1915.
110. Todeschini, A. and Caron, F. (2016) Exchangeable random measures for sparse and modular graphs with overlapping communities. Preprint arXiv:1602.02114. University of Bordeaux, Bordeaux.
111. Veitch, V. and Roy, D. M. (2015) The class of random graphs arising from exchangeable random measures. Preprint arXiv:1512.03099. University of Toronto, Toronto.
112. Watts, D. J. and Strogatz, S. H. (1998) Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442.
113. Wolfe, P. J. and Olhede, S. C. (2013) Nonparametric graphon estimation. Preprint arXiv:1309.5936. University College London, London.
114. Zhao, Y., Levina, E. and Zhu, J. (2012) Consistency of community detection in networks under degree-corrected stochastic block models. Ann. Statist., 40, 2266–2292.
115. Airoldi, E. M., Blei, D. M., Fienberg, S. E. and Xing, E. P. (2008) Mixed membership stochastic blockmodels. J. Mach. Learn. Res., 9, 1981–2014.
116. Albert, R., Jeong, H. and Barabási, A.-L. (1999) Internet: diameter of the World-Wide Web. Nature, 401, 130–131.
117. Aldous, D. (1993) The continuum random tree III. Ann. Probab., 21, 248–289.
118. Aldous, D. J. (1981) Representations for partially exchangeable arrays of random variables. J. Multiv. Anal., 11, 581–598.
119. Aldous, D. J. (2014) Scale-invariant random spatial networks. Electron. J. Probab., 19, 1–4.
120. Aldous, D. J. and Ganesan, K. (2013) True scale-invariant random spatial networks. Proc. Natn. Acad. Sci. USA, 110, 8782–8785.
121. Aldous, D. and Steele, J. M. (2004) The objective method: probabilistic combinatorial optimization and local weak convergence. Encycl. Math. Sci., 110, 1–72.
122. Anand, K. and Bianconi, G. (2009) Entropy measures for networks: toward an information theory of complex topologies. Phys. Rev. E, 80, article 045102.
123. Anand, K. and Bianconi, G. (2010) Gibbs entropy of network ensembles by cavity methods. Phys. Rev. E, 82, article 011116.
124. Arbel, J., Prünster, I. and Walker, S. G. (2017) Asymptotic analysis of normalized random measures with independent increments. To be published.
125. Argiento, R., Bianchini, L. and Guglielmi, A. (2016) A blocked Gibbs sampler for NGG-mixture models via a priori truncation. Statist. Comput., 26, 641–661.
126. Athreya, A., Priebe, C. E., Tang, M., Lyzinski, V., Marchette, D. J. and Sussman, D. L. (2016) A limit theorem for scaled eigenvectors of random dot product graphs. Sankhya A, 78, 1–18.
127. Bacallado, S., Diaconis, P. and Holmes, S. (2015) de Finetti priors using Markov Chain Monte Carlo computations. Statist. Comput., 25, 797–808.
128. Barabási, A. L. (2016) Network Science. Cambridge: Cambridge University Press.
129. Barabási, A. L. and Albert, R. (1999) Emergence of scaling in random networks. Science, 286, 509–512.
130. Bast, H., Funke, S., Sanders, P. and Schultes, D. (2007) Fast routing in road networks with transit nodes. Science, 316, 566.
131. Bharath, K., Kambadur, P., Dey, D. K., Rao, A. and Baladandayuthapani, V. (2017) Statistical tests for large tree-structured data. J. Am. Statist. Ass., to be published.
132. Bickel, P. J. and Chen, A. (2009) A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Natn. Acad. Sci. USA, 106, 21068–21073.
133. Blei, D. and Jordan, M. (2006) Variational inference for Dirichlet process mixtures. Baysn Anal., 1, 121–144.
134. Bloem-Reddy, B., Favaro, S., Heaukulani, C. K., James, L. F. and Orbanz, P. (2017) Hierarchical q-latent feature models. Manuscript.
135. Boginski, V., Butenko, S. and Pardalos, P. M. (2005) Statistical analysis of financial networks. Computnl Statist. Data Anal., 48, 431–443.
136. Bollobás, B., Janson, S. and Riordan, O. (2007) The phase transition in inhomogeneous random graphs. Rand. Struct. Algs, 31, 3–122.
137. Bollobás, B. and Riordan, O. (2009) Metrics for sparse graphs. In Surveys in Combinatorics (eds S. Huczynska, J. D. Mitchell and C. M. Roney-Dougal), pp. 211–287. Cambridge: Cambridge University Press.
138. Bonifazi, P., Goldin, M., Picardo, M. A., Jorquera, I., Cattani, A., Bianconi, G., Represa, A., Ben-Ari, Y. and Cossart, R. (2009) GABAergic hub neurons orchestrate synchrony in developing hippocampal networks. Science, 326, 14–19.
139. Borgatti, S. P. and Everett, M. G. (2006) A graph-theoretic perspective on centrality. Socl Netwrks, 28, 466–484.
140. Borgs, C., Chayes, J. T., Cohn, H. and Holden, N. (2016) Sparse exchangeable graphs and their limits via graphon processes. Preprint arXiv:1601.07134. Microsoft Research, Cambridge.
141. p theory of sparse graph convergence: I, Limits, sparse random graph models, and power law distributions. Preprint arXiv:1401.2906. Microsoft Research, Cambridge.
142. Borgs, C., Chayes, J. and Smith, A. (2015) Private graphon estimation for sparse graphs. In Advances in Neural Information Processing Systems, vol. 28 (edsC. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama and R. Garnett). Red Hook: Curran Associates.
143. Bouchard-Côte, A., Vollmer, S. B. and Doucet, A. (2017) The bouncy particle sampler: a non-reversible rejection-free Markov chain Monte Carlo method. J. Am. Statist. Ass., to be published.
144. Brin, S. and Page, L. (1998) The anatomy of a large-scale hypertextual Web search engine. Comput. Netwrks, 30, 107–117.
145. Broderick, T. and Cai, D. (2015) Edge-exchangeable graphs, sparsity, and power laws. In Proc. Wrkshp Bayesian Nonparametrics: the Next Generation.
146. Cai, D., Campbell, T. and Broderick, T. (2016) Edge-exchangeable graphs and sparsity. In Advances in Neural Information Processing Systems, vol. (eds D. D. Lee, M. Sugiyama, U. Von Luxburg, I. Guyon and R. Garnett), pp. 4249–4257. Red Hook: Curran Associates.
147. Camerlenghi, F. (2015) Hierarchical and nested random probability measures with statistical applications. PhD Thesis. Department of Mathematics, University of Pavia, Pavia.
148. Campbell, T., Cai, D. and Broderick, T. (2016a) Exchangeable trait allocations. Preprint arXiv:1609.09147. Massachusetts Institute of Technology, Cambridge.
149. Campbell, T., Huggins, J., How, J. and Broderick, T. (2016b) Truncated random measures. Preprint arXiv:1603.00861. Massachusetts Institute of Technology, Cambridge.
150. Caron, F. and Doucet, A. (2012) Efficient Bayesian inference for generalized Bradley-Terry models. J. Computnl Graph. Statist., 21, 174–196.
151. Caron, F. and Rousseau, J. (2017) On sparsity and power-law properties of graphs based on exchangeable point processes. Preprint arXiv:1708.03120. University of Oxford, Oxford.
152. Caron, F., Teh, Y. W. and Murphy, T. B. (2014) Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes. Ann. Appl. Statist., 82, 1145–1181.
153. Chayes, J., Borgs, C. and Smith, A. (2015) Private graphon estimation for sparse graphs. Preprint arXiv:1506.06162.
154. Clauset, A., Shalizi, C. R. and Newman, M. E. J. (2009) Power-law distributions in empirical data. SIAM Rev., 51, 661–703.
155. Crane, H. and Dempsey, W. (2015) A framework for statistical network modeling. Preprint arXiv:1509.08185. Rutgers University, Piscataway.
156. Crane, H. and Dempsey, W. (2016) Edge exchangeable models for network data. Preprint arXiv:1603.04571. Rutgers University, Piscataway.
157. Csárdi, G. and Nepusz, T. (2006) The igraph software package for complex network research. InterJ. Complx Syst., 18, article 1695.
158. Del Genio, C. I., Gross, T. and Bassler, K. E. (2011) All scale-free networks are sparse. Phys. Rev. Lett., 107, article 178701.
159. Dorogovtsev, S. N. and Mendes, J. F. F. (2002) Evolution of networks. Adv. Phys., 51, 10–79.
160. Doshi-Velez, F., Miller, K., Gael, J. V. and Teh, Y. W. (2009) Variational inference for the Indian buffet process. InArtificial Intelligence and Statistics.
161. Durante, D., Dunson, D. B. and Vogelstein, J. T. (2017) Nonparametric Bayes modeling of populations of networks. J. Am. Statist. Ass., to be published, doi 10.1080/01621459.2016.1219260.
162. Dwork, C., McSherry, F., Nissim, K. and Smith, A. (2006) Calibrating noise to sensitivity in private data analysis. InTheory of Cryptography (edsS. Halevi and T. Rabin), pp. 265–284.
163. Eckardt, M. and Mateu, J. (2017a) Analysing highly complex and highly structured point patterns in space. Spatl Statist., to be published.
164. Eckardt, M. and Mateu, J. (2017b) Point patterns occurring on complex structures in space and space-time: an alternative network approach. J. Computnl Graph. Statist., to be published.
165. Eckardt, M. and Mateu, J. (2017c) Analysing multivariate spatial point processes with continuous marks: a graphical modelling approach. Int. Statist. Rev., to be published.
166. Estrada, E. (2010) Quantifying network heterogeneity. Phys. Rev. E, 82, article 066102–8.
167. Estrada, E. and Hatano, N. (2008) Communicability in complex networks. Phys. Rev. E, 77, article 036111–12.
168. Estrada, E. and Hatano, N. (2009) Communicability graph and community structures in complex networks. Appl. Math. Computn, 214, 500–511.
169. Gao, C. and Lafferty, J. (2017) Testing network structure using relations between small subgraph probabilities. Preprint arXiv:1704.06742.
170. Goldenberg, A., Zheng, A. X., Fienberg, S. E. and Airoldi, E. M. (2010) A survey of statistical network models. Foundns Trends Mach. Learn., 2, 129–233.
171. Gormley, I. C. and Murphy, T. B. (2006) Analysis of Irish third-level college applications data. J. R. Statist. Soc. A, 169, 361–379.
172. Granger, C. W., Maasoumi, E. and Racine, J. (2004) A dependence metric for possibly nonlinear processes. J. Time Ser. Anal., 25, 649–669.
173. Griffin, J. E., Kolossiatis, M. and Steel, M. F. J. (2013) Comparing distributions by using dependent normalized random-measure mixtures. J. R. Statist. Soc. B, 75, 499–529.
174. Griffin, J. E. and Leisen, F. (2017) Compound random measures and their use in Bayesian nonparametrics. J. R. Statist. Soc. B, 79, 525–545.
175. Herlau, T., Schmidt, M. and Mørup, M. (2016) Completely random measures for modelling block-structured sparse networks. InAdvances in Neural Information Processing Systems, vol. 29 (edsD. D. Lee, M. Sugiyama, U. Von Luxburg, I. Guyon and R. Garnett), pp. 4260–4268. Red Hook: Curran Associates.
176. Hoff, P. D., Raftery, A. E. and Handcock, M. S. (2002) Latent space approaches to social network analysis. J. Am. Statist. Ass., 97, 1090–1098.
177. Holland, P. W., Laskey, K. B. and Leinhardt, S. (1983) Stochastic blockmodels: first steps. Socl Netwrks, 5, 109–137.
178. Hoover, D. N. (1979) Relations on probability spaces and arrays of random variables. Preprint. Institute for Advanced Study, Princeton.
179. James, L. F. (2002) Poisson process partition calculus with applications to exchangeable models and Bayesian nonparametrics. Preprint arXiv math/0205093. University of Hong Kong, Hong Kong.
180. James, L. F., Lijoi, A. and Prünster, I. (2009) Posterior analysis for normalized random measures with independent increments. Scand. J. Statist., 36, 76–97.
181. Janson, S. (2010) Graphons and cut metric on σ-finite measure spaces. Preprint. Uppsala University, Uppsala. (Available from https://arxiv.org/abs/1608.01833.)
182. Janson, S. (2017a) On edge exchangeable random graphs. Preprint arXiv:1702.06396. Uppsala University, Uppsala.
183. Janson, S. (2017b) On convergence for graphexes. Preprint arXiv:1702.06389. Uppsala University, Uppsala.
184. Kahn, J. (2016) Improper Poisson line process as SIRSN in any dimension. Ann. Probab., 44, 2694–2725.
185. Kallenberg, O. (1990) Exchangeable random measures in the plane. J. Theoret. Probab., 3, 81–136.
186. Kallenberg, O. (2005) Probabilistic Symmetries and Invariance Principles. New York: Springer.
187. Karrer, B. and Newman, M. E. J. (2011) Stochastic blockmodels and community structure in networks. Phys. Rev. E, 83, article 016107.
188. Kendall, W. S. (2017) From random lines to metric spaces. Ann. Probab., 45, 469–517.
189. Kishore, V., Santhanam, M. S. and Amrtikar, R. E. (2011) Extreme events on complex networks. Phys. Rev. Lett., 106, article 188701.
190. Kolaczyk, E. D. (2009) Statistical Analysis of Network Data. New York: Springer.
191. Kolaczyk, E. D. and Csárdi, G. (2014) Statistical Analysis of Network Data with R. New York: Springer.
192. Koster, J. T. (1996) Markov properties of nonrecursive causal models. Ann. Statist., 24, 2148–2177.
193. Lambiotte, R., et al. (2016) Structural transitions in densifying networks. Phys. Rev. Lett., 117, article 218301.
194. Lee, A. and Streinu, I. (2008) Pebble game algorithms and sparse graphs. Discr. Math., 308, 1425–1437.
195. Leisen, F. and Lijoi, A. (2011) Vectors of Poisson-Dirichlet processes. J. Multiv. Anal., 102, 482–495.
196. Lijoi, A., Mena, R. H. and Prünster, I. (2007) Controlling the reinforcement in Bayesian non-parametric mixture models. J. R. Statist. Soc. B, 69, 715–740.
197. Lijoi, A., Mena, R. H. and Prünster, I. (2008) A Bayesian nonparametric approach for comparing clustering structures in EST libraries. J. Computnl Biol., 15, 1315–1327.
198. Marchette, D. (2004) Random Graphs for Statistical Pattern Recognition. Hoboken: Wiley.
199. Muliere, P. and Tardella, L. (1998) Approximating distributions of random functionals of Ferguson–Dirichlet priors. Can. J. Statist., 26, 283–297.
200. Narayanon, A. and Shmatikov, V. (2009) De-anonymizing social networks. In Proc. Symp. Security and Privacy, pp. 173–187. New York: Institute of Electrical and Electronics Engineers.
201. Neal, R. (2011) MCMC using Hamiltonian dynamics. In Handbook of Markov Chain Monte Carlo (eds S. Brooks, A. Gelman, G. Jones and X.-L. Meng), ch 5, pp. 1–51. Boca Raton: Chapman and Hall–CRC.
202. Newman, M. E. J. (2010) Networks: an Introduction. Oxford: Oxford University Press.
203. Ni, Y., Ji, Y. and Müller, P. (2016) Reciprocal graphical models for integrative gene regulatory network analysis. Preprint arXiv:1607.06849.
204. Nickel, C. (2006) Random dot product graphs: a model for social networks. PhD Thesis. Johns Hopkins University, Baltimore.
205. Orbanz, P. (2017) Subsampling and invariance in networks. To be published.
206. Orbanz, P. and Roy, D. M. (2015) Bayesian models of graphs, arrays and other exchangeable random structures. IEEE Trans. Pattn Anal. Mach. Intell., 37, 437–461.
207. Palla, K., Caron, F. and Teh, Y. W. (2016) A Bayesian nonparametric model for sparse dynamic networks. Preprint arXiv:1607.01624.
208. Park, J. and Newman, M. E. J. (2004) Statistical mechanics of networks. Phys. Rev. E, 70, article 066117.
209. Pitman, J. (2003) Poisson-Kingman partitions. InStatistics and Science: a Festschrift for Terry Speed, pp. 1–34. Beachwood: Institute of Mathematical Statistics.
210. R Core Team (2017) R: a Language and Environment for Statistical Computing. Vienna: R Foundation for Statistical Computing.
211. Rodríguez, A., Dunson, D. B. and Gelfand, A. E. (2008) The nested Dirichlet process. J. Am. Statist. Ass., 103, 1131–1444.
212. Seyed-Allaei, H., Bianconi, G. and Marsili, M. (2006) Scale-free networks with an exponent less than two. Phys. Rev. E, 73, no. 4, article 046113.
213. Simpson, S. L., Bowman, F. D. and Laurienti, P. J. (2013) Analyzing complex functional brain networks: fusing statistics and network science to understand the brain. Statist. Surv., 7, 1–36.
214. Song, L., Langfelder, P. and Horvath, S. (2012) Comparison of co-expression measures: mutual information, correlation, and model based indices. BMC Bioinform., 13, article 328.
215. Stan Development Team (2016) Stan Modeling Language Users Guide and Reference Manual, Version 2.15.0. Stan Development Team.
216. Timár, G., Dorogovtsev, S. N. and Mendes, J. F. F. (2016) Scale-free networks with exponent one. Phys. Rev. E, 94, article 022302.
217. Todeschini, A. and Caron, F. (2016) Exchangeable random measures for sparse and modular graphs with overlapping communities. Preprint arXiv:1602.02114. University of Bordeaux, Bordeaux.
218. Ugander, J., Backstrom, L. and Kleinberg, J. (2013) Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In Proc. 22nd Int. Conf. World Wide Web, pp. 1307–1318. New York: Association for Computing Machinery.
219. Varin, C., Cattelan, M. and Firth, D. (2016) Statistical modelling of citation exchange between statistics journals (with discussion). J. R. Statist. Soc. A, 179, 1–63.
220. Veitch, V. and Roy, D. M. (2015) The class of random graphs arising from exchangeable random measures. Preprint arXiv:1512.03099. University of Toronto, Toronto.
221. Veitch, V. and Roy, D. (2016) Sampling and estimation for (sparse) exchangeable graphs. Preprint arXiv:1611.00843. University of Toronto, Toronto.
222. Von Luxburg, U. (2007) A tutorial on spectral clustering. Statist. Comput., 17, 395–416.
223. Watts, D. J. and Strogatz, S. H. (1998) Collective dynamics of small-world networks. Nature, 393, 440.
224. Wijayatunga, P. (2016) A geometric view on Pearson's correlation coefficient and a generalization of it to non-linear dependencies. Rat. Math., 30, 3–21.
225. Williamson, S. A. (2016) Nonparametric network models for link prediction. J. Mach. Learn. Res., 17, 1–21.
226. Wolfe, P. J. and Olhede, S. C. (2013) Nonparametric graphon estimation. Preprint arXiv:1309.5936. University College London, London.
227. Young, S. J. and Scheinerman, E. R. (2007) Random dot product graph models for social networks. In Proc. Int. Wrkshp Algorithms and Models for the Web-graph, pp. 138–149. New York: Springer.
228. Zhou, M. (2015) Infinite edge partition models for overlapping community detection and link prediction. Proc. Mach. Learn. Res., 38, 1135–1143.