A combinatorial representation for the invariant measure of diffusion processes on metric graphs
From MaRDI portal
Publication:5026458
zbMath1480.60083arXiv2002.00654MaRDI QIDQ5026458
Davide Gabrielli, Michele Aleandri, Matteo Colangeli
Publication date: 8 February 2022
Full work available at URL: https://arxiv.org/abs/2002.00654
Stationary stochastic processes (60G10) Combinatorial probability (60C05) Diffusion processes (60J60)
Related Items (2)
Drazin-inverse and heat capacity for driven random walkers on the ring ⋮ Trees and forests for nonequilibrium purposes: an introduction to graphical representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic methods. A handbook for the natural and social sciences
- Diffusion processes on graphs and the averaging principle
- Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
- Fick and Fokker-Planck diffusion law in inhomogeneous media
- A proof of the Markov chain tree theorem
- Diffusion processes on graphs: Stochastic differential equations, large deviation principle
- A comparison among various notions of viscosity solution for Hamilton-Jacobi equations on networks
- A representation formula for large deviations rate functionals of invariant measures on the one dimensional torus
- Semigroup methods for evolution equations on networks
- Stochastic flows on metric graphs
- Brownian motions on metric graphs
- A meaningful expansion around detailed balance
- Fokker–Planck–Kolmogorov Equations
- Markov Chains
- Random perturbations of Hamiltonian systems
- Analysis and Geometry of Markov Diffusion Operators
- Stochastic Processes and Applications
- Quantum Graphs and Their Applications
- Harmonic functions of Brownian motions on metric graphs
This page was built for publication: A combinatorial representation for the invariant measure of diffusion processes on metric graphs