Navigation auf zora.uzh.ch
Barbour, A D; Reinert, G (2011). The shortest distance in random multi-type intersection graphs. Random Structures & Algorithms, 39(2):179-209.
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.
| Item Type: | Journal Article, refereed, original work |
|---|---|
| Communities & Collections: | 07 Faculty of Science > Institute of Mathematics |
| Dewey Decimal Classification: | 510 Mathematics |
| Scopus Subject Areas: | Physical Sciences > Software
Physical Sciences > General Mathematics Physical Sciences > Computer Graphics and Computer-Aided Design Physical Sciences > Applied Mathematics |
| Uncontrolled Keywords: | Software, Applied Mathematics, General Mathematics, Computer Graphics and Computer-Aided Design |
| Language: | English |
| Date: | 2011 |
| Deposited On: | 17 Feb 2012 18:49 |
| Last Modified: | 07 Jan 2025 02:38 |
| Publisher: | Wiley |
| ISSN: | 1042-9832 |
| OA Status: | Green |
| Publisher DOI: | https://doi.org/10.1002/rsa.20351 |
| Related URLs: | http://arxiv.org/abs/1001.5357 |
Barbour, A D