English
Related papers

Related papers: Semimartingale dynamics and estimation for a semi-…

200 papers

In this paper, we study quasi-stationary distributions of nonlinearly perturbed semi-Markov processes in discrete time. This type of distributions is of interest for the analysis of stochastic systems which have finite lifetimes, but are…

Probability · Mathematics 2016-04-28 Mikael Petersson

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 consider a discrete time semi-Markov process where the characteristics defining the process depend on a small perturbation parameter. It is assumed that the state space consists of one finite communicating class of states and, in…

Probability · Mathematics 2016-03-21 Mikael Petersson

We consider a class of semi-Markov processes (SMP) such that the embedded discrete time Markov chain may be non-homogeneous. The corresponding augmented processes are represented as semi-martingales using stochastic integral equation…

Probability · Mathematics 2022-07-14 Anindya Goswami , Subhamay Saha , Ravishankar Kapildev Yadav

We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…

Probability · Mathematics 2014-12-04 Shaun McKinlay , Konstantin Borovkov

General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic…

Probability · Mathematics 2013-01-08 Yong-Hua Mao , Yan-Hong Song

In the last years, many authors studied a class of continuous time semi-Markov processes obtained by time-changing Markov processes by hitting times of independent subordinators. Such processes are governed by integro-differential…

Probability · Mathematics 2020-02-24 Angelica Pachon , Federico Polito , Costantino Ricciuti

In this paper we propose a model for open Markov chains that can be interpreted as a system of non-interacting particles evolving according to the rules of a Markov chain. The number of particles in the system is not constant, because we…

Probability · Mathematics 2019-01-23 R. Salgado-Garcia

In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The…

Probability · Mathematics 2015-05-28 Marco Raberto , Fabio Rapallo , Enrico Scalas

We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…

Probability · Mathematics 2025-08-19 Nils Berglund

In this paper, we extend the results of Elliott and Yang \cite{elliott3} and discuss the control of a stochastic process for which the driving noise is provided by a martingale associated with a semi-Markov Chain. An existence and a…

Probability · Mathematics 2025-12-23 Robert J. Elliott , Zhe Yang

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 consider the discrete-time filtering problem in scenarios where the observation noise is degenerate or low. More precisely, one is given access to a discrete time observation sequence which at any time $k$ depends only on the state of an…

Computation · Statistics 2025-11-17 Abylay Zhumekenov , Alexandros Beskos , Dan Crisan , Ajay Jasra , Nikolas Kantas

We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However,…

Probability · Mathematics 2016-03-08 Paolo Dai Pra , Pierre-Yves Louis , Ida Minelli

Extensions of Kemeny's constant, as derived for irreducible finite Markov chains in discrete time, to Markov renewal processes and Markov chains in continuous time are discussed. Three alternative Kemeny's functions and their variants are…

Probability · Mathematics 2018-09-17 Jeffrey J Hunter

This work studies remote state estimation of multiple linear time-invariant systems over shared wireless time-varying communication channels. We model the channel states by a semi-Markov process which captures both the random holding period…

Systems and Control · Electrical Eng. & Systems 2024-10-28 Wanchun Liu , Daniel E. Quevedo , Branka Vucetic , Yonghui Li

Semi-Markov processes play an important role in the effective description of partially accessible systems in stochastic thermodynamics. They occur, for instance, in coarse-graining procedures such as state lumping and when analyzing waiting…

Statistical Mechanics · Physics 2026-01-19 Alexander M. Maier , Jonas H. Fritz , Udo Seifert

The literature on Bayesian methods for the analysis of discrete-time semi-Markov processes is sparse. In this paper, we introduce the semi-Markov beta-Stacy process, a stochastic process useful for the Bayesian non-parametric analysis of…

Statistics Theory · Mathematics 2020-07-24 Andrea Arfè , Stefano Peluso , Pietro Muliere

We study the existence of densities for distributions of piecewise deterministic Markov processes. We also obtain relationships between invariant densities of the continuous time process and that of the process observed at jump times. In…

Probability · Mathematics 2020-06-03 Piotr Gwiżdż , Marta Tyran-Kamińska

Motivated by techniques developed in recent progress on lower bounds for sublinear time algorithms (Behnezhad, Roghani and Rubinstein, STOC 2023, FOCS 2023, and STOC 2024) we introduce and study a new class of randomized algorithmic…

Data Structures and Algorithms · Computer Science 2026-03-19 Amir Azarmehr , Soheil Behnezhad , Alma Ghafari , Madhu Sudan
‹ Prev 1 2 3 10 Next ›