Degrees in random self-similar bipolar networks

DOI10.1017/JPR.2016.11zbMath1342.05156OpenAlexW2472834472MaRDI QIDQ3188575

Hosam M. Mahmoud, Chen Chen

Publication date: 11 August 2016

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

Full work available at URL: https://projecteuclid.org/euclid.jap/1466172865

zbMATH Keywords

networkself-similarityrandom structuredegreerandom graphmultivariate normal distributionPólya urnstochastic recurrence

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

Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks ⋮ Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph grammars with string-regulated rewriting
• Limit theorems for triangular urn schemes
• Variance in randomized play-the-winner clinical trials
• Central limit theorems for urn models
• Explicit characterization of moments of balanced triangular Pólya urns by an elementary approach
• Two-color balanced affine urn models with multiple drawings
• Polya Urn Models
• BUILDING RANDOM TREES FROM BLOCKS
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems

This page was built for publication: Degrees in random self-similar bipolar networks