相关论文: Stochastic rumors on random trees
We give estimates of the critical parameter for random loop models that are related to quantum spin systems. A special case of the model that we consider is the interchange- or random-stirring process. We consider here the model defined on…
This paper deals with the modeling and estimation of the sociological phenomena called echo chambers and segregation in social networks. Specifically, we present a novel community-based graph model that represents the emergence of…
Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…
Trending topics are often the result of the spreading of information between users of social networks. These special topics can be regarded as rumors. The spreading of a rumor is often studied with the same techniques as in epidemics…
Most information spreading models consider that all individuals are identical psychologically. They ignore, for instance, the curiosity level of people, which may indicate that they can be influenced to seek for information given their…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
A stochastic epidemic model is defined in which each individual belongs to a household, a secondary grouping (typically school or workplace) and also the community as a whole. Moreover, infectious contacts take place in these three settings…
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
Consider stochastic models for the spread of an infection in a structured community, where this structured community is itself described by a random network model. Some common network models and transmission models are defined and large…
A model for the spreading of online information or "memes" on multiplex networks is introduced and analyzed using branching-process methods. The model generalizes that of [Gleeson et al., Phys.Rev. X., 2016] in two ways. First, even for a…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
The Random Language Model, proposed as a simple model of human languages, is defined by the averaged model of a probabilistic context-free grammar. This grammar expresses the process of sentence generation as a tree graph with nodes having…
The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. Starting with a single informed node, each node is associated with an exponential time clock with rate $1$ and calls a random…
In this paper we consider a model of spreading information in heterogeneous systems wherein we have two kinds of objects. Some of them are active and others are passive. Active objects can, if they possess information, share it with an…
We study a stochastic epidemic model consisting of elements (organisms in a community or cells in tissue) with fixed positions, in which damage or disease is transmitted by diffusing agents ("signals") emitted by infected individuals. The…
In a communication scheme, there exist points at the transmitter and at the receiver where the wave is reduced to a finite set of functions of time which describe amplitudes and phases. For instance, the information is summarized in…
We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the…
Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…