Localisation in a growth model with interaction. Arbitrary graphs
From MaRDI portal
Abstract: This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers of existing particles in a neighbourhood of a vertex. When this function depends only on the number of particles in the vertex, the model becomes a special case of the generalised Polya urn model. In this special case all but finitely many particles are allocated at a single random vertex almost surely. In our model interaction leads to the fact that, with probability one, all but finitely many particles are allocated at vertices of a clique.
Recommendations
Cites work
- A generalized Pólya's urn with graph based interactions
- Dependent particle deposition on a graph: concentration properties of the height profile
- Localisation in a growth model with interaction
- Localization on 4 sites for vertex-reinforced random walks on \(\mathbb{Z}\)
- Long term behaviour of a reversible system of interacting random walks
- Long term behaviour of locally interacting birth-and-death processes
- Non-homogeneous random walks. Lyapunov function methods for near-critical stochastic systems
- Queueing with neighbours
- Reinforced random walk
- Stability of a growth process generated by monomer filling with nearest-neighbour cooperative effects
Cited in
(3)
This page was built for publication: Localisation in a growth model with interaction. Arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114799)
