Mathematics – Probability
Scientific paper
2009-06-17
Communications on Pure and Applied Mathematics, v. 63, p. 926-934, 2010
Mathematics
Probability
9 pages, 1 figure. Minor corrections
Scientific paper
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.
Hilário Marcelo R.
Louidor Oren
Newman Charles M.
Rolla Leonardo T.
Sheffield Scott
No associations
LandOfFree
Fixation for Distributed Clustering Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixation for Distributed Clustering Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixation for Distributed Clustering Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223080