English
Related papers

Related papers: Interval partition evolutions with emigration rela…

200 papers

It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…

Probability · Mathematics 2015-03-17 Steven N. Evans , Rudolf Gruebel , Anton Wakolbinger

We investigate subcritical Galton-Watson branching processes with immigration in a random environment. Using Goldie's implicit renewal theory we show that under general Cram\'er condition the stationary distribution has a power law tail. We…

Probability · Mathematics 2020-02-04 Bojan Basrak , Peter Kevei

We consider the task of filtering a dynamic parameter evolving as a diffusion process, given data collected at discrete times from a likelihood which is conjugate to the marginal law of the diffusion, when a generic dual process on a…

Probability · Mathematics 2023-11-29 Guillaume Kon Kam King , Andrea Pandolfi , Marco Piretto , Matteo Ruggiero

Einstein's explanation of Brownian motion provided one of the cornerstones which underlie the modern approaches to stochastic processes. His approach is based on a random walk picture and is valid for Markovian processes lacking long-term…

Statistical Mechanics · Physics 2009-11-10 I. M. Sokolov , J. Klafter

We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…

Probability · Mathematics 2009-09-25 Jim Pitman , Matthias Winkel

Consider the Markov process taking values in the partitions of N such that each pair of blocks merges at rate one, and each integer is eroded, i.e., becomes a singleton block, at rate d. This is a special case of exchangeable…

Probability · Mathematics 2019-07-15 Félix Foutel-Rodier , Amaury Lambert , Emmanuel Schertzer

Recently there has been significant interest in constructing ordered analogues of Petrov's two-parameter extension of Ethier and Kurtz's infinitely-many-neutral-alleles diffusion model. One method for constructing these processes goes…

Probability · Mathematics 2022-02-09 Kelvin Rivera-Lopez , Douglas Rizzolo

We study a class of Markov processes with finite state space and continuous time that have product form stationary distributions. We obtain a number of examples that can generate conjectures for diffusions with inert drift.

Probability · Mathematics 2008-10-19 Krzysztof Burdzy , David White

A family of continuous-state branching processes with immigration are constructed as the solution flow of a stochastic equation system driven by time-space noises. The family can be regarded as an inhomogeneous increasing path-valued…

Probability · Mathematics 2014-01-14 Zenghu Li

In the continuity of a recent paper ([6]), dealing with finite Markov chains, this paper proposes and analyzes a recursive algorithm for the approximation of the quasi-stationary distribution of a general Markov chain living on a compact…

Probability · Mathematics 2017-11-15 Michel Benaim , Bertrand Cloez , Fabien Panloup

We consider an extended birth-death-immigration process defined on a lattice formed by the integers of $d$ semiaxes joined at the origin. When the process reaches the origin, then it may jumps toward any semiaxis with the same rate. The…

Probability · Mathematics 2016-06-07 Antonio Di Crescenzo , Barbara Martinucci , Abdelaziz Rhandi

Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…

Data Structures and Algorithms · Computer Science 2013-11-05 Ryan O'Donnell , David Witmer

This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…

Probability · Mathematics 2018-01-17 Gilles Pagès , Clément Rey

We observe the continuous-time Markov Branching Process without high-order moments and allowing Immigration. Limit properties of transition functions and their convergence to invariant measures are investigated. Main mathematical tool is…

Probability · Mathematics 2020-06-18 Azam A. Imomov , Abror Kh. Meyliev

We consider the genealogical tree of a stationary continuous state branching process with immigration. For a sub-critical stable branching mechanism, we consider the genealogical tree of the extant population at some fixed time and prove…

Probability · Mathematics 2020-05-21 Romain Abraham , Jean-François Delmas , Hui He

We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and regraft (SPR) Markov chains…

Probability · Mathematics 2007-05-23 Steven N. Evans , Anita Winter

We study the long time behaviour of a Markov process evolving in $\mathbb{N}$ and conditioned not to hit 0. Assuming that the process comes back quickly from infinity, we prove that the process admits a unique quasi-stationary distribution…

Probability · Mathematics 2013-04-04 Servet Martinez , Jaime San Martin , Denis Villemonais

Continuous time random walks (CTRWs) are versatile models for anomalous diffusion processes that have found widespread application in the quantitative sciences. Their scaling limits are typically non-Markovian, and the computation of their…

Probability · Mathematics 2014-07-25 Mark M. Meerschaert , Peter Straka

We are interested in the long-time behavior of a diploid population with sexual reproduction, characterized by its genotype composition at one bi-allelic locus. The population is modeled by a 3-dimensional birth-and-death process with…

Probability · Mathematics 2013-09-16 Camille Coron

We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…

Probability · Mathematics 2011-11-02 Harry Crane