Fixation for Distributed Clustering Processes

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-223080

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.