Small subgraphs in preferential attachment networks

DOI10.1007/s11590-015-0945-9zbMath1369.90029OpenAlexW1643268875MaRDI QIDQ526405

Andrei M. Raigorodskii

Publication date: 12 May 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0945-9

zbMATH Keywords

random graphspreferential attachmentsmall subgraphsclustering coefficients

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items

On the independence number and the chromatic number of generalized preferential attachment models ⋮ Clustering coefficient of a spatial preferential attachment model

Cites Work

• Unnamed Item
• An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model
• The clustering coefficient of a scale-free random graph
• A preferential attachment model with random initial degrees
• Popularity based random graph models leading to a scale-free degree sequence
• Complex networks: structure and dynamics
• The degree sequence of a scale-free random graph process
• On the number of subgraphs of the Barabási-Albert random graph
• Global Clustering Coefficient in Scale-Free Networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• Degree Distribution and Number of Edges between Nodes of Given Degrees in the Buckley–Osthus Model of a Random Web Graph
• Distribution of small subgraphs in Buckley-Osthus random graphs
• Collective dynamics of ‘small-world’ networks
• Local Clustering Coefficient in Generalized Preferential Attachment Models