Fixation for distributed clustering processes
From MaRDI portal
Publication:3565147
Abstract: We study a discrete-time resource flow in , where wealthier vertices attract the resources of their less rich neighbors. For any translation-invariant probability distribution of initial resource quantities, we prove that the flow at each vertex terminates after finitely many steps. This answers (a generalized version of) a question posed by van den Berg and Meester in 1991. The proof uses the mass-transport principle and extends to other graphs.
Recommendations
Cites work
Cited in
(6)- Stability properties of a flow process in graphs
- Meteor process on \({\mathbb Z}^d\)
- Escape of resources in a distributed clustering process
- Longest distance of a non-uniform dispersion process on the infinite line
- Application of passive clustering in directed diffusion algorithm
- A distributed clustering process
This page was built for publication: Fixation for distributed clustering processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565147)