A new class of scale free random graphs

DOI10.1016/j.spl.2006.04.017zbMath1100.05092OpenAlexW2023650984MaRDI QIDQ2507701

Zsolt Katona, Tamás F. Móri

Publication date: 5 October 2006

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2006.04.017

zbMATH Keywords

scale-free distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (9)

A preferential attachment model with random initial degrees ⋮ Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model ⋮ Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ On a 2-parameter class of scale free random graphs ⋮ Branching structure and maximum degree of an evolving random tree ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph ⋮ Large deviations for the leaves in some random trees ⋮ Asymptotic degree distribution in preferential attachment graph models with multiple type edges ⋮ Connectedness strength of two vertices in an uncertain graph

Cites Work

• Unnamed Item
• An approximation theorem for the Poisson binomial distribution
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• The Maximum Degree of the Barabási–Albert Random Tree
• A general model of web graphs

This page was built for publication: A new class of scale free random graphs