Markov loops, free field and Eulerian networks
From MaRDI portal
Publication:904203
DOI10.2969/jmsj/06741671zbMath1337.60245OpenAlexW2202768476MaRDI QIDQ904203
Publication date: 12 January 2016
Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jmsj/1445951161
Markov processeshomologyrandom spanning treesfree fieldsPoissonian loop ensembleloop soupsrandom Eulerian networks
Random fields (60G60) Gaussian processes (60G15) Continuous-time Markov processes on general state spaces (60J25) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Local time and additive functionals (60J55)
Related Items
Cluster capacity functionals and isomorphism theorems for Gaussian free fields ⋮ A note on \(\alpha\)-permanent and loop soup ⋮ Central limit theorems for non-symmetric random walks on nilpotent covering graphs. I ⋮ An elementary proof of phase transition in the planar XY model ⋮ Random Flows Defined by Markov Loops ⋮ Non-backtracking loop soups and statistical mechanics on spin networks ⋮ Markov loops, coverings and fields ⋮ On discrete loop signatures and Markov loops topology ⋮ On Markovian random networks ⋮ Inverting the coupling of the signed Gaussian free field with a loop-soup ⋮ Brownian loops topology
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Phase transition in loop percolation
- Loop percolation on discrete half-plane
- Markovian loop clusters on graphs
- Topics in occupation times and Gaussian free fields
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- From loop clusters and random interlacements to the free field
- Markov loops and renormalization
- The Brownian loop soup
- A Ray-Knight theorem for symmetric Markov processes.
- Jacobian tori associated with a finite graph and its abelian covering graphs
- Markov loops in discrete spaces