The degree profile and weight in Apollonian networks and k-trees

DOI10.1017/apr.2015.11zbMath1336.05124OpenAlexW2293575646MaRDI QIDQ2806351

Hosam M. Mahmoud, Panpan Zhang

Publication date: 17 May 2016

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

Full work available at URL: https://projecteuclid.org/euclid.aap/1457466160

zbMATH Keywords

networkself-similarityphase transitionrandom structuremartingalerandom graphPólya urnstochastic recurrencedegree profile

Mathematics Subject Classification ID

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 (4)

Distributions in a class of Poissonized urns with an application to Apollonian networks ⋮ ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit theorems for triangular urn schemes
• On the degree distribution of the nodes in increasing trees
• Moments of gamma type and the Brownian supremum process area
• Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach
• On Certain Properties of Random Apollonian Networks
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Asymptotic degree distribution in random recursive trees
• The height of random k‐trees and related branching processes
• Ancestors and descendants in evolving k‐tree models
• Bernard Friedman's Urn
• On acyclic simplicial complexes
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems

This page was built for publication: The degree profile and weight in Apollonian networks and k-trees