Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment

DOI10.1016/j.aam.2019.07.006zbMath1426.05157OpenAlexW2969277637WikidataQ127334059 ScholiaQ127334059MaRDI QIDQ2334518

Hosam M. Mahmoud

Publication date: 7 November 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2019.07.006

zbMATH Keywords

networkphase transitionrandom graphStirling numberPólya urnpreferential attachmentlimit lawdegree profile

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items

Depths in hooking networks ⋮ The containment profile of hyper-recursive trees ⋮ Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms ⋮ Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks ⋮ Asymptotic degree distribution in a homogeneous evolving network model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit theorems for triangular urn schemes
• On analytical approaches to epidemics on networks
• Moments of gamma type and the Brownian supremum process area
• Central limit theorems for urn models
• Enumeration of \(m\)-ary cacti
• Mesoscopic scales in hierarchical configuration models
• Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• The degree sequence of a scale-free random graph process
• Degrees in random self-similar bipolar networks
• Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
• Probability with Martingales
• Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
• Asymptotic degree distribution in random recursive trees
• On the structure of random plane‐oriented recursive trees and their branches
• BUILDING RANDOM TREES FROM BLOCKS
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems