Assortativity and clustering of sparse random intersection graphs

DOI10.1214/EJP.v18-2277zbMath1278.05223arXiv1209.4675MaRDI QIDQ388897

Valentas Kurauskas, Jerzy Jaworski, Mindaugas Bloznelis

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

clusteringrandom graphpower lawassortativityrandom intersection graph

Mathematics Subject Classification ID

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

Related Items

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions ⋮ Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Scale-free network clustering in hyperbolic and other random graphs ⋮ Random Intersection Graph Process ⋮ Large cliques in sparse random intersection graphs ⋮ Degree-degree distribution in a power law random intersection graph with clustering ⋮ Construction of Directed Assortative Configuration Graphs ⋮ Random intersection graphs with communities ⋮ On local weak limit and subgraph counts for sparse random graphs