中文
相关论文

相关论文: Rumor processes in random environment on N and on …

200 篇论文

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

概率论 · 数学 2015-09-29 Yueyun Hu , Zhan Shi

We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…

数学物理 · 物理学 2022-10-26 Francois Dunlop , Arif Mardin

We consider the point process of signal strengths from transmitters in a wireless network observed from a fixed position under models with general signal path loss and random propagation effects. We show via coupling arguments that under…

概率论 · 数学 2014-11-20 Holger Paul Keeler , Nathan Ross , Aihua Xia

The family tree of a Galton-Watson branching process may contain N-ary subtrees, i.e. subtrees whose vertices have at least N>0 children. For family trees without infinite N-ary subtrees, we study how fast N-ary subtrees of height t…

概率论 · 数学 2008-03-04 Ljuben Mutafchiev

We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…

概率论 · 数学 2018-08-14 Yevgeniy Kovchegov , Ilya Zaliapin

A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…

概率论 · 数学 2020-03-24 Nicolas Broutin , Luc Devroye , Nicolas Fraiman

We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…

概率论 · 数学 2023-01-03 Benjamin Hackl , Alois Panholzer , Stephan Wagner

A branching process in a Markovian environment consists of an irreducible Markov chain on a set of "environments" together with an offspring distribution for each environment. At each time step the chain transitions to a new random…

概率论 · 数学 2021-06-22 Lila Greco , Lionel Levine

A continuous-state branching process in varying environments is constructed by the pathwise unique solution to a stochastic integral equation driven by time-space noises. The process arises naturally in the limit theorem of Galton--Watson…

概率论 · 数学 2020-03-04 Rongjuan Fang , Zenghu Li

In this work we consider three well-studied broadcast protocols: Push, Pull and Push&Pull. A key property of all these models, which is also an important reason for their popularity, is that they are presumed to be very robust, since they…

组合数学 · 数学 2021-10-20 Rami Daknama , Konstantinos Panagiotou , Simon Reisser

We consider a network consisting of $n$ nodes connected in a ring formation and a source that generates updates according to a renewal process and disseminates them to the ring network according to a Poisson process. The nodes in the…

信息论 · 计算机科学 2026-05-07 Arunabh Srivastava , Sennur Ulukus

The randomized rumor spreading problem generates a big interest in the area of distributed algorithms due to its simplicity, robustness and wide range of applications. The two most popular communication paradigms used for spreading the…

社会与信息网络 · 计算机科学 2019-01-01 Dariusz R. Kowalski , Christopher Thraves Caro

In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the graph. We study the information gathering problem, where each node has a piece of information called a rumor,…

数据结构与算法 · 计算机科学 2019-11-19 Marek Chrobak , Kevin Costello , Leszek Gasieniec

We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…

概率论 · 数学 2011-12-22 Erik Broman , Ronald Meester

Many existing statistical models for networks overlook the fact that many real world networks are formed through a growth process. To address this, we introduce the PAPER (Preferential Attachment Plus Erd\H{o}s--R\'{e}nyi) model for random…

统计方法学 · 统计学 2023-02-08 Harry Crane , Min Xu

The study of rumor models from a percolation theory point of view has gained a few adepts in the last few years. The persistence of a rumor, which may consistently spread out throughout a population can be associated to the existence of a…

In this paper, we study the Galton-Watson process in the random environment for the particular case when the number of the offsprings in each generation has the fractional linear generation function with random parameters. In this case, the…

概率论 · 数学 2020-12-01 Dan Han , Stanislav Molchanov , Yanjmaa Jutmaan

We consider a random walk with death in $[-N,N]$ moving in a time dependent environment. The environment is a system of particles which describes a current flux from $N$ to $-N$. Its evolution is influenced by the presence of the random…

We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…

概率论 · 数学 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

统计力学 · 物理学 2011-08-25 Zhongzhi Zhang , Xintong Li , Yuan Lin , Guanrong Chen