Related papers: Local Limit of Random Regular Bipartite Planar Map…

Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…

We reduce the local limit theorem for a non-compact semisimple Lie group acting on its symmetric space to establishing that a natural operator associated to the measure is quasicompact. Under strong Diophantine assumptions on the underlying…

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

We study limit theorems in the context of random perturbations of dispersing billiards in finite and infinite measure. In the context of a planar periodic Lorentz gas with finite horizon, we consider random perturbations in the form of…

We study a random walk in a random environment (RWRE) on $\Z^d$, $1 \leq d < +\infty$. The main assumptions are that conditionned on the environment the random walk is reversible. Moreover we construct our environment in such a way that the…

We consider a random walk $(Y_N)_{N\geq 0}$ on $\mathbb{R}^2$ generated by successively applying independent random isometries, drawn from a fixed measure $\mu$, to the point $0$. When the support of $\mu$ is finite and includes an…

This paper provides uniform bounds on the asymptotic regularity for iterations associated to a finite family of nonexpansive mappings. We obtain our quantitative results in the setting of $(r,\delta)$-convex spaces, a class of geodesic…

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…

Let $G$ be a connected graph in which almost all vertices have linear degrees and let $T$ be a uniform spanning tree of $G$. For any fixed rooted tree $F$ of height $r$ we compute the asymptotic density of vertices $v$ for which the…

We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set…

We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence…

We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…

Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

We study the local asymptotic behavior of divergence-like functionals of a family of $d$-dimensional Infinitely Divisible Random Fields. Specifically, we derive limit theorems of surface integrals over Lipschitz manifolds for this class of…

Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…

We show that given $n$ normalized intervals on the unit circle, the numbers of visits of $d$ random rotations to these intervals have a joint limiting distribution as lengths of trajectories tend to infinity. If $d$ then tends to infinity,…