Luis Fredes

activity

20172025

most citedTree-decorated planar maps

5 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2021Show all

4 papers · 1 filter

math.PR2021★ 1 cited

Almost triangular Markov chains on $N$

Luis Fredes, Jean-Francois Marckert

A transition matrix $[U_{i, j}]_{i, j \geq 0}$ on $N$ is said to be almost upper triangular if $U_{i, j} \geq 0 \Rightarrow j \geq i - 1$ , so that the increments of the correspondi…

math.PR2021

Scaling limit of random plane quadrangulations with a simple boundary, via restriction

Jérémie Bettinelli, Nicolas Curien, Luis Fredes +1

We prove that quadrangulations with a simple boundary converge to the Brownian disk. More precisely, we fix a sequence $(p_{n})$ of even positive integers with $p_{n} \sim 2 α 2 n$ …

math.PR2021

Models of random subtrees of a graph

Luis Fredes, Jean-Francois Marckert

Consider a connected graph $G = (E, V)$ with $N = ∣ V ∣$ vertices. The main purpose of this paper is to explore the question of uniform sampling of a subtree of $G$ with $n$ nodes, for so…

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 $G$ , but it is more general: given an irreducible and reversible…

Almost triangular Markov chains on N

Scaling limit of random plane quadrangulations with a simple boundary, via restriction

Models of random subtrees of a graph

A combinatorial proof of Aldous-Broder theorem for general Markov chains

Almost triangular Markov chains on $N$