EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 20 (2016) ESAIM: PS, 20 (2016) 131-142 References
Free Access
Issue
ESAIM: PS
Volume 20, 2016
Page(s) 131 - 142
DOI https://doi.org/10.1051/ps/2016006
Published online 14 July 2016
  1. E.M. Airoldi, T.B. Costa and S.H. Chan, Stochastic blockmodel approximation of a graphon: Theory and consistent estimation. Adv. Neur. In. 26 (2013) 692–700. [Google Scholar]
  2. D.J. Aldous, Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 (1981) 581–598. [CrossRef] [MathSciNet] [Google Scholar]
  3. W. Ali, T. Rito, G. Reinert, F. Sun and C.M. Deane, Alignment-free protein interaction network comparison. Bioinformatics 30 (2014) i430–i437. [CrossRef] [PubMed] [Google Scholar]
  4. R. Arratia L. Goldstein and L. Gordon, Two Moments Suffice for Poisson Approximations: the Chen-Stein Method. Ann. Probab. 17 (1989) 9–25. [CrossRef] [MathSciNet] [Google Scholar]
  5. A.D. Barbour, L. Holst and S. Janson, Poisson Approximation. Oxford University Press, Oxford (1992). [Google Scholar]
  6. P. Bickel and A. Chen, A non parametric view of network models and Newman-Girvan and other modularities. Proc. Natl. Acad. Sci. USA 106 (2009) 21068–21073. [CrossRef] [Google Scholar]
  7. B. Bollobas, S. Janson and O. Riordan, The phase transition in inhomogeneous random graphs. Random Struct. Algor. 31 (2007) 3–122. [CrossRef] [Google Scholar]
  8. L.H.Y. Chen, Poisson approximation for dependent trials. Ann. Probab. 3 (1975) 534–545. [CrossRef] [Google Scholar]
  9. A. Condon and R.M. Karp, Algorithms for graph partitioning on the planted partition model. In Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin Heidelberg (1999) 221-232. [Google Scholar]
  10. J.J. Daudin, F. Picard and S. Robin, A mixture model for random graphs. Stat. Comput. 18 (2008) 173–183. [CrossRef] [MathSciNet] [Google Scholar]
  11. P. Diaconis and S. Janson, Graph limits and exchangeable random graphs. Rendiconti di Matematica 28 (2008) 33–61. [Google Scholar]
  12. O. Frank and D. Strauss, Markov graphs. J. Am. Stat. Assoc. 81 (1986) 832-842. [CrossRef] [Google Scholar]
  13. P.W. Holland, K.B. Laskey and S. Leinhardt, Stochastic blockmodels: First steps. Soc. Networks 5 (1983) 109–137. [Google Scholar]
  14. B. Karrer, and M.E. Newman, Stochastic blockmodels and community structure in networks. Phys. Rev. E 83 (2011), 016107. [CrossRef] [MathSciNet] [Google Scholar]
  15. P. Latouche and S. Robin, Bayesian Model Averaging of Stochastic Block Models to Estimate the Graphon Function and Motif Frequencies in a W-graph Model. Preprint arXiv:1310.6150 (2013). [Google Scholar]
  16. L. Lovász and B. Szegedy, Limits of dense graph sequences. J. Comb. Theory B 96 (2006) 933–957. [Google Scholar]
  17. C. Matias and S. Robin, Modeling heterogeneity in random graphs through latent space models: a selective review. ESAIM: Proc. Surv. 47 (2014) 55–74. [CrossRef] [EDP Sciences] [Google Scholar]
  18. A. McNeil and J. Neslehová, Multivariate Archimedean Copulas, d-monotone functions and L1-norm symmetric distributions. Ann. Stat. 37 (2007) 3059–3097. [Google Scholar]
  19. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii and U. Alon, Network motifs: simple building blocks of complex networks. Science 298 (2002) 824-827. [CrossRef] [PubMed] [Google Scholar]
  20. K. Nowicki and T. Snijders Estimation and prediction for stochastic blockstructures. J. Am. Stat. Assoc. 96 (2001) 1077–1087. [CrossRef] [Google Scholar]
  21. S.C. Olhede and P.J. Wolfe, Network histograms and universality of blockmodel approximation. P. Natl. Acad. Sci. USA 111 (2014) 14722–14727. [CrossRef] [Google Scholar]
  22. F. Picard, J.J. Daudin, M. Koskas, S. Schbath and S. Robin, Assessing the exceptionality of network motifs. J. Comput. Biol. 15 (2008) 1–20. [CrossRef] [MathSciNet] [PubMed] [Google Scholar]
  23. R.J. Ruciński and A. Vince, Balanced graphs and the problem of subgraphs of random graphs. Congr. Numerantium 49 (1985) 181–190. [Google Scholar]
  24. A. Sarajlić, V. Janjić, N. Stojković, D. Radak and N. Pržulj, Network topology reveals key cardiovascular disease genes. PLoS One 8 (2013) e71537. [CrossRef] [PubMed] [Google Scholar]
  25. D. Stark, Compound Poisson approximation of subgraph counts in random graphs. Random Struct. Algor. 18 (2001) 39–60. [CrossRef] [Google Scholar]
  26. P.J. Wolfe and S.C. Olhede, Nonparametric graphon estimation. Preprint arXiv:1309.5936 (2013). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.