The shortest distance in random multi-type intersection graphs
From MaRDI portal
Publication:3094603
DOI10.1002/rsa.20351zbMath1231.05081arXiv1001.5357OpenAlexW2096771260MaRDI QIDQ3094603
Andrew David Barbour, Gesine D. Reinert
Publication date: 25 October 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.5357
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)
Related Items (5)
Central limit theorem for the largest component of random intersection graph ⋮ Degree distribution of an inhomogeneous random intersection graph ⋮ The number of triangles in random intersection graphs ⋮ Degree and clustering coefficient in sparse random intersection graphs ⋮ The coupling method for inhomogeneous random intersection graphs.
Cites Work
- General branching processes conditioned on extinction are still branching processes
- Small worlds among interlocking directors: network structure and distance in bipartite graphs
- Discrete small world networks
- Epidemics on Random Graphs with Tunable Clustering
- An Intermediate Course in Probability
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Matrix Analysis
- Collapsing supercritical branching processes
- On Random Intersection Graphs: The Subgraph Problem
- Estimation and Prediction for Stochastic Blockstructures
- The phase transition in inhomogeneous random graphs
This page was built for publication: The shortest distance in random multi-type intersection graphs