Clustering Coefficients of Random Intersection Graphs

DOI10.1007/978-3-642-24466-7_25MaRDI QIDQ3225062zbMATH OpenOpenAlexFDO

Authors Erhard A. J. Godehardt, Jerzy Jaworski, Katarzyna Rybarczyk

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

biological networksclustering coefficientinternet networksnon-metric data analysisrandom intersection graph modelsrandom intersection graphsreal life network analysissocial networks

Mathematics Subject Classification ID

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

Recommendations

• Degree and clustering coefficient in sparse random intersection graphs
• Assortativity and clustering of sparse random intersection graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• A note on the component structure in random intersection graphs with tunable clustering
• Computing the clustering coefficient of a random model of graphs
• The largest component in an inhomogeneous random intersection graph with clustering
• The clustering coefficient of a scale-free random graph
• The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs

Cited in

(11)

• Joint probability generating function for degrees of active/passive random intersection graphs
• Interfaces for random cluster models
• Degree and clustering coefficient in sparse random intersection graphs
• Assortativity and clustering of sparse random intersection graphs
• Clustering function: another view on clustering coefficient
• Poisson approximation of the number of cliques in random intersection graphs
• Clustering in preferential attachment random graphs with edge-step
• Clustering coefficient of a preferred attachment affiliation network
• Computing the clustering coefficient of a random model of graphs
• On local weak limit and subgraph counts for sparse random graphs
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities

This page was built for publication: Clustering Coefficients of Random Intersection Graphs

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