Clustering coefficient of random intersection graphs with infinite degree variance

DOI10.24166/IM.02.2017MaRDI QIDQ6912956zbMATH OpenFDO

Authors Mindaugas Bloznelis, Valentas Kurauskas

Publication date 21 October 2025

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.24166/IM.02.2017

zbMATH Keywords

affiliation networkclustering coefficientinfinite variancepower lawrandom intersection graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30)

Cited in

(1)

• Connectivity threshold for superpositions of Bernoulli random graphs

This page was built for publication: Clustering coefficient of random intersection graphs with infinite degree variance

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