首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The shortest distance in random multi‐type intersection graphs
Authors:AD Barbour  G Reinert
Institution:1. Angewandte Mathematik, Universit?t Zürich, Zürich, CH‐8057, Switzerland;2. Department of Statistics, University of Oxford, Oxford OX1 3TG, UK
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. Random Struct. Alg., 39, 179–209, 2011
Keywords:intersection graph  shortest path  branching process approximation  Poisson approximation
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号