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 multitype random intersection graph have a defective distribution, which is well described by a mixture of translated and scaled Gumbel distributions, the missing mass correspondi...
Main Authors: | Barbour, A, Reinert, G |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2010
|
Similar Items
-
Successive shortest paths in complete graphs with random edge weights
by: Gerke, S, et al.
Published: (2020) -
Stochastic and dynamic shortest distance problems
by: Polychronopoulos, George H. (George Harry)
Published: (2005) -
Intersections of Graphs
by: Bollobas, B, et al.
Published: (2011) -
Random intersection graphs with tunable degree distribution and clustering
by: Deijfen, M, et al.
Published: (2009) -
From random walks to distances on unweighted graphs
by: Hashimoto, Tatsunori Benjamin, et al.
Published: (2018)