Local clustering coefficient in generalized preferential attachment models

DOI10.1007/978-3-319-26784-5_2zbMATH Open1491.05170arXiv1507.07771OpenAlexW3031432909MaRDI QIDQ5896885FDOQ5896885

Authors: Alexander M. Krot, Liudmila Ostroumova Prokhorenkova 

Publication date: 23 March 2022

Published in: Lecture Notes in Computer Science, Internet Mathematics (Search for Journal in Brave)

Abstract: In this paper, we analyze the local clustering coefficient of preferential attachment models. A general approach to preferential attachment was introduced in earlier, where a wide class of models (PA-class) was defined in terms of constraints that are sufficient for the study of the degree distribution and the clustering coefficient. It was previously shown that the degree distribution in all models of the PA-class follows a power law. Also, the global clustering coefficient was analyzed and a lower bound for the average local clustering coefficient was obtained. We expand the results by analyzing the local clustering coefficient for the PA-class of models. Namely, we analyze the behavior of C(d) which is the average local clustering for the vertices of degree d.

Full work available at URL: https://arxiv.org/abs/1507.07771

Recommendations

• Local clustering coefficient in generalized preferential attachment models
• Local clustering coefficients in preferential attachment models
• Assortativity in generalized preferential attachment models
• Assortativity in generalized preferential attachment models
• Local clustering coefficient of spatial preferential attachment model

zbMATH Keywords

networksrandom graph modelsclustering coefficientpreferential attachment

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Network design and communication in computer systems (68M10) Internet topics (68M11)

Cites Work

• Statistical mechanics of complex networks
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Collective dynamics of `small-world' networks
• The degree sequence of a scale-free random graph process
• Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Hierarchical organization of modularity in complex networks
• Popularity based random graph models leading to a scale-free degree sequence

Cited In (20)

• Clustering coefficient of a spatial preferential attachment model
• Clustering coefficient of a preferred attachment affiliation network
• Scaling of the clustering function in spatial inhomogeneous random graphs
• Triadic closure in configuration models with unbounded degree fluctuations
• Local clustering coefficient in generalized preferential attachment models
• Local clustering coefficient of spatial preferential attachment model
• Degree-degree correlation in networks with preferential attachment based growth
• Global clustering coefficient in scale-free weighted and unweighted networks
• Assortativity in generalized preferential attachment models
• New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
• On the independence number and the chromatic number of generalized preferential attachment models
• Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient
• Estimating the clustering coefficient using sample complexity analysis
• Clustering Properties of Spatial Preferential Attachment Model
• Classes of preferential attachment and triangle preferential attachment models with power-law spectra
• Clustering and percolation on superpositions of Bernoulli random graphs
• Local clustering coefficients in preferential attachment models
• Computing the clustering coefficient of a random model of graphs
• General results on preferential attachment and clustering coefficient
• Small subgraphs in preferential attachment networks

Uses Software

• SNAP

This page was built for publication: Local clustering coefficient in generalized preferential attachment models

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