On a preferential attachment and generalized Pólya's urn model

DOI10.1214/12-AAP869zbMath1266.05150arXiv1203.5758OpenAlexW3122022176MaRDI QIDQ1950268

Andrea Collevecchio, Codina Cotar, Marco Li Calzi

Publication date: 10 May 2013

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

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

zbMATH Keywords

preferential attachmentpioneer vertexPólya's urn processreinforcement functionreinforcement processesspecies sampling sequence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items (20)

Generalized rescaled Pólya urn and its statistical application ⋮ The rescaled Pólya urn: local reinforcement and chi-squared goodness-of-fit test ⋮ Scale-free behavior of networks with the copresence of preferential and uniform attachment rules ⋮ A Finite Memory Interacting Pólya Contagion Network and Its Approximating Dynamical Systems ⋮ Uniform preferential selection model for generating scale-free networks ⋮ Ranking-based rich-get-richer processes ⋮ Interacting nonlinear reinforced stochastic processes: Synchronization or non-synchronization ⋮ Synchronization of reinforced stochastic processes with a network-based interaction ⋮ Generating graphs by creating associative and random links between existing nodes ⋮ A scaling limit for the degree distribution in sublinear preferential attachment schemes ⋮ Nonlinear randomized urn models: a stochastic approximation viewpoint ⋮ Localisation in a growth model with interaction ⋮ Further properties of a random graph with duplications and deletions ⋮ Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means ⋮ Linear de-preferential urn models ⋮ Unnamed Item ⋮ Joint degree distributions of preferential attachment random graphs ⋮ Networks of reinforced stochastic processes: asymptotics for the empirical means ⋮ On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities ⋮ A new approach to Pólya urn schemes and its infinite color generalization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defining predictive probability functions for species sampling models
• A survey of random processes with reinforcement
• Attraction time for strongly reinforced walks
• Random networks with sublinear preferential attachment: degree evolutions
• Exchangeable urn processes
• Generalizations of Polya's urn problem
• Exchangeable and partially exchangeable random partitions
• Random networks with sublinear preferential attachment: the giant component
• Prediction rules for exchangeable sequences related to species sampling
• The degree sequence of a scale-free random graph process
• The onset of dominance in balls-in-bins processes with feedback
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• On random trees
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• Random trees and general branching processes
• Reinforced random walk

This page was built for publication: On a preferential attachment and generalized Pólya's urn model