Gracar, P orcid.org/0000-0001-8340-8340 and Stauffer, A (2018) Percolation of lipschitz surface and tight bounds on the spread of information among mobile agents. In: Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 39:1-39:17. ISBN 9783959770859
Abstract
We consider the problem of spread of information among mobile agents on the torus. The agents are initially distributed as a Poisson point process on the torus, and move as independent simple random walks. Two agents can share information whenever they are at the same vertex of the torus. We study the so-called flooding time: The amount of time it takes for information to be known by all agents. We establish a tight upper bound on the flooding time, and introduce a technique which we believe can be applicable to analyze other processes involving mobile agents.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © Peter Gracar and Alexandre Stauffer. This is an open access conference paper under the terms of the Creative Commons Attribution License (CC-BY 3.0). |
Keywords: | Lipschitz surface; spread of information; flooding time; moving agents |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Statistics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 31 Jan 2024 13:26 |
Last Modified: | 31 Jan 2024 16:44 |
Status: | Published |
Publisher: | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Identification Number: | 10.4230/LIPIcs.APPROX-RANDOM.2018.39 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:200623 |