Assortativity and clustering of sparse random intersection graphs
Authors:
- Mindaugas Bloznelis,
- Jerzy Jaworski,
- Valentas Kurauskas
Abstract
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the expected number of common neighbours of adjacent nodes, and the expected degree of a neighbour of a node of a given degree k. These expressions are written in terms of the asymptotic degree distribution and, alternatively, in terms of the parameters defining the underlying random graph model.
- Record ID
- UAMe10ea20c733148c78486f6cfb21711e3
- Author
- Journal series
- Electronic Journal of Probability, ISSN 1083-6489
- Issue year
- 2013
- Vol
- 18
- ASJC Classification
- ;
- DOI
- DOI:10.1214/EJP.v18-227 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 25
- Score source
- journalList
- Score
- Publication indicators
- = 19; = 18; : 2013 = 1.159; : 2013 (2 years) = 0.774 - 2013 (5 years) =0.970
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAMe10ea20c733148c78486f6cfb21711e3/
- URN
urn:amu-prod:UAMe10ea20c733148c78486f6cfb21711e3
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.