Related papers: Triangulating stable laminations
We study how quantum states are scrambled via braiding in systems of non-Abelian anyons through the lens of entanglement spectrum statistics. In particular, we focus on the degree of scrambling, defined as the randomness produced by…
Starting with a collection of $n$ oriented polygonal discs, with an even number $N$ of sides in total, we generate a random oriented surface by randomly matching the sides of discs and properly gluing them together. Encoding the surface in…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
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…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
Spatially homogeneous random tessellations that are stable under iteration (nesting) in the 3-dimensional Euclidean space are considered, so-called STIT tessellations. They arise as outcome of a spatio-temporal process of subsequent cell…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
We prove endpoint and sparse-like bounds for Bergman projectors on nonhomogeneous, radial trees $X$ that model manifolds with possibly unbounded geometry. The natural Bergman measures on $X$ may fail to be doubling, and even locally…
We study stochastic billiards in infinite planar domains with curvilinear boundaries: that is, piecewise deterministic motion with randomness introduced via random reflections at the domain boundary. Physical motivation for the process…
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…
We derive distributional approximations for the number of triangles in the linear preferential attachment model $\mathrm{PAM}(m,\delta)$, where $m\ge 2$ and $\delta>-m$, with explicit rates of convergence. The limiting distribution…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
We consider scaling limits of random quadrangulations obtained by applying the Cori-Vauquelin-Schaeffer bijection to Bienaym\'e-Galton-Watson trees with stably-decaying offspring tails with an exponent $\alpha$ in (1, 2). We show that these…
We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
In the laminar-constrained spanning tree problem, the goal is to find a minimum-cost spanning tree which respects upper bounds on the number of times each cut in a given laminar family is crossed. This generalizes the well-studied…
For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…