ترغب بنشر مسار تعليمي؟ اضغط هنا

Birth-and-death Polya urns and stationary random partitions

85   0   0.0 ( 0 )
 نشر من قبل Matteo Ruggiero
 تاريخ النشر 2015
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We introduce a class of birth-and-death Polya urns, which allow for both sampling and removal of observations governed by an auxiliary inhomogeneous Bernoulli process, and investigate the asymptotic behaviour of the induced allelic partitions. By exploiting some embedded models, we show that the asymptotic regimes exhibit a phase transition from partitions with almost surely infinitely many blocks and independent counts, to stationary partitions with a random number of blocks. The first regime corresponds to limits of Ewens-type partitions and includes a result of Arratia, Barbour and Tavare (1992) as a special case. We identify the invariant and reversible measure in the second regime, which preserves asymptotically the dependence between counts, and is shown to be a mixture of Ewens sampling formulas, with a tilted Negative Binomial mixing distribution on the sample size.



قيم البحث

اقرأ أيضاً

An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0leq L<Uleq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together with a random number $B_n$ of black balls. If $b_n$ is red and $Z_{n-1}>L$, then $b_n$ is replaced together with a random number $R_n$ of red balls. Otherwise, no additional balls are added, and $b_n$ alone is replaced. In this paper, we assume $R_n=B_n$. Then, under mild conditions, it is shown that $Z_noverset{a.s.}longrightarrow Z$ for some random variable $Z$, and begin{gather*} D_n:=sqrt{n},(Z_n-Z)longrightarrowmathcal{N}(0,sigma^2)quadtext{conditionally a.s.} end{gather*} where $sigma^2$ is a certain random variance. Almost sure conditional convergence means that begin{gather*} Pbigl(D_nincdotmidmathcal{G}_nbigr)overset{weakly}longrightarrowmathcal{N}(0,,sigma^2)quadtext{a.s.} end{gather*} where $Pbigl(D_nincdotmidmathcal{G}_nbigr)$ is a regular version of the conditional distribution of $D_n$ given the past $mathcal{G}_n$. Thus, in particular, one obtains $D_nlongrightarrowmathcal{N}(0,sigma^2)$ stably. It is also shown that $L<Z<U$ a.s. and $Z$ has non-atomic distribution.
A competition process is a continuous time Markov chain that can be interpreted as a system of interacting birth-and-death processes, the components of which evolve subject to a competitive interaction. This paper is devoted to the study of the long- term behaviour of such a competition process, where a component of the process increases with a linear birth rate and decreases with a rate given by a linear function of other components. A zero is an absorbing state for each component, that is, when a component becomes zero, it stays zero forever (and we say that this component becomes extinct). We show that, with probability one, eventually only a random subset of non-interacting components of the process survives. A similar result also holds for the relevant generalized Polya urn model with removals.
In this paper, a baseline model termed as random birth-and-death network model (RBDN) is considered, in which at each time step, a new node is added into the network with probability p (0<p <1) connect it with m old nodes uniformly, or an existing no de is deleted from the network with probability q=1-p. This model allows for fluctuations in size, which may reach many different disciplines in physics, ecology and economics. The purpose of this study is to develop the RBDN model and explore its basic statistical properties. For different p, we first discuss the network size of RBDN. And then combining the stochastic process rules (SPR) based Markov chain method and the probability generating function method, we provide the exact solutions of the degree distributions. Finally, the characteristics of the tail of the degree distributions are explored after simulation verification. Our results show that the tail of the degree distribution for RBDN exhibits a Poisson tail in the case of 0<p<=1/2 and an exponential tail as p approaches to 1.
161 - Patrizia Berti 2009
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some statistical applications are discussed.
We use methods from combinatorics and algebraic statistics to study analogues of birth-and-death processes that have as their state space a finite subset of the $m$-dimensional lattice and for which the $m$ matrices that record the transition probabi lities in each of the lattice directions commute pairwise. One reason such processes are of interest is that the transition matrix is straightforward to diagonalize, and hence it is easy to compute $n$ step transition probabilities. The set of commuting birth-and-death processes decomposes as a union of toric varieties, with the main component being the closure of all processes whose nearest neighbor transition probabilities are positive. We exhibit an explicit monomial parametrization for this main component, and we explore the boundary components using primary decomposition.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا