Clustering Coefficients of Random Intersection Graphs
From MaRDI portal
Publication:3225062
DOI10.1007/978-3-642-24466-7_25zbMath1233.05184MaRDI QIDQ3225062
Erhard A. J. Godehardt, Katarzyna Rybarczyk, Jerzy Jaworski
Publication date: 15 March 2012
Published in: Challenges at the Interface of Data Analysis, Computer Science, and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24466-7_25
social networks; clustering coefficient; biological networks; random intersection graphs; random intersection graph models; internet networks; non-metric data analysis; real life network analysis
05C90: Applications of graph theory
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C80: Random graphs (graph-theoretic aspects)
Related Items
Poisson Approximation of the Number of Cliques in Random Intersection Graphs, Clustering Coefficient of a Preferred Attachment Affiliation Network, On local weak limit and subgraph counts for sparse random graphs, Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities, Degree and clustering coefficient in sparse random intersection graphs, Random Intersection Graph Process