Criteria for classifying general Markov chains
From MaRDI portal
Publication:4134631
Cited in
(58)- A dynamic count process
- On the existence of stationary threshold bilinear processes
- On the ergodicity of a class of level-dependent quasi-birth-and-death processes
- The fluid limit of a random graph model for a shared ledger
- A class of measure-valued Markov chains and Bayesian nonparametrics
- Stable adaptive control for a plant with randomly varying parameters
- Single-server queues with spatially distributed arrivals
- Stability of token passing rings
- Drift analysis and average time complexity of evolutionary algorithms
- SUR UN MODÉLE AUTORÉGRESSIF NON LINÉAIRE, ERGODICITÉ ET ERGODICITÉ GÉOMÉTRIQUE
- The ergodicity of a class of reversible reaction-diffusion processes
- Polling on a space with general arrival and service time distribution
- Single‐Index Additive Vector Autoregressive Time Series Models
- A stochastic model for the circulation of restorable materials
- Numerical calculation of the stationary distribution of a Markov chain in genetics
- On the ergodicity of general mixture of linear autoregressive time series
- Drift conditions and invariant measures for Markov chains.
- Recurrence conditions for Markov decision processes with Borel state space: A survey
- On the ergodic decomposition for a class of Markov chains
- A SINGLE CHANNEL ON/OFF MODEL WITH TCP-LIKE CONTROL
- On the Ergodicity of First‐Order Threshold Autoregressive Moving‐Average Processes
- Asymptotic spectral theory for nonlinear time series
- Another set of conditions for average optimality in Markov control processes
- scientific article; zbMATH DE number 3555146 (Why is no real title available?)
- Thresholds and initial growth rates in a model of parasitic infection
- On the stability of crystal growth.
- Population models with environmental stochasticity
- Stability of multi-dimensional birth-and-death processes with state-dependent 0-homogeneous jumps
- On random walks arising in queueing systems: Ergodicity and transience via quadratic forms as Lyapounov functions. I
- Hitting times of Markov chains, with application to state-dependent queues
- First-passage times in skip-free processes
- Topological conditions enabling use of Harris methods in discrete and continuous time
- Perturbations of countable Markov chains and processes
- On geometric ergodicity of the MTAR process
- The stability of open queueing networks
- Notes on 1-recurrent Markov chains
- Geometric ergodicity of Harris recurrent Markov chains with applications to renewal theory
- Functional characterization for average cost Markov decision processes with Doeblin's conditions
- Estimates of the tail of the stationary density function of certain nonlinear autoregressive processes
- Generalized exponential autoregressive models for nonlinear time series: stationarity, estimation and applications
- Recurrence relations for generalized hitting times for semi-Markov processes
- Sample and moment lyapunov exponents of discrete linear dynamical systems
- Null recurrent unit root processes
- On a partly linear autoregressive model with moving average errors
- GEOMETRIC ERGODICITY OF A DOUBLY STOCHASTIC TIME SERIES MODEL
- A sufficient condition for the existence of an invariant probability measure for Markov processes
- RANDOM DYNAMICAL SYSTEMS ON ORDERED TOPOLOGICAL SPACES
- Stationary states and their stability of the stepping stone model involving mutation and selection
- The expected degree distribution in transient duplication divergence models
- Nonzero-sum stochastic games with unbounded costs: Discounted and average cost cases
- T. E. Harris's contributions to recurrent Markov processes and stochastic flows
- Ergodicity conditions for nonlinear discrete time stochastic dynamical systems with Markovian noise
- Strict stationarity of ar(p) processes generated by nonlinear random functions with additive perturbations
- STABILITY IN QUEUES WITH IMPATIENT CUSTOMERS
- The tail of the stationary distribution of an autoregressive process with \(\text{ARCH}(1)\) errors
- Regenerative structure of Markov chains simulated via common random numbers
- Drift criteria for persistence of discrete stochastic processes on the line
- Zero-sum stochastic games with unbounded costs: Discounted and average cost cases
This page was built for publication: Criteria for classifying general Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134631)