Branching structure and maximum degree of an evolving random tree

DOI10.1007/S11232-011-0021-2MaRDI QIDQ378522zbMATHOpenAlexFDO

Authors Zhimin Li

Publication date 12 November 2013

Published in Theoretical and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11232-011-0021-2

zbMATH Keywords

degree sequencemaximum degreebranch structureevoving random treepreferential attachment modelrandom recursive treerobustness under random attackscale-free graphtree evolutionuniform modelvulnerability to targeted attackWorld Wide Web

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07)

Recommendations

• An evolving random network and its asymptotic structure
• The asymptotic degree distribution of a kind of evolving random tree
• The power of choice combined with preferential attachement
• On random trees
• Scale-free property for degrees and weights in a preferential attachment random graph model

Cites work

• scientific article; zbMATH DE number 1950482 (Why is no real title available?)
• A new class of scale free random graphs
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• The degree sequence of a scale-free random graph process

Cited in

(4)

• Investigating several fundamental properties of random lobster trees and random spider trees
• An evolving random network and its asymptotic structure
• The asymptotic degree distribution of a kind of evolving random tree
• Degree distributions in recursive trees with fitnesses

This page was built for publication: Branching structure and maximum degree of an evolving random tree

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