Fixation for Distributed Clustering Processes

Autor(es)

Hilario, M. R. ^[1] ; Louidor, O. ^[2] ; Newman, C. M. ^[2] ; Rolla, L. T. ^[3] ; Sheffield, S. ^[4] ; Sidoravicius, V. ^{[1, 5]}

Afiliação do(s) autor(es)

^[1] Inst Matematica Pura & Aplicada, BR-22460320 Rio De Janeiro - Brazil

^[2] NYU, Courant Inst, New York, NY 10012 - USA

^[3] Ecole Normale Super, Dept Math & Applicat, F-75005 Paris - France

^[4] MIT, Dept Math, Cambridge, MA 02139 - USA

^[5] Ctr Wiskunde & Informat, NL-1090 GB Amsterdam - Netherlands

• Tipo de documento: Artigo Científico
• Fonte: COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS; v. 63, n. 7, p. 926-934, JUL 2010.
• Citações Web of Science: 1

Resumo

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. (C) 2010 Wiley Periodicals, Inc. (AU)

• Processo FAPESP: 07/58470-1 - Percolacao de ultima passagem e processos multiclasse.
• Beneficiário: Leonardo Trivellato Rolla
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado