The shortest distance in random multi‐type intersection graphs

Using an associated branching process as the basis of our approximation, we show that typical inter-point distances in a multi-type random intersection graph have a defective distribution, which is well described by a mixture of translated and scaled Gumbel distributions, the missing mass corresponding to the event that the vertices are not in the same component of the graph. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 179–209, 2011 (Supported by Schweizer Nationalfonds Projekt (No. 20-117625/1); Institut Mittag–Leffler, Djursholm, Sweden; EPSRC and BBSRC through OCISB.)

[1]  A D Barbour,et al.  Macdonald's model and the transmission of bilharzia. , 1978, Transactions of the Royal Society of Tropical Medicine and Hygiene.

[2]  Peng Wang,et al.  Recent developments in exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[3]  Franck Picard,et al.  A mixture model for random graphs , 2008, Stat. Comput..

[4]  G. K. Eagleson,et al.  Poisson approximation for some statistics based on exchangeable trials , 1983, Advances in Applied Probability.

[5]  B. Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007 .

[6]  Willemien Kets,et al.  RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING , 2009, Probability in the Engineering and Informational Sciences.

[7]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[8]  Gesine Reinert,et al.  On the Length of the Longest Exact Position Match in a Random Sequence , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[9]  Garry Robins,et al.  Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs , 2004, Comput. Math. Organ. Theory.

[10]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[11]  H. Kesten,et al.  Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes , 1966 .

[12]  Roded Sharan,et al.  Discovering statistically significant biclusters in gene expression data , 2002, ISMB.

[13]  Allan Gut,et al.  An intermediate course in probability , 1995 .

[14]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockstructures , 2001 .

[15]  Edward R. Scheinerman,et al.  On Random Intersection Graphs: The Subgraph Problem , 1999, Combinatorics, Probability and Computing.

[16]  Andreas N. Lagerås,et al.  Epidemics on Random Graphs with Tunable Clustering , 2007, Journal of Applied Probability.

[17]  G. Rasch.  On General Laws and the Meaning of Measurement in Psychology , 1961 .

[18]  Russell Lyons,et al.  A Conceptual Proof of the Kesten-Stigum Theorem for Multi-Type Branching Processes , 1997 .

[19]  A. D. Barbour,et al.  Discrete small world networks , 2003, cond-mat/0304020.

[20]  A. Barbour,et al.  Poisson Approximation , 1992 .

[21]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[22]  F. Daly.  Collapsing supercritical branching processes , 1979, Journal of Applied Probability.

[23]  Charles J. Mode,et al.  Multitype branching processes;: Theory and applications , 1971 .

[24]  K. Sharpe,et al.  Exponential Random Graph (p ) Models , 2006 .