Skip to main content Accessibility help
×
×
Home

Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges

  • Matthew Coulson (a1), Robert E. Gaunt (a2) and Gesine Reinert (a3)

Abstract

We use the Stein‒Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical stochastic block model to allow for the possibility of multiple edges between vertices. We treat the case that the fixed graph is a simple graph and that it has multiple edges. The former results apply when the fixed graph is a member of the class of strictly balanced graphs and the latter results apply to a suitable generalisation of this class to graphs with multiple edges. We also consider a further generalisation of the model to pseudo-graphs, which may include self-loops as well as multiple edges, and establish a parameter regime in the multiple edge stochastic block model in which Poisson approximations are valid. The results are applied to obtain Poisson and compound Poisson approximations (in different regimes) for subgraph counts in the Poisson stochastic block model and degree corrected stochastic block model of Karrer and Newman (2011).

Copyright

Corresponding author

* Postal address: School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK
** Postal address: School of Mathematics, The University of Manchester, Manchester M13 9PL, UK. Email address: robert.gaunt@manchester.ac.uk
*** Postal address: Department of Statistics, University of Oxford, 24‒29 St Giles', Oxford OX1 3LB, UK

References

Hide All
[1]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 26.
[2]Arratia, R., Goldstein, L. and Gordon, L. (1989). Two moments suffice for Poisson approximations: the Chen–Stein method. Ann. Prob. 17, 925.
[3]Barbour, A. D. (1982). Poisson convergence and random graphs. Math. Proc. Camb. Philos. Soc. 92, 349359.
[4]Barbour, A. D. and Chryssaphinou, O. (2001). Compound Poisson approximation: a user's guide. Ann. Appl. Prob. 11, 9641002.
[5]Barbour, A. D. and Eagleson, G. K. (1983). Poisson approximation for some statistics based on exchangeable trials. Adv. Appl. Prob. 15, 585600.
[6]Barbour, A. D. and Röllin, A. (2017). Central limit theorems in the configuration model. Preprint. Available at https://arxiv.org/abs/1710.02644.
[7]Barbour, A. D. and Utev, S. (1998). Solving the Stein equation in compound Poisson approximation. Adv. Appl. Prob. 30, 449475.
[8]Barbour, A. D. and Xia, A. (2000). Estimating Stein's constants for compound Poisson approximation. Bernoulli 6, 581590.
[9]Barbour, A. D., Chen, L. H. Y. and Loh, W.-L. (1992). Compound Poisson approximation for nonnegative random variables via Stein's method. Ann. Prob. 20, 18431866.
[10]Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation. Oxford University Press.
[11]Chen, L. H. Y. (1975). Poisson approximation for dependent trials. Ann. Prob. 3, 534545.
[12]Condon, A. and Karp, R. M. (1999). Algorithms for graph partitioning on the planted partition model. In Randomization, Approximation, and Combinatorial Optimization, Springer, Berlin, pp. 221232.
[13]Coulson, M., Gaunt, R. E. and Reinert, G. (2016). Poisson approximation of subgraph counts in stochastic block models and a graphon model. ESAIM Prob. Statist. 20, 131142.
[14]Daly, F. (2017). On magic factors in Stein's method for compound Poisson approximation. Electron. Commun. Prob. 22, 67.
[15]Daudin, J.-J., Picard, F. and Robin, S. (2008). A mixture model for random graphs. Statist. Comput. 18, 173183.
[16]Frank, O. and Strauss, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81, 832842.
[17]Girvan, M. and Newman, M. E. (2002). Community structure in social and biological networks. Proc. Nat. Acad. Sci. USA 99, 78217826.
[18]Holland, P. W., Laskey, K. B. and Leinhardt, S. (1983). Stochastic blockmodels: first steps. Social Networks 5, 109137.
[19]Karrer, B. and Newman, M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E(3) 83, 016107.
[20]Latouche, P. and Robin, S. (2016). Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models. Statist. Comput. 26, 11731185.
[21]Matias, C. and Robin, S. (2014). Modeling heterogeneity in random graphs through latent space models: a selective review. In MMCS, Mathematical Modelling of Complex Systems, EDP Sciences, Les Ulis, pp. 5574.
[22]Milo, R. et al. (2002). Network motifs: simple building blocks of complex networks. Science 298, 824827.
[23]Molloy, M. and Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6, 161179.
[24]Nowicki, K. and Snijders, T. A. B. (2001). Estimation and prediction for stochastic blockstructures. J. Amer. Statist. Assoc. 96, 10771087.
[25]Olhede, S. C. and Wolfe, P. J. (2014). Network histograms and universality of blockmodel approximation. Proc. Nat. Acad. Sci. USA 111, 1472214727.
[26]Picard, F. et al. (2008). Assessing the exceptionality of network motifs. J. Comput. Biol. 15, 120.
[27]Roos, M. (1993). Stein–Chen method for compound Poisson approximation. Doctoral thesis. University of Zürich.
[28]Roos, M. (1994). Stein's method for compound Poisson approximation: the local approach. Ann. Appl. Prob. 4, 11771187.
[29]Sarajlić, A. et al. (2013). Network topology reveals key cardiovascular disease genes. PLoS ONE 8, e71537.
[30]Stark, D. (2001). Compound Poisson approximation of subgraph counts in random graphs. Random Structures Algorithms 18, 3960.
[31]Stein, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Proc. Sixth Berkeley Symp. Math. Statist. Prob., Vol. 2, University of California Press, Berkeley, pp. 583602.
[32]Wegner, A. E. et al. (2018). Identifying networks with common organizational principles. To appear in J. Complex Networks. Available at https://doi.org/10.1093/comnet/cny003.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Advances in Applied Probability
  • ISSN: 0001-8678
  • EISSN: 1475-6064
  • URL: /core/journals/advances-in-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed