Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Fredes, Luis"'
Stochastic optimization naturally appear in many application areas, including machine learning. Our goal is to go further in the analysis of the Stochastic Average Gradient Accelerated (SAGA) algorithm. To achieve this, we introduce a new $\lambda$-S
Externí odkaz:
http://arxiv.org/abs/2410.03760
The aim of this paper is to improve the large deviation principle for the number of descents in a random permutation by establishing a sharp large deviation principle of any order. We shall also prove a sharp large deviation principle of any order fo
Externí odkaz:
http://arxiv.org/abs/2407.05708
Chatteerjee and Diaconis have recently shown the asymptotic normality for the joint distribution of the number of descents and inverse descents in a random permutation. A noteworthy point of their results is that the asymptotic variance of the normal
Externí odkaz:
http://arxiv.org/abs/2405.13439
Autor:
Fredes, Luis, Sepúlveda, Avelio
The (non-spanning) tree-decorated quadrangulation is a random pair formed by a quadrangulation and a subtree chosen uniformly over the set of pairs with prescribed size. In this paper we study the tree-decorated quadrangulation in the critical regime
Externí odkaz:
http://arxiv.org/abs/2309.05540
Autor:
Fredes, Luis, Marckert, Jean-Francois
A transition matrix $[U_{i,j}]_{i,j\geq 0}$ on $\mathbb{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 corresponding Markov chains are at least $-1$; a transition matrix $[L_{i,j}]_{i,
Externí odkaz:
http://arxiv.org/abs/2109.06549
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\alpha \sqrt{2n}$ for some $\alpha\in(0,\infty)$. Then, for the Gromov--Hausdorff
Externí odkaz:
http://arxiv.org/abs/2104.12716
Autor:
Fredes, Luis, Marckert, Jean-Francois
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 some $n\leq N$ (the spanning tree case correspond to $n=N$, and is alrea
Externí odkaz:
http://arxiv.org/abs/2102.12738
Autor:
Fredes, Luis, Marckert, Jean-François
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 Markov chain $M$ on $G$ started at $r$, the tree rooted at $r$ formed
Externí odkaz:
http://arxiv.org/abs/2102.08639
Autor:
Fredes, Luis, Sepúlveda, Avelio
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 a simple boundary. As a consequence, we count the number of tree decor
Externí odkaz:
http://arxiv.org/abs/1901.04981
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 introduced by Durrett and Remenik [DR09], who studied a discrete time particle
Externí odkaz:
http://arxiv.org/abs/1811.12468