Averaging for some simple constrained Markov processes
From MaRDI portal
Abstract: In this paper, a class of piecewise deterministic Markov processes with underlying fast dynamic is studied. Using a "penalty method" , an averaging result is obtained when the underlying dynamic is infinitely accelerated. The features of the averaged process, which is still a piecewise deterministic Markov process, are fully described.
Recommendations
Cites work
- scientific article; zbMATH DE number 425394 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A review of the integrate-and-fire neuron model: I. Homogeneous synaptic input
- Multiscale Methods
- Random time changes and convergence in distribution under the Meyer-Zheng conditions
- Viscosity methods giving uniqueness for martingale problems
Cited in
(11)- Probabilistic and piecewise deterministic models in biology
- Averaging for a Fully Coupled Piecewise-Deterministic Markov Process in Infinite Dimensions
- Piecewise linear process with renewal starting points
- Averaging for slow–fast piecewise deterministic Markov processes with an attractive boundary
- Analysis of averages over distributions of Markov processes
- Averaging of semigroups associated to diffusion processes on a simplex
- Averaging principles for Markovian models of plasticity
- Simplified descripton of slow-in-the-average Markov walks
- Ornstein-Uhlenbeck processes of bounded variation
- Convergence of population processes with small and frequent mutations to the canonical equation of adaptive dynamics
- Averaging along a Markov chain
This page was built for publication: Averaging for some simple constrained Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227573)