Clustering function: a measure of social influence
From MaRDI portal
Publication:6234529
arXiv1207.4941MaRDI QIDQ6234529FDOQ6234529
Authors: Mindaugas Bloznelis, Valentas Kurauskas 
Publication date: 20 July 2012
Abstract: A commonly used characteristic of statistical dependence of adjacency relations in real networks, the clustering coefficient, evaluates chances that two neighbours of a given vertex are adjacent. An extension is obtained by considering conditional probabilities that two randomly chosen vertices are adjacent given that they have r common neighbours. We denote such probabilities cl(r) and call r-> cl(r) the clustering function. We compare clustering functions of several networks having non-negligible clustering coefficient. They show similar patterns and surprising regularity. We establish a first order asymptotic (as the number of vertices tends to infinity) of the clustering function of related random intersection graph models admitting nonvanishing clustering coefficient and asymptotic degree distribution having a finite second moment.
Random graphs (graph-theoretic aspects) (05C80) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Vertex degrees (05C07)
This page was built for publication: Clustering function: a measure of social influence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234529)
