中文
相关论文

相关论文: Scaling limits of random trees and planar maps

200 篇论文

We determine the possible scaling limits in the quantum central limit theorem with respect to the Gibbs state, for a growing distance-regular graph that has so-called classical parameters with base unequal to one. We also describe…

组合数学 · 数学 2021-11-29 Masoumeh Koohestani , Nobuaki Obata , Hajime Tanaka

This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…

数学物理 · 物理学 2019-12-17 Jérémie Bouttier

Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…

人工智能 · 计算机科学 2022-11-22 Nico Potyka , Xiang Yin , Francesca Toni

We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other…

组合数学 · 数学 2017-08-22 Sean Cleary , Mareike Fischer , Robert C. Griffiths , Raazesh Sainudiin

We introduce a simple bijection between Tamari intervals and the blossoming trees (Poulalhon and Schaeffer, 2006) encoding planar triangulations, using a new meandering representation of such trees. Its specializations to the families of…

组合数学 · 数学 2025-11-11 Wenjie Fang , Éric Fusy , Philippe Nadeau

We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…

组合数学 · 数学 2017-12-06 Benedikt Stufler

A large fraction of the information collected by cosmological surveys is simply discarded to avoid lengthscales which are difficult to model theoretically. We introduce a new technique which enables the extraction of useful information from…

宇宙学与河外天体物理 · 物理学 2013-10-08 Fergus Simpson , J. Berian James , Alan F. Heavens , Catherine Heymans

We prove a scaling limit theorem for the simple random walk on critical lattice trees in $\mathbb{Z}^d$, for $d\geq 8$. The scaling limit is the Brownian motion on the Integrated Super-Brownian Excursion (BISE) which is the same one that we…

概率论 · 数学 2025-03-31 Gérard Ben Arous , Manuel Cabezas , Alexander Fribergh

Balister, the second author, Groenland, Johnston and Scott recently showed that there are asymptotically $C4^n/n^{3/4}$ many unordered sequences that occur as degree sequences of graphs. Combining limit theory for infinitely divisible…

组合数学 · 数学 2026-02-11 Michal Bassan , Serte Donderwinkel , Brett Kolesnik

We consider critical multitype Bienaym\'e trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first,…

We extend the classical coding of measured $\mathbb R$-trees by continuous excursion-type functions to c\`adl\`ag excursion-type functions through the notion of parametric representations. The main feature of this extension is its…

概率论 · 数学 2026-03-05 Antoine Aurillard

Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…

统计力学 · 物理学 2009-11-07 P. Bialas , Z. Burda , J. Jurkiewicz , A. Krzywicki

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…

组合数学 · 数学 2019-06-14 Olivier Bernardi , Eric Fusy

Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…

组合数学 · 数学 2013-12-03 Jaroslav Nesetril , Patrice Ossona De Mendez

We discuss the asymptotic behaviour of random critical Boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index $\alpha \in (1,2]$. We prove that when conditioning such maps…

概率论 · 数学 2018-10-25 Cyril Marzouk

We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…

概率论 · 数学 2014-11-17 Konstantinos Panagiotou , Benedikt Stufler , Kerstin Weller

We study the scaling limit of a divisible sandpile model associated to a truncated $\alpha$-stable random walk. We prove that the limiting distribution is related to an obstacle problem for a truncated fractional Laplacian. We also provide,…

偏微分方程分析 · 数学 2018-06-11 Susana Frómeta , Milton Jara

The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov-Witten classes, and a…

高能物理 - 理论 · 物理学 2009-10-28 M. Kontsevich , Yu. Manin

We consider the model of the Brownian plane, which is a pointed non-compact random metric space with the topology of the complex plane. The Brownian plane can be obtained as the scaling limit in distribution of the uniform infinite planar…

概率论 · 数学 2021-05-14 Armand Riera

We show that the trace of the null recurrent biased random walk on a Galton-Watson tree properly renormalized converges to the Brownian forest. Our result extends to the setting of the random walk in random environment on a Galton-Watson…

概率论 · 数学 2015-09-25 Elie Aïdékon , Loïc de Raphélis