Uniform preferential selection model for generating scale-free networks

DOI10.1007/S11009-021-09854-WzbMath1487.05246OpenAlexW3158231518MaRDI QIDQ2671240

Muhammad Abid, Muhammad Irfan Yousuf, Raheel Anwar

Publication date: 3 June 2022

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-021-09854-w

zbMATH Keywords

mathematical analysisscale-free networkspower-law degree distributiongraph generation

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• SNAP
• KONECT

Cites Work

• Unnamed Item
• Random graphs associated to some discrete and continuous time preferential attachment models
• Generalized nonlinear Yule models
• A preferential attachment model with random initial degrees
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• On a preferential attachment and generalized Pólya's urn model
• On nodes of small degrees and degree profile in preferential dynamic attachment circuits
• From the Cover: The structure of scientific collaboration networks
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Emergence of Scaling in Random Networks
• The role of detachment of in-links in scale-free networks
• A general model of web graphs
• Asymptotic normality of in- and out-degree counts in a preferential attachment model
• Exploring complex networks
• Random trees and general branching processes
• Automata, Languages and Programming

This page was built for publication: Uniform preferential selection model for generating scale-free networks