اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCommuting birth-and-death processes
165
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 probabilities 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.
قيم البحث
اقرأ أيضاً
We consider stochastic UL and LU block factorizations of the one-step transition probability matrix for a discrete-time quasi-birth-and-death process, namely a stochastic block tridiagonal matrix. The simpler case of random walks with only nearest ne
ighbors transitions gives a unique LU factorization and a one-parameter family of factorizations in the UL case. The block structure considered here yields many more possible factorizations resulting in a much enlarged class of potential applications. By reversing the order of the factors (also known as a Darboux transformation) we get new families of quasi-birth-and-death processes where it is possible to identify the matrix-valued spectral measures in terms of a Geronimus (UL) or a Christoffel (LU) transformation of the original one. We apply our results to one example going with matrix-valued Jacobi polynomials arising in group representation theory. We also give urn models for some particular cases.
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 exp
loiting 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.
The dynamics of populations is frequently subject to intrinsic noise. At the same time unknown interaction networks or rate constants can present quenched uncertainty. Existing approaches often involve repeated sampling of the quenched disorder and t
hen running the stochastic birth-death dynamics on these samples. In this paper we take a different view, and formulate an effective jump process, representative of the ensemble of quenched interactions as a whole. Using evolutionary games with random payoff matrices as an example, we develop an algorithm to simulate this process, and we discuss diffusion approximations in the limit of weak intrinsic noise.
A strong negative dependence property for measures on {0,1}^n - stability - was recently developed in [5], by considering the zero set of the probability generating function. We extend this property to the more general setting of reaction-diffusion p
rocesses and collections of independent Markov chains. In one dimension the generalized stability property is now independently interesting, and we characterize the birth-death chains preserving it.
This paper investigates the long-term behavior of an interacting particle system of interest in the hot topic of evolutionary game theory. Each site of the $d$-dimensional integer lattice is occupied by a player who is characterized by one of two pos
sible strategies. Following the traditional modeling approach of spatial games, the configuration is turned into a payoff landscape that assigns a payoff to each player based on her strategy and the strategy of her neighbors. The payoff is then interpreted as a fitness, by having each player independently update their strategy at rate one by mimicking their neighbor with the largest payoff. With these rules, the mean-field approximation of the spatial game exhibits the same asymptotic behavior as the popular replicator equation. Except for a coexistence result that shows an agreement between the process and the mean-field model, our analysis reveals that the two models strongly disagree in many aspects, showing in particular that the presence of a spatial structure in the form of local interactions plays a key role. More precisely, in the parameter region where both strategies are evolutionary stable in the replicator equation, in the spatial model either one strategy wins or the system fixates to a configuration where both strategies are present. In addition, while defection is evolutionary stable for the prisoners dilemma game in the replicator equation, space favors cooperation in our model.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
