Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
DOI10.1016/J.AAM.2019.07.006zbMATH Open1426.05157OpenAlexW2969277637WikidataQ127334059 ScholiaQ127334059MaRDI QIDQ2334518FDOQ2334518
Authors: 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
Recommendations
- Degree distributions of generalized hooking networks
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
- Convergence properties of the degree distribution of some growing network models
- On terminal nodes and the degree profile of preferential dynamic attachment circuits
networkphase transitionrandom graphdegree profilepreferential attachmentStirling numberlimit lawPólya urn
Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Stochastic network models in operations research (90B15)
Cites Work
- Probability with Martingales
- Title not available (Why is that?)
- The degree sequence of a scale-free random graph process
- On analytical approaches to epidemics on networks
- Some exactly solvable models of urn process theory
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Asymptotic degree distribution in random recursive trees
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- On the structure of random plane‐oriented recursive trees and their branches
- Central limit theorems for urn models
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Limit theorems for triangular urn schemes
- Moments of gamma type and the Brownian supremum process area
- Enumeration of \(m\)-ary cacti
- The degree distribution of thickened trees
- Mesoscopic scales in hierarchical configuration models
- Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach
- Building random trees from blocks
- Degrees in random self-similar bipolar networks
- Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
Cited In (9)
- Asymptotic degree distribution in a homogeneous evolving network model
- Depths in hooking networks
- Depths in random recursive metric spaces
- Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- On terminal nodes and the degree profile of preferential dynamic attachment circuits
- Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
- The containment profile of hyper-recursive trees
- Degree distributions of generalized hooking networks
This page was built for publication: Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334518)
