English
Related papers

Related papers: Dominating occupancy processes by the independent …

200 papers

We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…

Probability · Mathematics 2018-11-13 Liam Hodgkinson , Ross McVinish , Philip K. Pollett

In this paper we consider two related stochastic models. The first one is a branching system consisting of particles moving according to a Markov family in R^d and undergoing subcritical branching with a constant rate of V>0. New particles…

Probability · Mathematics 2012-11-27 Piotr Milos

During their lifetimes, individuals in populations pass through different states, and the notion of an occupancy time describes the amount of time an individual spends in a given set of states. Questions related to this idea were studied in…

Probability · Mathematics 2020-12-02 George Chappelle , Alan Hastings , Martin Rasmussen

A semi-Markov process is one that changes states in accordance with a Markov chain but takes a random amount of time between changes. We consider the generalisation to semi-Markov processes of the classical Lamperti law for the occupation…

Statistical Mechanics · Physics 2022-07-13 Théo Dessertaine , Claude Godrèche , Jean-Philippe Bouchaud

We present a systematic study of the statistics of the occupation time and related random variables for stochastic processes with independent intervals of time. According to the nature of the distribution of time intervals, the probability…

Statistical Mechanics · Physics 2007-05-23 C. Godreche , J. M. Luck

A stochastic process $X$ becomes occupied when it is enlarged with its occupation flow $\mathcal{O}$ that tracks the time spent by the path at each level. When $X$ is Markov, the occupied process $(\mathcal{O},X)$ enjoys a Markov structure…

Probability · Mathematics 2026-04-30 Valentin Tissot-Daguette

In a recent paper, Shah [arXiv:2502.03073] derived an explicit expression for the distribution of occupancy times for a two-state Markov chain, using a method based on enumerating sample paths. We consider here the more general problem of…

Probability · Mathematics 2025-04-01 Phil Pollett

We prove functional limits theorems for the occupation time process of a system of particles moving independently in $R^d$ according to a symmetric $\alpha$-stable L\'evy process, and starting off from an inhomogeneous Poisson point measure…

Probability · Mathematics 2012-03-14 Tomasz Bojdecki , Luis G. Gorostiza , Anna Talarczyk

This article studies the expected occupancy probabilities on an alphabet. Unlike the standard situation, where observations are assumed to be independent and identically distributed (iid), we assume that they follow a regime switching…

Probability · Mathematics 2020-05-19 Michael Grabchak , Mark Kelbert , Quentin Paris

This work focuses on Exchangeable Occupancy Models (EOM) and their relations with the Uniform Order Statistics Property (UOSP) for point processes in discrete time. As our main purpose, we show how definitions and results presented in…

Probability · Mathematics 2013-01-08 Francesca Collet , Fabrizio Leisen , Fabio Spizzichino , Florentina Suter

In the paper the rescaled occupation time fluctuation process of a certain empirical system is investigated. The system consists of particles evolving independently according to \alpha-stable motion in R^d, \alpha<d<2\alpha. The particles…

Probability · Mathematics 2011-09-02 Piotr Milos

We study the behaviour of the rightmost occupied site in two models: the Spont process and the contact process with inherited sterility, in dimension 1. Both can be viewed as contact processes evolving in dynamic random environments, where…

Probability · Mathematics 2025-10-24 Isabella Alvarenga , Aurelia Deshayes

We study the classical occupancy problem from the viewpoint of its embedding Markov chain. We derive new expressions for the probability mass function and (complementary) distribution function in generalized form. Furthermore, we derive a…

Probability · Mathematics 2023-07-06 Jim van Mechelen

We consider a class of pure jump Markov processes in $\rr^d$ whose jump kernels are comparable to those of symmetric stable processes. We prove a support theorem, a lower bound on the occupation times of sets, and show that we can…

Probability · Mathematics 2011-02-25 Brian M. Whitehead

We establish limit theorems for the fluctuations of the rescaled occupation time of a $(d,\alpha,\beta)$-branching particle system. It consists of particles moving according to a symmetric $\alpha$-stable motion in $\mathbb{R}^d$. The…

Probability · Mathematics 2008-02-04 Piotr Milos

We consider a branching system consisting of particles moving according to a Markov family in $\Rd$ and undergoing subcritical branching with a constant rate $V>0$. New particles immigrate to the system according to homogeneous space-time…

Probability · Mathematics 2009-11-04 Piotr Milos

This study of occupation time densities for continuous-time Markov processes was inspired by the work of E.Nir et al (2006) in the field of Single Molecule FRET spectroscopy. There, a single molecule fluctuates between two or more states,…

Probability · Mathematics 2008-12-10 Yevgeniy Kovchegov , Nick Meredith , Eyal Nir

A Markov process fluctuating away from its typical behavior can be represented in the long-time limit by another Markov process, called the effective or driven process, having the same stationary states as the original process conditioned…

Statistical Mechanics · Physics 2023-03-30 Florian Angeletti , Hugo Touchette

Rate processes are simple and analytically tractable models for many dynamical systems which switch stochastically between a discrete set of quasi stationary states but they may also approximate continuous processes by coarse grained,…

Statistical Mechanics · Physics 2013-03-11 R. Toenjes , H. Kori

We study a class of Markovian systems of $N$ elements taking values in $[0,1]$ that evolve in discrete time $t$ via randomized replacement rules based on the ranks of the elements. These rank-driven processes are inspired by variants of the…

Probability · Mathematics 2012-01-06 Michael Grinfeld , Philip A. Knight , Andrew R. Wade
‹ Prev 1 2 3 10 Next ›