A scaling result for explosive processes
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Combinatorics in computer science (68R05) Auctions, bargaining, bidding and selling, and other market models (91B26)
Summary: We consider the asymptotic behavior of the following model: balls are sequentially throw into bins so that the probability that a bin with \(n\) balls obtains the next ball is proportional to \(f(n)\) for some function \(f\). A commonly studied case where there are two bins and \(f(n) =n^p\) for \(p>14\). In this case, one of the two bins eventually obtains a monopoly, in the sense that it obtains all balls thrown past some point. This model is motivated by the phenomenon of positive feedback, where the ``rich get richer. We derive a simple asymptotic expression for the probability that bin 1 obtains a monopoly when bin 1 starts with \(x\) balls and bin 2 starts with \(y\) balls for the case \(f(n)=n^p\). We then demonstrate the effectiveness of this approximation with some examples and demonstrate how it generalizes to a wide class of functions \(f\).
- A power-of-two-choices unbalanced allocation process
- The onset of dominance in balls-in-bins processes with feedback
- scientific article; zbMATH DE number 3994830 (Why is no real title available?)
- Balls-in-Bins Processes with Feedback and Brownian Motion
- scientific article; zbMATH DE number 7662444 (Why is no real title available?)
- Asymptotics of generalized Pólya urns with non-linear feedback
- Fixation of leadership in non-Markovian growth processes
- Stability of a growth process generated by monomer filling with nearest-neighbour cooperative effects
This page was built for publication: A scaling result for explosive processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883643)
