Luis Fredes

activity

20172025

most citedTree-decorated planar maps

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

collaborators

10 papers

math.PR2025

A combinatorial perspective on the Kemeny constant and more

Luis Fredes, Jean-François Marckert

Let $M$ be an irreducible transition matrix on a finite state space $V$ . For a Markov chain $C = (C_{k}, k \geq 0)$ with transition matrix $M$ , let $τ_{u}^{\geq 1}$ denote the first positi…

math.PR2025

Characterisation of Markov property on planar maps

Pablo Araya, Luis Fredes, Avelio Sepúlveda

We revisit, in a self contained way, the Markov property on planar maps and decorated planar maps from three perspectives. First, we characterize the laws on these planar maps that…

math.PR2024

Markov chains on trees: almost lower and upper directed cases

Luis Fredes, Jean-François Marckert

The transition matrix of a Markov chain $(X_{k}, k \geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_{k}$ , the node $X_{k + 1}$ is either a desc…

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…

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…

math.PR2018

Coexistence for a population model with forest fire epidemics

Luis Fredes, Amitai Linker, Daniel Remenik

We investigate the effect on survival and coexistence of introducing forest fire epidemics to a certain two-species competition model. The model is an extension of the one introduc…

math.PR2017

Invariant measures of discrete interacting particle systems: Algebraic aspects

Luis Fredes, Jean-François Marckert

Consider a continuous time particle system $η^{t} = (η^{t} (k), k \in L)$ , indexed by a lattice $L$ which will be either $Z$ , $Z / n Z$ , a segment…

A combinatorial perspective on the Kemeny constant and more

Characterisation of Markov property on planar maps

Markov chains on trees: almost lower and upper directed cases

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

Tree-decorated planar maps

Coexistence for a population model with forest fire epidemics

Invariant measures of discrete interacting particle systems: Algebraic aspects

Almost triangular Markov chains on $N$