Random forests and networks analysis

DOI10.1007/s10955-018-2124-8zbMath1402.05195arXiv1711.01635OpenAlexW3098966048MaRDI QIDQ1756552

Clothilde Mélot, Fabienne Castell, Luca Avena, Alexandre Gaudillière

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01635

zbMATH Keywords

waveletsmultiresolution analysisMarkov processintertwininggraph signal processingrandom spanning forests

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Related Items (7)

Approximation theorems on graphs ⋮ Loop-erased partitioning of a graph: mean-field analysis ⋮ On the construction of measure-valued dual processes ⋮ Metastable Markov chains ⋮ A numerical study of multi-parameter full waveform inversion with iterative regularization using multi-frequency vibroseis data ⋮ Stochastic processes under constraints. Abstracts from the workshop held September 27 -- October 3, 2020 (hybrid meeting) ⋮ Intertwining wavelets or multiresolution analysis on graphs through random forests

Uses Software

• GSPBOX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metastable states, quasi-stationary distributions and soft measures
• Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
• Some properties of the Wishart processes and a matrix extension of the Hartman-Watson laws
• 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
• Strong stationary times via a new form of duality
• Shuffling algorithm for boxed plane partitions
• Wulff droplets and the metastable relaxation of kinetic Ising models
• Beta-gamma random variables and intertwining relations between certain Markov processes
• Two applications of random spanning forests
• A proof of the Markov chain tree theorem
• Uniform spanning forests
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Determinants of Laplacians on graphs
• Dyson's Brownian motions, intertwining and interlacing
• Renormalization group for Markov chains and application to metastability
• Approaching criticality via the zero dissipation limit in the abelian avalanche model
• Probability on Trees and Networks
• On absorption times and Dirichlet eigenvalues
• Ten Lectures on Wavelets
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• An analogue of Pitman’s 2M – X theorem for exponential Wiener functionals: Part I: A time-inversion approach
• A Multiscale Pyramid Transform for Graph Signals
• The Random-Cluster Model
• Metastability
• Markov functions

This page was built for publication: Random forests and networks analysis