108 search results - page 9 / 22 » Spreading of Messages in Random Graphs |
CPC
2006
13 years 7 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
SIAMDM
2010
13 years 2 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
ACISICIS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
MSWIM
2009
ACM
14 years 2 months ago
2009
ACM
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...