Scientific article
Open access

Interacting Urns Processes for Clustering of Large-Scale Networks of Tiny Artifacts

Publication date2010

We analyze a distributed variation on the Pólya 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. Moreover, 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 computation of pseudo-geometric coordinate. We present 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: International journal of distributed sensor networks, 2010, vol. 2010, p. 1–11. doi: 10.1155/2010/936195
Main files (1)
Article (Published version)
ISSN of the journal1550-1329

Technical informations

Creation12/12/2013 5:28:00 PM
First validation12/12/2013 5:28:00 PM
Update time03/14/2023 8:43:02 PM
Status update03/14/2023 8:43:02 PM
Last indexation08/29/2023 8:16:16 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack