Assortativity in generalized preferential attachment models

DOI10.1007/978-3-319-49787-7_2zbMath1398.68404arXiv1610.02819OpenAlexW2531744809MaRDI QIDQ1989493

A. M. Krot, Liudmila Ostroumova Prokhorenkova

Publication date: 26 October 2018

Published in: Internet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

networksrandom graphspreferential attachmentassortativityaverage neighbor degree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions, Assortativity and bidegree distributions on Bernoulli random graph superpositions, On the independence number and the chromatic number of generalized preferential attachment models

Uses Software

• SNAP

Cites Work

• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• 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
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
• Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees
• Collective dynamics of ‘small-world’ networks
• Local Clustering Coefficient in Generalized Preferential Attachment Models