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: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2010
|
| _version_ | 1826299847888601088 |
|---|---|
| author | Barbour, A Reinert, G |
| author_facet | Barbour, A Reinert, G |
| author_sort | Barbour, A |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-07T05:08:12Z |
| format | Journal article |
| id | oxford-uuid:daa6f523-bfdc-4a2d-8589-95545614c5ee |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T05:08:12Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | oxford-uuid:daa6f523-bfdc-4a2d-8589-95545614c5ee2022-03-27T09:04:41ZThe shortest distance in random multi-type intersection graphsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:daa6f523-bfdc-4a2d-8589-95545614c5eeEnglishSymplectic Elements at Oxford2010Barbour, AReinert, GUsing 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. |
| spellingShingle | Barbour, A Reinert, G The shortest distance in random multi-type intersection graphs |
| title | The shortest distance in random multi-type intersection graphs |
| title_full | The shortest distance in random multi-type intersection graphs |
| title_fullStr | The shortest distance in random multi-type intersection graphs |
| title_full_unstemmed | The shortest distance in random multi-type intersection graphs |
| title_short | The shortest distance in random multi-type intersection graphs |
| title_sort | shortest distance in random multi type intersection graphs |
| work_keys_str_mv | AT barboura theshortestdistanceinrandommultitypeintersectiongraphs AT reinertg theshortestdistanceinrandommultitypeintersectiongraphs AT barboura shortestdistanceinrandommultitypeintersectiongraphs AT reinertg shortestdistanceinrandommultitypeintersectiongraphs |