J. Marckert

activity

20042025

most citedLimit of normalized quadrangulations: The Brownian map

87 citations · 167 across the 33 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.CO2021

Growing random uniform d-ary trees

Jean-Francois Marckert

Let T d (n) be the set of d-ary rooted trees with n internal nodes. We give a method to construct a sequence (t n , n $\geq$ 0) where, for any n $\geq$ 1, t n has the uniform distrib…

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

Growing random uniform d-ary trees

Models of random subtrees of a graph

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

Almost triangular Markov chains on $N$