相关论文: The Maki-Thompson rumor model on infinite Cayley t…
The behavior of two interacting populations, ``hosts''and ``parasites'', is investigated on Cayley trees and scale-free networks. In the former case analytical and numerical arguments elucidate a phase diagram, whose most interesting…
Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In each round, every informed node sends the rumor to a random…
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal fraction of neighbors of a given node that interchange information among each…
Growing literatures on epidemic and rumor dynamics show that infection and information coevolve. We present a unified framework for modeling the spread of infection and information: a general class of interaction-driven fluid-limit models…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
In this paper, we investigate tree-indexed Markov chains (Gibbs measures) defined by a Hamiltonian that couples two Ising layers: hidden spins \(s(x) \in \{\pm 1\}\) and observed spins \(\sigma(x) \in \{\pm 1\}\) on a Cayley tree. The…
An inequality of K. Marton shows that the joint distribution of a Markov chain with uniformly contracting transition kernels exhibits concentration. We prove an analogous inequality for broadcast models on finite trees. We use this…
We consider the random wetting transition on the Cayley tree, i.e. the problem of a directed polymer on the Cayley tree in the presence of random energies along the left-most bonds. In the pure case, there exists a first-order transition…
We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous-time simple random walk on $\mathbb{Z}^d$, with jump rate $D_A$. These particles are called $A$-particles and move…
Consider a tree network T, where each edge acts as an independent copy of a given channel M, and information is propagated from the root. For which T and M does the configuration obtained at level n of T typically contain significant…
Rumor models consider that information transmission occurs with the same probability between each pair of nodes. However, this assumption is not observed in social networks, which contain influential spreaders. To overcome this limitation,…
We study networks of gossiping users where a source observing a process sends updates to an underlying graph. Nodes in the graph update their neighbors randomly and nodes always accept packets that have newer information, thus attempting to…
We model the spread of information in a homogeneously mixed population using the Maki Thompson rumor model. We formulate an optimal control problem, from the perspective of single campaigner, to maximize the spread of information when the…
We show that a simple model for the propagation of a rumor on a small-world network exhibits critical behavior at a finite randomness of the underlying graph. The transition occurs between a regime where the rumor "dies" in a small…
Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in particular on the…
We study a model of rumor propagation in discrete time where each site in the graph has initially a distinct information; we are interested in the number of "conversations" before the entire graph knows all informations. This problem can be…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
Rumors have ignited revolutions, undermined the trust in political parties, or threatened the stability of human societies. Such destructive potential has been significantly enhanced by the development of on-line social networks. Several…
One of the major issues in the theoretical modeling of epidemic spreading is the development of methods to control the transmission of an infectious agent. Human behavior plays a fundamental role in the spreading dynamics and can be used to…
We study the spread of a persuasive new idea through a population of continuous-time random walkers in one dimension. The idea spreads via social gatherings involving groups of nearby walkers who act according to a biased "majority rule":…