Coexistence in preferential attachment networks

DOI10.1017/S0963548315000383MaRDI QIDQ5366924zbMATH OpenOpenAlexFDO

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

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

growing networksreal-world networks

Mathematics Subject Classification ID

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

Abstract: We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses neighbours by preferential attachment, and selects its type based on the number of initial neighbours of each type. The model is analysed in detail, and in particular, we determine the possible proportions of the various types in the limit of large networks. An important qualitative feature we find is that, in contrast to many current theoretical models, often several competitors will coexist. This matches empirical observations in many real-world networks.

Recommendations

• Preferential attachment graphs with co-existing types of different fitnesses
• Automata, Languages and Programming
• A spatial preferential attachment model with local clustering
• A Poisson growing competition network and the fitness model
• Preferred attachment in affiliation networks

Cites work

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

Cited in

(22)

• Non-convergence of proportions of types in a preferential attachment graph with three co-existing types
• Coexistence of several currencies in presence of increasing returns to adoption
• Barabási-Albert random graph with multiple type edges and perturbation
• Fragility of nonconvergence in preferential attachment graphs with three types
• String networks with junctions in competition models
• Brand effect versus competitiveness in hypernetworks
• scientific article; zbMATH DE number 5621258 (Why is no real title available?)
• Co-evolution of networks and quantum dynamics: a generalization of preferential attachment
• On the duration and intensity of cumulative advantage competitions
• Birds of a feather or opposites attract -- effects in network modelling
• Preferential attachment graphs with co-existing types of different fitnesses
• Competition in growth and urns
• Structural cohesion and embeddedness in two-mode networks
• Joint degree distributions of preferential attachment random graphs
• Asymptotic degree distribution in preferential attachment graph models with multiple type edges
• Automata, Languages and Programming
• Degree distributions in recursive trees with fitnesses
• Universal `winner-takes-it-all' phenomenon in scale-free random graphs
• Broadcasting in random recursive DAGs
• Competing types in preferential attachment graphs with community structure
• Pólya urns on hypergraphs
• A model of opinion dynamics evolving via a preferential attachment mechanism involving multiple extractions

This page was built for publication: Coexistence in preferential attachment networks

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