Assortativity and clustering of sparse random intersection graphs

DOI10.1214/EJP.V18-2277MaRDI QIDQ388897zbMATH OpenFDO

Authors Mindaugas Bloznelis, Jerzy Jaworski, Valentas Kurauskas

Publication date 17 January 2014

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.4675

zbMATH Keywords

assortativityclusteringpower lawrandom graphrandom intersection graph

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Social networks; opinion dynamics (91D30)

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.

Recommendations

• Degree and clustering coefficient in sparse random intersection graphs
• Clustering Coefficients of Random Intersection Graphs

Cited in

(14)

• Degree and clustering coefficient in sparse random intersection graphs
• Clustering Coefficients of Random Intersection Graphs
• Construction of directed assortative configuration graphs
• Clustering function: another view on clustering coefficient
• Random intersection graphs with communities
• Clustering in preferential attachment random graphs with edge-step
• Core-satellite graphs: clustering, assortativity and spectral properties
• Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
• Correlation between clustering and degree in affiliation networks
• Assortativity and bidegree distributions on Bernoulli random graph superpositions
• Scale-free network clustering in hyperbolic and other random graphs
• Large cliques in sparse random intersection graphs
• On local weak limit and subgraph counts for sparse random graphs
• Dynamic random intersection graph: dynamic local convergence and giant structure

This page was built for publication: Assortativity and clustering of sparse random intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388897)