The shortest distance in random multi-type intersection graphs

Random Structures and Algorithms

Volumn 39, Issue 2, 2011, Pages 179-209

  Barbour, A D ^a   Reinert, G ^b  

^a UNIVERSITY OF ZURICH   (Switzerland)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Branching process approximation; Intersection graph; Poisson approximation; Shortest path

Indexed keywords

EID: 79960488007     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20351     Document Type: Article

References (20)

1. A. D. Barbour, Macdonald's model and the transmission of bilharzia, Trans R Soc Trop Med Hyg 72 (1978), 6-15.
2. A. D. Barbour, L. Holst, S. Janson, Poisson approximation, Oxford University Press, Oxford, UK, 1992 (Math Rev 1163825).
3. A. D. Barbour, G. Reinert, Discrete small world networks, Electronic J Probab 11 (2006), 1234-1283 (Math Rev 2268544).
4. B. Bollobás, S. Janson, O. Riordan, The phase transition in inhomogeneous random graphs, Random Struct Algorithms 31 (2007), 3-122 (Math Rev 2337396).
5. T. Britton, M. Deijfen, A. Lageras, M. Lindholm, Epidemics on random graphs with tunable clustering, J Appl Probab 45 (2008), 743-756 (Math Rev 2455182).
6. F. Daly, Collapsing supercritical branching processes, J Appl Probab 16 (1979), 732-739 (Math Rev 0549553).
7. J.-J. Daudin, F. Picard, S. Robin, A mixture model for random graphs, Stat Comput 18 (2008), 173-183 (Math Rev 2390817).
8. M. Deijfen, W. Kets, Random intersection graphs with tunable degree distribution and clustering, Probab Eng Inform Sci 23 (2009), 661-674 (Math Rev 2535025).
9. A. Gut, An intermediate course in probability, 2nd edition, Springer-Verlag, New York, 2009 (Math Rev 2528081).
10. T. E. Harris, The theory of branching processes, Dover, New York, 1989 (Math Rev 1991122).
11. R. A. Horn, C. R. Johnson, Matrix analysis, Cambridge University Press, Cambridge, UK, 1985 (Math Rev 0832183).
12. P. Jagers, A. N. Lageras, General branching processes conditioned on extinction are still branching processes, Electron Commun Probab 13 (2008), 540-547 (Math Rev 2453547).
13. M. Karoński, E. R. Scheinerman, K. B. Singer-Cohen, On random intersection graphs: The subgraph problem, Combin Probab Comp 8 (1999), 131-159.
14. C. Mode, Multitype branching processes:theory and applications, Elsevier, New York, 1971 (Math Rev 0279901).
15. K. Nowicki, T. Snijders, Estimation and prediction for stochastic blockstructures, J Am Stat Assoc 96 (2001), 1077-1087 (Math Rev 1947255).
16. G. Rasch, On general laws and the meaning ofmeasurement in psychology, In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, IV, Berkeley, 1961, pp. 321-333.
17. G. Robins, M. Alexander, Small worlds among interlocking directors: Network structure and distance in bipartite graphs, Comput Math Organ Theory 10 (2004), 69-94.
18. *) models for social networks, Stat Comput 18 (2008), 173-183.
19. A. Tanay, R. Sharan, R. Shamir, Discovering statistically significant biclusters in gene expression data, Bioinformatics 18(Suppl 1) (2002), S136-S144.
20. *) models for affiliation networks, Soc Networks 31 (2009), 12-25.