Proceedings chapter
OA Policy
English

Interacting urns processes : for clustering of large-scale networks of tiny artifacts

Presented atFortaleza (Ceara, Brazil), March 16-20, 2008
PublisherACM Press
Publication date2008
Abstract

We analyze a distributed variation on the P´olya urn process in which a network of tiny artifacts manages the individual urns. Neighboring urns interact by repeatedly adding the same colored ball based on previous random choices. We discover that the process rapidly converges to a definitive random ratio between the colors in every urn and that the rate of convergence of the process at a given node depends on the global topology of the network. In particular, the same ratio appears for the case of complete communication graphs. Surprisingly, this effortless random process supports useful applications, such as clustering and pseudocoordinate computation. We present preliminary numerical studies that validate our theoretical predictions.

Citation (ISO format)
LEONE, Pierre, SCHILLER, Elad M. Interacting urns processes : for clustering of large-scale networks of tiny artifacts. In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC). Fortaleza (Ceara, Brazil). [s.l.] : ACM Press, 2008. doi: 10.1145/1363686.1364182
Main files (1)
Proceedings chapter (Accepted version)
accessLevelPublic
Identifiers
ISBN978-1-59593-753-7
576views
407downloads

Technical informations

Creation31/01/2014 16:34:00
First validation31/01/2014 16:34:00
Update time14/03/2023 21:57:12
Status update14/03/2023 21:57:12
Last indexation30/10/2024 17:13:05
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack