English
Related papers

Related papers: On scaling limits of random Halin-like maps

200 papers

We consider consistent dynamics for non-intersecting birth and death chains, originating from dualities of stochastic coalescing flows and one dimensional orthogonal polynomials. As corollaries, we obtain unified and simple probabilistic…

Probability · Mathematics 2019-02-15 Theodoros Assiotis

We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…

Combinatorics · Mathematics 2008-03-07 J. Bouttier , P. Di Francesco , E. Guitter

Halin conjectured that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. This has recently been proven by the second author. In this paper, we strengthen this result by establishing the…

Combinatorics · Mathematics 2025-10-07 Nicola Lorenz , Max Pitz

The infinite discrete stable Boltzmann maps are "heavy-tailed" generalisations of the well-known Uniform Infinite Planar Quadrangulation. Very efficient tools to study these objects are Markovian step-by-step explorations of the lattice…

Probability · Mathematics 2021-03-26 Nicolas Curien , Cyril Marzouk

We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy's formula for the limit under scaling of various crossing probabilities are…

Probability · Mathematics 2007-05-23 Omer Angel

We identify the scaling limit of full-plane Kadanoff-Ceva fermions on generic, non-degenerate $s$-embeddings. In this broad setting, the scaling limits are described in terms of solutions to conjugate Beltrami equations with prescribed…

Probability · Mathematics 2025-12-24 Rémy Mahfouf

Recursive decision trees are widely used to estimate heterogeneous causal treatment effects in experimental and observational studies. These methods are typically implemented using CART-type recursive partitioning and are often viewed as…

Statistics Theory · Mathematics 2026-03-19 Matias D. Cattaneo , Jason M. Klusowski , Ruiqi Rae Yu

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…

Combinatorics · Mathematics 2022-06-06 Kristopher Tapp

Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…

Probability · Mathematics 2025-04-16 Jean Bertoin , Nicolas Curien , Armand Riera

Individual resource intake rates are known to depend on both individual body size and resource availability. Here, we have developed a model to integrate these two drivers, accounting explicitly for the scaling of perceived resource…

Populations and Evolution · Quantitative Biology 2010-02-18 Alberto Basset , Francesco Paparella , Francesco Cozzoli

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

Restricted Boltzmann Machines (RBMs) and models derived from them have been successfully used as basic building blocks in deep artificial neural networks for automatic features extraction, unsupervised weights initialization, but also as…

Neural and Evolutionary Computing · Computer Science 2016-07-20 Decebal Constantin Mocanu , Elena Mocanu , Phuong H. Nguyen , Madeleine Gibescu , Antonio Liotta

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

Combinatorics · Mathematics 2026-03-24 Eitan Levin , Venkat Chandrasekaran

We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…

Probability · Mathematics 2026-03-25 Siarhei Finski

We establish some scaling limits for a model of planar aggregation. The model is described by the composition of a sequence of independent and identically distributed random conformal maps, each corresponding to the addition of one…

Probability · Mathematics 2013-09-24 James Norris , Amanda Turner

For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…

Probability · Mathematics 2025-04-18 Riddhipratim Basu , Manan Bhatia

We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…

Probability · Mathematics 2020-03-12 Ewain Gwynne , Nina Holden , Xin Sun

The universal scaling law of cortical morphology describes cortical folding as the covariance of average grey matter thickness, pial surface area, and exposed surface area. It applies for mammalian species, humans, and across lobes, however…

Neurons and Cognition · Quantitative Biology 2021-03-29 Karoline Leiberg , Christoforos Papasavvas , Yujiang Wang

Hopfield networks (HNs) and Restricted Boltzmann Machines (RBMs) are two important models at the interface of statistical physics, machine learning, and neuroscience. Recently, there has been interest in the relationship between HNs and…

Machine Learning · Computer Science 2021-03-09 Matthew Smart , Anton Zilman

We consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in cutting the O(n) model configurations along their…

Mathematical Physics · Physics 2011-12-30 G. Borot , J. Bouttier , E. Guitter