The shortest distance in random multi-type intersection graphs
Probability
2010-02-01 v1 Statistics Theory
Statistics Theory
Abstract
Using an associated branching process as the basis of our approximation, we show that typical inter-point distances in a multitype 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.
Cite
@article{arxiv.1001.5357,
title = {The shortest distance in random multi-type intersection graphs},
author = {A. D. Barbour and G. Reinert},
journal= {arXiv preprint arXiv:1001.5357},
year = {2010}
}
Comments
32 pages