Coexistence in Preferential Attachment Networks

DOI10.1017/S0963548315000383zbMath1371.05277arXiv1307.2893OpenAlexW3105940219MaRDI QIDQ5366924

Tonci Antunovic, Miklós Z. Rácz, Elchanan Mossel

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2893

zbMATH Keywords

real-world networksgrowing networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Stochastic processes (60G99)

Related Items (8)

Degree distributions in recursive trees with fitnesses ⋮ Barabási-Albert random graph with multiple type edges and perturbation ⋮ Preferential attachment graphs with co-existing types of different fitnesses ⋮ Competition in growth and urns ⋮ Fragility of nonconvergence in preferential attachment graphs with three types ⋮ Non-convergence of proportions of types in a preferential attachment graph with three co-existing types ⋮ Joint degree distributions of preferential attachment random graphs ⋮ Asymptotic degree distribution in preferential attachment graph models with multiple type edges

Cites Work

• The winner takes it all
• Diffusion and cascading behavior in random networks
• Stochastic orders
• A time-dependent version of Pólya's urn
• Nonconvergence to unstable points in urn models and stochastic approximations
• A survey of random processes with reinforcement
• A strong law for some generalized urn processes
• Word-of-mouth learning.
• The diameter of a scale-free random graph
• Asymptotic pseudotrajectories and chain recurrent flows, with applications
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Emergence of Scaling in Random Networks
• Dynamical Processes on Complex Networks
• A dynamic model of social network formation
• A simple model of global cascades on random networks
• Competing first passage percolation on random regular graphs
• When are Touchpoints Limits for Generalized Polya URNS?
• A generalized Pólya's urn with graph based interactions
• A Stochastic Approximation Method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coexistence in Preferential Attachment Networks