Fixation for distributed clustering processes

DOI10.1002/CPA.20321zbMATH Open1202.60156arXiv0906.3154OpenAlexW3098465994MaRDI QIDQ3565147FDOQ3565147

Leonardo T. Rolla, Scott Sheffield, Vladas Sidoravicius, Marcelo Richard Hilário, Oren Louidor, Charles M. Newman

Publication date: 2 June 2010

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Abstract: We study a discrete-time resource flow in $Z^d$, 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.

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

Recommendations

• On a distributed clustering process of Coffman, Courtois, Gilbert and Piret
• Asymmetrical resource networks. I. Stabilization processes for low resources
• Escape of resources in a distributed clustering process
• A distributed clustering process
• Bidirectional resource networks: A new flow model

Mathematics Subject Classification ID

Applications of graph theory (05C90) Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Stability properties of a flow process in graphs
• A distributed clustering process
• On a distributed clustering process of Coffman, Courtois, Gilbert and Piret

Cited In (3)

• Stability properties of a flow process in graphs
• 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)