Clustering Coefficients of Random Intersection Graphs

DOI10.1007/978-3-642-24466-7_25zbMath1233.05184OpenAlexW89701922MaRDI 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

zbMATH Keywords

social networksclustering coefficientbiological networksrandom intersection graphsrandom intersection graph modelsinternet networksnon-metric data analysisreal life network analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities, Clustering Coefficient of a Preferred Attachment Affiliation Network, Random Intersection Graph Process, Degree and clustering coefficient in sparse random intersection graphs, Poisson Approximation of the Number of Cliques in Random Intersection Graphs, On local weak limit and subgraph counts for sparse random graphs