English
Related papers

Related papers: Markov processes on quasi-random graphs

200 papers

Improved rates of convergence for ergodic homogeneous Markov chains are studied. In comparison to the earlier papers the setting is also generalised to the case without a unique dominated measure. Examples are provided where the new bound…

Probability · Mathematics 2021-11-02 Alexander Veretennikov , Maria Veretennikova

In this paper, we consider statistical estimation of time-inhomogeneous aggregate Markov models. Unaggregated models, which corresponds to Markov chains, are commonly used in multi-state life insurance to model the biometric states of an…

Statistics Theory · Mathematics 2023-08-11 Jamaal Ahmad , Mogens Bladt

We develop a stochastic approximation-type algorithm to solve finite state/action, infinite-horizon, risk-aware Markov decision processes. Our algorithm has two loops. The inner loop computes the risk by solving a stochastic saddle-point…

Optimization and Control · Mathematics 2019-12-05 Wenjie Huang , William B. Haskell

The stochastic Kuramoto model defined on a sequence of graphs is analyzed: the emphasis is posed on the relationship between the mean field limit, the connectivity of the underlying graph and the long time behavior. We give an explicit…

Probability · Mathematics 2019-12-24 Fabio Coppini

Consider a sequence of Markov processes $X^1, X^2,...$ with state space $E$, where $X^N$ has a strong drift to $D \subseteq E$, such that $\Phi(X^N)$ is slow for some appropriate $\Phi: E\to D$. Using the method of martingale problems, we…

Probability · Mathematics 2026-02-19 Samuel Ayomide Adeosun , Peter Pfaffelhuber

The concept of a random process has been recently extended to graph signals, whereby random graph processes are a class of multivariate stochastic processes whose coefficients are matrices with a \textit{graph-topological} structure. The…

Signal Processing · Electrical Eng. & Systems 2020-03-13 Thiernithi Variddhisai , Danilo Mandic

Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…

Probability · Mathematics 2017-09-21 Mathew D. Penrose

We consider the convergence of a continuous-time Markov chain approximation X^h, h>0, to an R^d-valued Levy process X. The state space of X^h is an equidistant lattice and its Q-matrix is chosen to approximate the generator of X. In…

Probability · Mathematics 2014-07-02 Aleksandar Mijatović , Matija Vidmar , Saul Jacka

We study the spread of an SIRS-type epidemic with vaccination on network. Starting from an exact Markov description of the model, we investigate the mean epidemic lifetime by providing a sufficient condition for fast extinction that depends…

Dynamical Systems · Mathematics 2020-11-23 Stefania Ottaviano , Stefano Bonaccorsi

Recently there is a large amount of work devoted to the study of Markov chain stochastic gradient methods (MC-SGMs) which mainly focus on their convergence analysis for solving minimization problems. In this paper, we provide a…

Machine Learning · Statistics 2022-09-19 Puyu Wang , Yunwen Lei , Yiming Ying , Ding-Xuan Zhou

In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with…

Inhomogeneous phase-type (IPH) distributions extend classical phase-type models by allowing transition intensities to vary over time, offering greater flexibility for modeling heavy-tailed or time-dependent absorption phenomena. We focus on…

Methodology · Statistics 2025-12-19 Fernando Baltazar-Larios , Alejandra Quintos

Hidden Markov jump processes are an attractive approach for modeling clinical disease progression data because they are explainable and capable of handling both irregularly sampled and noisy data. Most applications in this context consider…

Methodology · Statistics 2019-10-15 Rui Meng , Soper Braden , Jan Nygard , Mari Nygrad , Herbert Lee

We consider a finite number of $N$ statistically equal agents, each moving on a finite set of states according to a continuous-time Markov Decision Process (MDP). Transition intensities of the agents and generated rewards depend not only on…

Probability · Mathematics 2025-09-23 Nicole Bäuerle , Sebastian Höfer

We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…

Probability · Mathematics 2019-07-29 Balazs Gerencser , Miklos Rasonyi

We observe a length-$n$ sample generated by an unknown,stationary ergodic Markov process (\emph{model}) over a finite alphabet $\mathcal{A}$. Given any string $\bf{w}$ of symbols from $\mathcal{A}$ we want estimates of the conditional…

Information Theory · Computer Science 2014-06-11 Meysam Asadi , Ramezan Paravi Torghabeh , Narayana P. Santhanam

Fluid models are a popular formalism in the quantitative modeling of biochemical systems and analytical performance models. The main idea is to approximate a large-scale Markov chain by a compact set of ordinary differential equations…

Systems and Control · Computer Science 2019-05-02 Max Tschaikowski

This paper presents a rigorous mathematical analysis, alongside simulation studies, of a spatially extended stochastic electrophysiology model, the Hodgkin-Huxley model of the squid giant axon being a classical example. Although most…

Probability · Mathematics 2025-02-05 Wai-Tong Louis Fan , Joshua A. McGinnis , Yoichiro Mori

We consider a system of $N$ particles interacting through their empirical distribution on a finite state space in continuous time. In the formal limit as $N\to\infty$, the system takes the form of a nonlinear (McKean--Vlasov) Markov chain.…

Probability · Mathematics 2025-11-13 Asaf Cohen , Ethan Huffman

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

Information Theory · Computer Science 2023-08-08 Shahar Stein Ioushua , Ofer Shayevitz