Please use this identifier to cite or link to this item:
|Title:||Constrained Information Transmission On Erdos - Renyi Graphs|
|Abstract:||We model the transmission of information of a message on the Erdos - Renyi random graph with parameters (n, p) and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a random emission capital that decreases by one at each emission. We examine two natural dynamics: in the first dynamics, an informed server performs all its attempts, then checks at each of them if the corresponding edge is open or not; in the second dynamics the informed server knows a priori who are its neighbors, and it performs all its attempts on its actual neighbors in the graph. In each case, we obtain first and second order asymptotics (law of large numbers and central limit theorem), when n -> infinity and p is fixed, for the final proportion of informed servers.|
Erdos-renyi Random Graph
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.