English
Related papers

Related papers: Quasi-processes for branching Markov chains

200 papers

This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a…

Logic in Computer Science · Computer Science 2025-02-11 Rob van Glabbeek , Jan Friso Groote , Erik de Vink

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

Lamperti's maximal branching process is revisited, with emphasis on the description of the shape of the invariant measures in both the recurrent and transient regimes. A truncated version of this chain is exhibited, preserving the…

Probability · Mathematics 2019-11-19 Thierry Huillet , Servet Martinez

The aim of this paper is to study the large population limit of a binary branching particle system with Moran type interactions: we introduce a new model where particles evolve, reproduce and die independently and, with a probability that…

Probability · Mathematics 2024-04-12 Alexander M. G. Cox , Emma Horton , Denis Villemonais

We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…

Probability · Mathematics 2018-09-03 Sophie Lemaire

A rescaled Markov chain converges uniformly in probability to the solution of an ordinary differential equation, under carefully specified assumptions. The presentation is much simpler than those in the outside literature. The result may be…

Probability · Mathematics 2007-05-23 R. W. R. Darling

We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…

Probability · Mathematics 2023-12-19 E. Filichkina , E. Yarovaya

Conditions on the generator of a Markov process to control the fluctuations of its bridges are found. In particular, continuous time random walks on graphs and gradient diffusions are considered. Under these conditions, a concentration of…

Probability · Mathematics 2016-03-08 Giovanni Conforti

We introduce a Poissonization method to study the coalescent structure of uniform samples from branching processes. This method relies on the simple observation that a uniform sample of size $k$ taken from a random set with positive…

Probability · Mathematics 2021-06-24 Samuel G. G. Johnston , Amaury Lambert

Stochastic branching processes are a classical model for describing random trees, which have applications in numerous fields including biology, physics, and natural language processing. In particular, they have recently been proposed to…

Logic in Computer Science · Computer Science 2012-06-07 Taolue Chen , Klaus Dräger , Stefan Kiefer

Continuous-time Markov chains describing interacting processes exhibit a state space that grows exponentially in the number of processes. This state-space explosion renders the computation or storage of the time-marginal distribution, which…

Numerical Analysis · Mathematics 2020-06-16 Peter Georg , Lars Grasedyck , Maren Klever , Rudolf Schill , Rainer Spang , Tilo Wettig

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

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

The paper studies a probabilistic notion of causes in Markov chains that relies on the counterfactuality principle and the probability-raising property. This notion is motivated by the use of causes for monitoring purposes where the aim is…

Logic in Computer Science · Computer Science 2021-07-09 Christel Baier , Florian Funke , Simon Jantsch , Jakob Piribauer , Robin Ziemek

We introduce a model for synchronizer of marked pairs, which is a node for joining results of parallel processing in two-branch fork-join queueing network. A distribution for number of jobs in the synchronizer is obtained. Calculations are…

Discrete Mathematics · Computer Science 2008-01-15 S. V. Vyshenski , P. V. Grigoriev , Yu. Yu. Dubenskaya

Data on count processes arise in a variety of applications, including longitudinal, spatial and imaging studies measuring count responses. The literature on statistical models for dependent count data is dominated by models built from…

Methodology · Statistics 2013-10-08 Antonio Canale , David B. Dunson

In this paper, we study darning of general symmetric Markov processes by shorting some parts of the state space into singletons. A natural way to construct such processes is via Dirichlet forms restricted to the function space whose members…

Probability · Mathematics 2017-02-08 Zhen-Qing Chen , Jun Peng

Consider a branching Markov process, $X = (X(t), t \ge 0)$, with non-local branching mechanism. Studying the asymptotic behaviour of the moments of X has recently received attention in the literature [6, 7] due to the importance of these…

Probability · Mathematics 2025-02-03 Christopher B. C. Dean , Emma Horton

We develop a new methodology for the fluctuation theory of continuous-time skip-free Markov chains, extending the recent work of Choi and Patie [5] for discrete-time skip-free Markov chains. As the main application we use it to derive a…

Probability · Mathematics 2022-08-31 R. Loeffen , P. Patie , J. Wang

Consider a one-sided Markov additive process with an upper and a lower barrier, where each can be either reflecting or terminating. For both defective and non-defective processes and all possible scenarios we identify the corresponding…

Probability · Mathematics 2013-09-20 Jevgenijs Ivanovs