English
Related papers

Related papers: Approximation of the birth process

200 papers

A birth-death process is a continuous-time Markov chain that counts the number of particles in a system over time. In the general process with $n$ current particles, a new particle is born with instantaneous rate $\lambda_n$ and a particle…

Populations and Evolution · Quantitative Biology 2012-10-11 Forrest W. Crawford , Marc A. Suchard

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…

Populations and Evolution · Quantitative Biology 2016-06-14 Tobias Galla

In tracking multiple objects, it is often assumed that each observation (measurement) is originated from one and only one object. However, we may encounter a situation that each measurement may or may not be associated with multiple objects…

Machine Learning · Computer Science 2021-12-14 Bahman Moraffah

Donsker Theorem is perhaps the most famous invariance principle result for Markov processes. It states that when properly normalized, a random walk behaves asymptotically like a Brownian motion. This approach can be extended to general…

Probability · Mathematics 2020-05-29 Eustache Besançon , E Besanç On , Laurent Decreusefond , Pascal Moyal

We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice…

Probability · Mathematics 2024-04-16 Rami Atar , Gershon Wolansky

The Poisson process is the most elementary continuous-time stochastic process that models a stream of repeating events. It is uniquely characterised by a single parameter called the rate. Instead of a single value for this rate, we here…

Probability · Mathematics 2019-06-05 Alexander Erreygers , Jasper De Bock

In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…

Performance · Computer Science 2015-12-21 Daniel Marian Merezeanu , Daniela Andone

Consideration is given to the three different analytical methods for the computation of upper bounds for the rate of convergence to the limiting regime of one specific class of (in)homogeneous continuous-time Markov chains. This class is…

We give a general Gaussian bound for the first chaos (or innovation) of point processes with stochastic intensity constructed by embedding in a bivariate Poisson process. We apply the general result to nonlinear Hawkes processes, providing…

Probability · Mathematics 2016-09-29 Giovanni Luca Torrisi

The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…

Probability · Mathematics 2022-01-04 Céline Comte

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

In this note we consider a Markov chain formed by a finite system of interacting birth-and-death processes on a finite state space. We study an asymptotic behaviour of the Markov chain as its state space becomes large. In particular, we…

Probability · Mathematics 2016-11-14 Vadim Shcherbakov , Anatoly Yambartsev

For integer valued random variables, the translated Poisson distributions form a flexible family for approximation in total variation, in much the same way that the normal family is used for approximation in Kolmogorov distance. Using the…

Probability · Mathematics 2016-12-26 A. D. Barbour , Malwina J. Luczak , Aihua Xia

Demand for studying queueing systems with multiple servers providing correlated services was created about 60 years ago, motivated by various applications. In recent years, the importance of such studies has been significantly increased,…

Probability · Mathematics 2026-04-16 Suman Thapa , Yiqiang Q. Zhao

In this paper we prove the Poisson Hypothesis for the limiting behavior of the large queueing systems in some simple ("mean-field") cases. We show in particular that the corresponding dynamical systems, defined by the non-linear Markov…

Mathematical Physics · Physics 2007-05-23 Alexander Rybko , Senya Shlosman

Controlled branching processes are stochastic growth population models in which the number of individuals with reproductive capacity in each generation is controlled by a random control function. The purpose of this work is to examine the…

Methodology · Statistics 2019-07-03 M. González , R. Martínez , C. Minuesa , I. del Puerto

Reservoir computing systems, a class of recurrent neural networks, have recently been exploited for model-free, data-based prediction of the state evolution of a variety of chaotic dynamical systems. The prediction horizon demonstrated has…

Machine Learning · Computer Science 2020-04-06 Huawei Fan , Junjie Jiang , Chun Zhang , Xingang Wang , Ying-Cheng Lai

Forecasting costs is now a front burner in empirical economics. We propose an unconventional tool for stochastic prediction of future expenses based on the individual (micro) developments of recorded events. Consider a firm, enterprise,…

Econometrics · Economics 2019-09-20 Matúš Maciak , Ostap Okhrin , Michal Pešta

Changing time of simple continuous-time Markov counting processes by independent unit-rate Poisson processes results in Markov counting processes for which we provide closed-form transition rates via composition of trajectories and with…

Probability · Mathematics 2014-03-25 Carles Bretó

Bayesian analysis for Markov jump processes is a non-trivial and challenging problem. Although exact inference is theoretically possible, it is computationally demanding thus its applicability is limited to a small class of problems. In…

Computation · Statistics 2017-02-08 Vassilios Stathopoulos , Mark A. Girolami