一类临界可交换随机环境中分枝过程的灭绝概率

本文将经典分枝过程临界情形的遍历基本引理推广到了随机环境情形,并在此基础上研究了一类临界可交换随机环境中分枝过程的灭绝概率的性质．     

随机环境中上临界分支过程的Wasserstein-1距离及非一致性Berry-Esseen界

设$(Z_{n})_{ngeq 0}$为一个在独立同分布随机环境下的上临界分支过程。我们对$(Z_{n})_{ngeq 0}$的Wasserstein-1距离证得一个最优的收敛速度,该结果补充了Grama等[Stochastic Process. Appl., 2017, 127(4): 1255--1281]的结论. 此外, 本文也给出了指数非一致性的 Berry-Esseen 界. 最后本文还讨论了通过运用主要结果而得到的关键参数和人口数量$Z_n$的置信区间估计.     

The behavior of super-Brownian motion near extinction

We start from a super-Brownian motion with the branching mechanism presented by Dawson and Vinogradov. Its behaviour near extinction is studied in this paper, and the main result is that the diameter of the support tends to zero almost surely at the time of extinction. Research supported by Tianyuan Foundation and Postdoctoral Foundation     

超布朗运动在临近灭绝时的行为

本文研究具有一类较广泛分支特征的超布朗运动在临近灭绝时的行为,主要得到了在临近灭绝时它的支撑的直径几乎处处收敛到零     

The ‘birth-and-assassination’ process

A new variant of a branching process is introduced, with sufficient conditions for it to persist and to die out. The model is applied to discuss the asymptotic stability of a new type of queuing process.     

Markovian trees: properties and algorithms

In this paper we introduce a structure called the Markovian tree (MT). We define the MT and explore its alternative representation as a continuous-time Markovian Multitype Branching Process. We then develop two algorithms, the Depth and Order algorithms to determine the probability of eventual extinction of the MT process. We show that both of these algorithms have very natural physically intuitive interpretations and are analogues of the Neuts and U algorithms in Matrix-analytic Methods. Furthermore, we show that a special case of the Depth algorithm sheds new light on the interpretation of the sample paths of the Neuts algorithm.     

随机环境中受控分枝过程的灭绝概率

本文给出在平稳遍历随机环境下受控分枝过程增长率的一个上界以及过程灭绝的充分条件.     

On long time almost sure asymptotics of renormalized branching diffusion processes

We are concerned with the long time behavior of branching diffusion processes. We give a partial answer to the following question: given a smooth density g₀, a branching rate and a spatial motion, does there exist a (nonspatially homogeneous) binary offspring distribution such that the corresponding renormalized branching process tends a.s. to g₀(y) dy as time grows to infinity?     

随机环境中分枝过程灭绝概率的性质

本文给出了随机环境中分枝过程概率母函数以及灭绝概率的性质.     

分支碰撞过程的唯一性和吸收性质

本文研究了一种分支碰撞过程,它的唯一性和吸收概率在大多数情况下都是成立的。     

Convergence of two-dimensional branching recursions

The asymptotic distribution of branching type recursions (L_n) of the form is investigated in the two-dimensional case. Here is an independent copy of L_n−1 and A,B are random matrices jointly independent of . The asymptotics of L_n after normalization are derived by a contraction method. The limiting distribution is characterized by a fixed point equation. The assumptions of the convergence theorem are checked in some examples using eigenvalue decompositions and computer algebra.     

变化环境中的分枝过程

设｛犣狀｝为变化环境中的上临界的分枝过程,犠为非负鞅｛犣狀／犈犣狀｝的极限,在一致上临界以及控制后代分布尾行为的假设条件下,给出了犠非退化的必要条件,且证明了｛犣狀／犈犣狀｝的犔１ 收敛性质成立．     

Expected waiting time in symmetric polling systems with correlated walking times

Polling systems have been extensively studied, and have found many applications. They have often been used for studying wired local area networks such as token passing rings and wireless local area networks such as bluetooth. In this contribution we relax one of the main restrictions on the statistical assumptions under which polling systems have been analyzed. Namely, we allow correlation between walking times. We consider (i) the gated regime where a gate closes whenever the server arrives at a queue. It then serves at that queue all customers who were present when the gate closes. (ii) The exhaustive regime in which the server remains at a queue till it empties. Our analysis is based on stochastic recursive equations related to branching processes with migration with a random environment. In addition to our derivation of expected waiting times for polling systems with correlated walking times, we set the foundations for computing second order statistics of the general multi-dimensional stochastic recursions.      

随机环境中广义随机游动的灭绝概率

随机环境中广义随机游动(GRWRE)是随机环境中随机游动(RWRE)的推广．该文构造了非负整数集上的GRWRE,证明了这种模型的存在性,并计算了灭绝概率．     

Global alignment of molecular sequences via ancestral state reconstruction

We consider the trace reconstruction problem on a tree (TRPT): a binary sequence is broadcast through a tree channel where we allow substitutions, deletions, and insertions; we seek to reconstruct the original sequence from the sequences received at the leaves. The TRPT is motivated by the multiple sequence alignment problem in computational biology. We give a simple recursive procedure giving strong reconstruction guarantees at low mutation rates. To our knowledge, this is the first rigorous trace reconstruction result on a tree in the presence of indels.