On ergodic diffusions on continuous graphs whose centered resolvent admits a trace
From MaRDI portal
Recommendations
- Existence condition of strong stationary times for continuous time Markov chains on discrete graphs
- The eigentime identity for continuous-time ergodic Markov chains
- Diffusion processes on graphs: Stochastic differential equations, large deviation principle
- Random walks on graphs with a strong isoperimetric property
- Diffusion determines the recurrent graph
Cites work
- scientific article; zbMATH DE number 1245556 (Why is no real title available?)
- scientific article; zbMATH DE number 2234993 (Why is no real title available?)
- Brownian motion on \(\mathbb R\)-trees
- Diffusion processes on graphs and the averaging principle
- Diffusion processes on graphs: Stochastic differential equations, large deviation principle
- Dirichlet forms and symmetric Markov processes
- Eigentime identity for one-dimensional diffusion processes
- Introduction to quantum graphs
- Reversibility and stochastic networks. With a new preface
- The eigentime identity for continuous-time ergodic Markov chains
Cited in
(7)- Estimates on the amplitude of the first Dirichlet eigenvector in discrete frameworks
- Hitting time and mixing time bounds of Stein's factors
- A combinatorial representation for the invariant measure of diffusion processes on metric graphs
- On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival
- Bernstein-gamma functions and exponential functionals of Lévy processes
- Existence condition of strong stationary times for continuous time Markov chains on discrete graphs
- On resistance distance of Markov chain and its sum rules
This page was built for publication: On ergodic diffusions on continuous graphs whose centered resolvent admits a trace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964402)
