A proof of the transfer-current theorem in absence of reversibility

DOI10.1016/j.spl.2018.06.007zbMath1405.05169OpenAlexW2809891713WikidataQ129614596 ScholiaQ129614596MaRDI QIDQ1726699

Luca Avena, Alexandre Gaudillière

Publication date: 20 February 2019

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2018.06.007

zbMATH Keywords

determinantal processesfinite networksuniform spanning treespanning foreststransfer current theorem

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)

Related Items (1)

Loop-erased partitioning of a graph: mean-field analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
• Spanning forests and the vector bundle Laplacian
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Transfer current and pattern fields in spanning trees
• Determinantal processes and independence
• Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
• Uniform spanning forests
• Determinants of Laplacians on graphs

This page was built for publication: A proof of the transfer-current theorem in absence of reversibility