Related papers: Stochastic rumors on random trees
With the popularity of portable wireless devices it is important to model and predict how information or contagions spread by natural human mobility -- for understanding the spreading of deadly infectious diseases and for improving delay…
Random forests are an ensemble method relevant for many problems, such as regression or classification. They are popular due to their good predictive performance (compared to, e.g., decision trees) requiring only minimal tuning of…
We consider a stochastic susceptible-infected-recovered (SIR) model with contact tracing on random trees and on the configuration model. On a rooted tree, where initially all individuals are susceptible apart from the root which is…
A dynamic model of a society is studied where each person is an uncorrelated and non-interacting random walker. A dynamical random graph represents the acquaintance network of the society whose nodes are the individuals and links are the…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumor-like dynamics. Recent…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
We consider the problem of estimating the parameters of a supercritical controlled branching process consistently from a single observed trajectory of population size counts. Our goal is to establish which parameters can and cannot be…
This paper addresses the rumor source identification problem, where the goal is to find the origin node of a rumor in a network among a given set of nodes with the rumor. In this paper, we focus on a network represented by a regular tree…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
Information and individual activities often spread globally through the network of social ties. While social contagion phenomena have been extensively studied within the framework of threshold models, it is common to make an assumption that…
We study the classical rumor spreading problem, which is used to spread information in an unknown network with $n$ nodes. We present the first protocol for any expander graph $G$ with $n$ nodes and minimum degree $\Theta(n)$ such that, the…
We consider a broadcasting problem on a tree where a binary digit (e.g., a spin or a nucleotide's purine/pyrimidine type) is propagated from the root to the leaves through symmetric noisy channels on the edges that randomly flip the state…
We adopt a maximum-likelihood framework to estimate parameters of a stochastic susceptible-infected-recovered (SIR) model with contact tracing on a rooted random tree. Given the number of detectees per index case, our estimator allows to…
We study the Tree Builder Random Walk: a randomly growing tree, built by a walker as she is walking around the tree. Namely, at each time $n$, she adds a leaf to her current vertex with probability $p_n \asymp n^{-\gamma}$, $\gamma\in…
Broadcast and consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures.…
The rapid spread of rumors in social media is mainly caused by individual retweets. This paper applies uncertainty time series analysis (UTSA) to analyze a rumor retweeting behavior on Weibo. First, the rumor forwarding is modeled using…
Respondent-Driven Sampling is a popular technique for sampling hidden populations. This paper models Respondent-Driven Sampling as a Markov process indexed by a tree. Our main results show that the Volz-Heckathorn estimator is…
Many models of epidemic spread have a common qualitative structure. The numbers of infected individuals during the initial stages of an epidemic can be well approximated by a branching process, after which the proportion of individuals that…
The shapes of branching trees have been linked to disease transmission patterns. In this paper we use the general Crump-Mode-Jagers branching process to model an outbreak of an infectious disease under mild assumptions. Introducing a new…