Proceedings chapter
Open access

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

Presented at Fortaleza (Ceara, Brazil), March 16-20, 2008
PublisherACM Press
Publication date2008

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)

Technical informations

Creation01/31/2014 3:34:00 PM
First validation01/31/2014 3:34:00 PM
Update time03/14/2023 8:57:12 PM
Status update03/14/2023 8:57:12 PM
Last indexation08/29/2023 10:27:20 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack