5 citations · 6 across the 9 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
A combinatorial proof of Aldous-Broder theorem for general Markov chains
Luis Fredes, Jean-François Marckert
Aldous-Broder algorithm is a famous algorithm used to sample a uniform spanning tree of any finite connected graph , but it is more general: given an irreducible and reversible…
math.CO2019★ 5 cited
Tree-decorated planar maps
Luis Fredes, Avelio Sepúlveda
We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with…