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

DOI10.1017/APR.2015.11zbMATH Open1336.05124OpenAlexW2293575646MaRDI QIDQ2806351FDOQ2806351

Authors: Panpan Zhang, Hosam M. Mahmoud 

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

Recommendations

• Degrees and distances in random and evolving Apollonian networks
• A note on the maximal degree in random \(k\)-trees
• The degree profile of random Pólya trees
• Degree distribution of random Apollonian network structures and Boltzmann sampling
• The degree distribution of random \(k\)-trees

zbMATH Keywords

networkphase transitionmartingalerandom graphdegree profilerandom structureself-similaritystochastic recurrencePólya urn

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some exactly solvable models of urn process theory
• 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
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• On acyclic simplicial complexes
• Ancestors and descendants in evolving k‐tree models
• 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
• Bernard Friedman's Urn
• The height of random k‐trees and related branching processes
• Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach

Cited In (6)

• ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES
• Degree profile of hierarchical lattice networks
• Distributions in a class of Poissonized urns with an application to Apollonian networks
• Degree distribution of random Apollonian network structures and Boltzmann sampling
• DEGREE-BASED GINI INDEX FOR GRAPHS
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs

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

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