Quick Search:

is currently disabled due to reindexing of the ZORA database. Please use Advanced Search.
uzh logo
Browse by:
bullet
bullet
bullet
bullet

Zurich Open Repository and Archive 

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-58144

Barbour, A D; Reinert, G (2011). The shortest distance in random multi-type intersection graphs. Random Structures & Algorithms, 39(2):179-209.

[img]Published Version (English)
PDF - Registered users only
329kB
[img]
Preview
Accepted Version
PDF
324kB

Abstract

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
DDC:510 Mathematics
Language:English
Date:2011
Deposited On:17 Feb 2012 18:49
Last Modified:02 Jun 2014 16:02
Publisher:Wiley
ISSN:1042-9832
Publisher DOI:10.1002/rsa.20351
Related URLs:http://arxiv.org/abs/1001.5357
Citations:Web of Science®. Times Cited: 4
Google Scholar™
Scopus®. Citation Count: 4

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page