Laurent Menard
We prove that the uniform infinite random quadrangulations defined respectively by Chassaing-Durhuus and Krikun have the same distribution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show that the Schaeffer's tree for an infinite quadrangulation only changes locally when changing the root of the quadrangulation. This follows from one property of distances in the infinite uniform random quadrangulation.
We prove that the uniform infinite random quadrangulations introduced respectively by Chassaing-Durhuus and Krikun have the same distribution.
We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well as on their dual. The proofs involve an explicit computation of the Laplace transform of the number of faces in truncated hulls of the uniform infinite plane quadrangulation.
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of uniformly distributed finite quadrangulations with a fixed number of faces. We study asymptotic properties of this random graph. In particular, we investigate scaling limits of the profile of distances from the distinguished point called the root, and we get asymptotics for the volume of large balls. As a key technical tool, we first describe the scaling limit of the contour functions of the uniform infinite well-labeled tree, in terms of a pair of eternal conditioned Brow…
We study the pioneer points of the simple random walk on the uniform infinite planar quadrangulation (UIPQ) using an adaptation of the peeling procedure of Angel to the quadrangulation case. Our main result is that, up to polylogarithmic factors, $n^3$ pioneer points have been discovered before the walk exits the ball of radius $n$ in the UIPQ. As a result we verify the KPZ relation in the particular case of the pioneer exponent and prove that the walk is subdiffusive with exponent less than 1/3. Along the way, new geometric controls on the UIPQ are established.
We introduce and study the uniform infinite planar quadrangulation (UIPQ) with a boundary via an extension of the construction of arXiv:1201.1052. We then relate this object to its simple boundary analog using a pruning procedure. This enables us to study the aperture of these maps, that is, the maximal distance between two points on the boundary, which in turn sheds new light on the geometry of the UIPQ. In particular we prove that the self-avoiding walk on the UIPQ is diffusive.
We introduce a one-parameter family of random infinite quadrangulations of the half-plane, which we call the uniform infinite half-planar quadrangulations with skewness (UIHPQ$_p$ for short, with $p\in[0,1/2]$ measuring the skewness). They interpolate between Kesten's tree corresponding to $p=0$ and the usual UIHPQ with a general boundary corresponding to $p=1/2$. As we make precise, these models arise as local limits of uniform quadrangulations with a boundary when their volume and perimeter grow in a properly fine-tuned way, and they represent all local limits of (sub)critical Boltzmann quad…
We introduce a new construction of the Uniform Infinite Planar Quadrangulation (UIPQ). Our approach is based on an extension of the Cori-Vauquelin-Schaeffer mapping in the context of infinite trees, in the spirit of previous work. However, we release the positivity constraint on the labels of trees which was imposed in these references, so that our construction is technically much simpler. This approach allows us to prove the conjectures of Krikun pertaining to the "geometry at infinity" of the UIPQ, and to derive new results about the UIPQ, among which a fine study of infinite geodesics.
We show that all geodesic rays in the uniform infinite half-planar quadrangulation (UIHPQ) intersect the boundary infinitely many times, answering thereby a recent question of Curien. However, the possible intersection points are sparsely distributed along the boundary. As an intermediate step, we show that geodesic rays in the UIHPQ are proper, a fact that was recently established by Caraceni and Curien (2015) by a reasoning different from ours. Finally, we argue that geodesic rays in the uniform infinite half-planar triangulation behave in a very similar manner, even in a strong quantitative…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe different limiting metric spaces. Among well-known objects like the Brownian plane or the infinite continuum random tree, we construct two new one-parameter families of metric spaces that appear as scaling limits: the Brownian half-plane with skewness parameter $θ$ and the infinite-volume Brownian disk of perimeter $σ$. We also obtain various coupling and limit …
We study geometric properties of the infinite random lattice called the uniform infinite planar quadrangulation or UIPQ. We establish a precise form of a conjecture of Krikun stating that the minimal size of a cycle that separates the ball of radius $R$ centered at the root vertex from infinity grows linearly in $R$. As a consequence, we derive certain isoperimetric bounds showing that the boundary size of any connected set $A$ consisting of a finite union of faces of the UIPQ and containing the root vertex is bounded below by a (random) constant times $|A|^{1/4}(\log|A|)^{-(3/4)-δ}$, where th…
We prove that uniform random quadrangulations of the sphere with $n$ faces, endowed with the usual graph distance and renormalized by $n^{-1/4}$, converge as $n\to\infty$ in distribution for the Gromov-Hausdorff topology to a limiting metric space. We validate a conjecture by Le Gall, by showing that the limit is (up to a scale constant) the so-called {\em Brownian map}, which was introduced by Marckert & Mokkadem and Le Gall as the most natural candidate for the scaling limit of many models of random plane maps. The proof relies strongly on the concept of {\em geodesic stars} in the map, whic…
We give a new construction of the uniform infinite half-planar quadrangulation with a general boundary (or UIHPQ), analogous to the construction of the UIPQ presented by Chassaing and Durhuus, which allows us to perform a detailed study of its geometry. We show that the process of distances to the root vertex read along the boundary contour of the UIHPQ evolves as a particularly simple Markov chain and converges to a pair of independent Bessel processes of dimension $5$ in the scaling limit. We study the "pencil" of infinite geodesics issued from the root vertex as Ménard, Miermont and the sec…
This paper is an adaptation of a method used in \cite{K} to the model of random quadrangulations. We prove local weak convergence of uniform measures on quadrangulations and show that the local growth of quadrangulation is governed by certain critical time-reversed branching process and the rescaled profile converges to the reversed continuous-state branching process. As an intermediate result we derieve a biparametric generating function for certain class of quadrangulations with boundary.
Local scaling limits of quadrangulations rooted on geodesics
研究确定了四边形在特定测地线根化下的局部缩放极限，并揭示了UIPQ与$\overline{\mathrm{UIPQ}}$的相同极限性质。
In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a fixed boundary length. In particular, this gives a way to sample a uniform quadrangulation with n + 1 faces from a uniform quadrangulation with n faces or a uniform forest with n+1 edges and p trees from a uniform forest with n edges and p trees.
We study large uniform random quadrangulations whose genus grow linearly with the number of faces, whose local convergence was recently established by Budzinski and the author arXiv:1902.00492,arXiv:2012.05813. Here we study several properties of these objects which are not captured by the local topology. Namely we show that balls around the root are planar whp up to logarithmic radius, and we prove that there exists short non-contractible cycles with positive probability.
We consider the uniform infinite quadrangulation of the plane (UIPQ). Curien, Ménard and Miermont recently established that in the UIPQ, all infinite geodesic rays originating from the root are essentially similar, in the sense that they have an infinite number of common vertices. In this work, we identify the limit quadrangulation obtained by rerooting the UIPQ at a point at infinity on one of these geodesics. More precisely, calling $v_k$ the $k$-th vertex on the "leftmost" geodesic ray originating from the root, and $Q_{\infty}^{(k)}$ the UIPQ re-rooted at $v_k$, we study the local limit of…
We prove that the metric space associated with a uniformly distributed planar quadrangulation with n faces and no pendant vertices converges modulo a suitable rescaling to the Brownian map. This is a first step towards the extension of recent convergence results for random planar maps to the case of graphs satisfying local constraints.
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method lets us obtain rigorous and explicit upper and lower bounds on the percolation threshold $p_\mathrm{c}$, and thus show in particular that $0.5511\leq p_\mathrm{c}\leq 0.5581$. The method can be extended to site percolation on other half-planar maps with the domain Markov property.
We show that a uniform quadrangulation, its largest 2-connected block, and its largest simple block jointly converge to the same Brownian map in distribution for the Gromov-Hausdorff-Prokhorov topology. We start by deriving a local limit theorem for the asymptotics of maximal block sizes, extending the result in \cite{BFSS}. The resulting diameter bounds for pendant submaps of random quadrangulations straightforwardly lead to Gromov-Hausdorff convergence. To extend the convergence to the Gromov-Hausdorff-Prokhorov topology, we show that exchangeable "uniformly asymptotically negligible" attach…
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given $g$, we consider, for every $n \ge 1$, a random quadrangulation $\q_n$ uniformly distributed over the set of all rooted bipartite quadrangulations of genus $g$ with $n$ faces. We view it as a metric space by endowing its set of vertices with the graph distance. We show that, as $n$ tends to infinity, this metric space, with distances rescaled by the factor $n^{-1/4}$, converges in distribution, at least along some subsequence, toward a limiting random metric space. This convergence holds in the sense o…
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given g, we consider, for every $n\ge1$, a random quadrangulation $\mathfrak{q}_n$ uniformly distributed over the set of all rooted bipartite quadrangulations of genus g with n faces. We view it as a metric space by endowing its set of vertices with the graph metric. As n tends to infinity, this metric space, with distances rescaled by the factor $n^{-1/4}$, converges in distribution, at least along some subsequence, toward a limiting random metric space. This convergence holds in the sense of the Gromov-Hau…
Let $Q$ be a free Boltzmann quadrangulation with simple boundary decorated by a critical ($p=3/4$) face percolation configuration. We prove that the chordal percolation exploration path on $Q$ between two marked boundary edges converges in the scaling limit to chordal SLE$_6$ on an independent $\sqrt{8/3}$-Liouville quantum gravity disk (equivalently, a Brownian disk). The topology of convergence is the Gromov-Hausdorff-Prokhorov-uniform topology, the natural analog of the Gromov-Hausdorff topology for curve-decorated metric measure spaces. We also obtain analogous scaling limit results for fa…
We prove that the uniform infinite half-plane quadrangulation (UIHPQ), with either general or simple boundary, equipped with its graph distance, its natural area measure, and the curve which traces its boundary, converges in the scaling limit to the Brownian half-plane. The topology of convergence is given by the so-called Gromov-Hausdorff-Prokhorov-uniform (GHPU) metric on curve-decorated metric measure spaces, which is a generalization of the Gromov-Hausdorff metric whereby two such spaces $(X_1, d_1 , μ_1,η_1)$ and $(X_2, d_2 , μ_2,η_2)$ are close if they can be isometrically embedded into …
We prove that a uniform infinite quadrangulation of the half-plane decorated by a self-avoiding walk (SAW) converges in the scaling limit to the metric gluing of two independent Brownian half-planes identified along their positive boundary rays. Combined with other work of the authors, this implies the convergence of the SAW on a random quadrangulation to SLE$_{8/3}$ on a certain $\sqrt{8/3}$-Liouville quantum gravity surface. The topology of convergence is the local Gromov-Hausdorff-Prokhorov-uniform topology, the natural generalization of the local Gromov-Hausdorff topology to curve-decorate…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by $(3/(4n))^{1/4}$, the resulting random measured metric space converges in distribution, in the Gromov-Hausdorff-Prokhorov sense, to the Brownian map. In proving the preceding fact, we introduce a labelling function for the vertices of $M_n$. Under this labelling, distances to a distinguished point are essentially given by vertex labels, with an error given …
We discuss the scaling limit of large planar quadrangulations with a boundary whose length is of order the square root of the number of faces. We consider a sequence $(σ_n)$ of integers such that $σ_n/\sqrt{2n}$ tends to some $σ\in[0,\infty]$. For every $n \ge 1$, we call $q_n$ a random map uniformly distributed over the set of all rooted planar quadrangulations with a boundary having $n$ faces and $2σ_n$ half-edges on the boundary. For $σ\in (0,\infty)$, we view $q_n$ as a metric space by endowing its set of vertices with the graph metric, rescaled by $n^{-1/4}$. We show that this metric spac…
Scaling limit of random plane quadrangulations with a simple boundary, via restriction
本文证明具有简单边界的均匀随机四边形剖分在 $n^{-1/4}$ 缩放下弱收敛于布朗盘，通过将其视为已知极限模型的条件版本并运用去条件化技术实现。
We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite quadrangulations of the half-plane (UIHPQs). We prove a lower bound on the displacement of the SAW which, combined with estimates from our previous paper, shows that the self-avoiding walk is diffusive. As a byproduct this implies that the volume growth exponent of the lattice in question is $4$ (as is the case for the standard UIPQ); nevertheless, using our previous work …
Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit random surface can be described in terms of a birth and death process and a sequence of multitype Galton--Watson trees. As a consequence, we find that the expected volume of the ball of radius $r$ around a marked point in the limit random surface is $Θ(r^4)$.
We introduce and study the random non-compact metric space called the Brownian plane, which is obtained as the scaling limit of the uniform infinite planar quadrangulation. Alternatively, the Brownian plane is identified as the Gromov-Hausdorff tangent cone in distribution of the Brownian map at its root vertex, and it also arises as the scaling limit of uniformly distributed (finite) planar quadrangulations with n faces when the scaling factor tends to 0 less fast than n^{-1/4}. We discuss various properties of the Brownian plane. In particular, we prove that the Brownian plane is homeomorphi…
We prove that a uniform rooted plane map with n edges converges in distribution after a suitable normalization to the Brownian map for the Gromov-Hausdorff topology. A recent bijection due to Ambjørn and Budd allows to derive this result by a direct coupling with a uniform random quadrangulation with n faces.
Compact Brownian surfaces II. Orientable surfaces
本文研究带边界紧可定向曲面上的随机四剖，证明其在 Gromov-Hausdorff-Prokhorov 拓扑下依分布收敛至布朗曲面，扩展了平面四剖向布朗球和布朗盘的收敛结果。
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and Quadrangulation and to the Incipient Infinite Cluster in $\mathbb{Z}^2$.
The infinite discrete stable Boltzmann maps are generalisations of the well-known Uniform Infinite Planar Quadrangulation in the case where large degree faces are allowed. We show that the simple random walk on these random lattices is always subdiffusive with exponent less than 1/3. Our method is based on stationarity and geometric estimates obtained via the peeling process which are of own interest.
For each $n\in\mathbb{N}$, let $\mathbf{Q}_n$ be a uniform rooted measured quadrangulation of size $n$ conditioned to have $r(n)$ vertices in its root block. We prove that for a suitable function $r(n)$, after rescaling graph distance by $\left(\frac{21}{40\cdot r(n)}\right)^{1/4}$, with an appropriate rescaling of measure, $\mathbf{Q}_n$ converges to a random pointed measured non-compact metric space $\boldsymbol{ \mathcal{S}}$, in the local Gromov-Hausdorff-Prokhorov topology; the space $\boldsymbol{ \mathcal{S}}$ is built by identifying a uniform point of the Brownian map with the distingui…
We construct the uniform infinite planar map (UIPM), obtained as the n \to \infty local limit of planar maps with n edges, chosen uniformly at random. We then describe how the UIPM can be sampled using a "peeling" process, in a similar way as for uniform triangulations. This process allows us to prove that for bond and site percolation on the UIPM, the percolation thresholds are p_c^bond=1/2 and p_c^site=2/3 respectively. This method also works for other classes of random infinite planar maps, and we show in particular that for bond percolation on the uniform infinite planar quadrangulation, t…
On the triviality of the shocked map
本文研究了临界状态下树装饰四剖分的极限行为，证明了在适当缩放后其收敛于边界缩为一点的Brownian disk，从而得出受冲击映射的平凡性。
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 we prove a surprisingly simple universal formula for the critical threshold for bond and face percolations on these graphs. Our techniques also permit us to compute off-critical and critical exponents related to percolation clusters such as the volume and the perimeter.
We study the scaling limit of the volume and perimeter of the discovered regions in the Markovian explorations known as peeling processes for infinite random planar maps such as the uniform infinite planar triangulation (UIPT) or quadrangulation (UIPQ). In particular, our results apply to the metric exploration or peeling by layers algorithm, where the discovered regions are (almost) completed balls, or hulls, centered at the root vertex. The scaling limits of the perimeter and volume of hulls can be expressed in terms of the hull process of the Brownian plane studied in our previous work. Oth…
We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between quadrangulations and maps, to define a growth procedure for maps. The growth procedure is local, in that every map is obtained from its predecessor by an operation that only modifies vertices lying on a common face with some fixed vertex. As n tends to infinity, the probability that the n'th map in the sequence is 3-connected tends to 2^8/3^6. The sequence of maps ha…
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 triangulation or the uniform infinite planar quadrangulation and is conjectured to be the universal scaling limit of many others random planar lattices. We establish sharp bounds on the probability of having a short cycle separating the ball of radius $r$ centered at the distinguished point from infinity. Then we prove a strong version of the spatial Markov p…
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 called peeling processes. Such a process depends on an algorithm which selects at each step the next edge where the exploration continues. We prove here that, whatever this algorithm, a peeling process always reveals about the same portion of the map, thus growing roughly metric balls. Applied to well-designed algorithms, this easily enables us to compare dista…
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold in the quadrangular case using the so-called peeling techniques. Then, we generalize a result of Angel about the scaling limit of crossing probabilities, that are a natural analogue to Cardy's formula in (non-random) plane lattices. Our main result is that those probabilities are universal, in the sense that they do not depend on the percolation model neithe…
We introduce the Incipient Infinite Cluster (IIC) in the critical Bernoulli site percolation model on the Uniform Infinite Half-Planar Triangulation (UIHPT), which is the local limit of large random triangulations with a boundary. The IIC is defined from the UIHPT by conditioning the open percolation cluster of the origin to be infinite. We prove that the IIC can be obtained by adding within the UIHPT an infinite triangulation with a boundary whose distribution is explicit.
Uniform large deviation principles for positive functionals of all equivalent types of infinite dimensional Brownian motions acting together with a Poisson random measure are established. The core of our approach is a variational representation formula which for an infinite sequence of i.i.d real Brownian motions and a Poisson random measure was shown in [5].
We give an example of an $\mathsf{FIID}$ vertex-labeling of $\mathbb{T}_3$ whose marginals are uniform on $[0,1]$, and if we delete the edges between those vertices whose labels are different, then some of the remaining clusters are infinite.
Interacting systems of infinite spiking neurons with weights beyond uniform summability
本文研究了具有漂移及兴奋和抑制性连接的无限脉冲神经元系统，探讨了非爆炸性和不变测度唯一性的条件，并将 Galves-Löcherbach 模型扩展至超越一致可和性权重的限制。
We show that, under certain natural assumptions, large random plane bipartite maps with a boundary converge after rescaling to a one-parameter family ($\mathrm{BD}_L$, $0 < L < \infty$) of random metric spaces homeomorphic to the closed unit disk of $\mathbb{R}^2$, the space $\mathrm{BD}_L$ being called the Brownian disk of perimeter $L$ and unit area. These results can be seen as an extension of the convergence of uniform plane quadrangulations to the Brownian map, which intuitively corresponds to the limit case where $L = 0$. Similar results are obtained for maps following a Boltzmann distri…
Let $\mathcal{U}$ be the uniform spanning tree on $\mathbb{Z}^3$, whose probability law is denoted by $\mathbf{P}$. For $\mathbf{P}$-a.s. realization of $\mathcal{U}$, the recurrence of the the simple random walk on $\mathcal{U}$ is proved in [5] and it is also demonstrated in [8] that two independent simple random walks on $\mathcal{U}$ collide infinitely often. In this article, we will give a quantitative estimate on the number of collisions of two independent simple random walks on $\mathcal{U}$, which provides another proof of the infinite collision property of $\mathcal{U}$.
We study the simple random walk on the Uniform Infinite Half-Plane Map, which is the local limit of critical Boltzmann planar maps with a large and simple boundary. We prove that the simple random walk is recurrent, and that the resistance between the root and the boundary of the hull of radius $r$ is at least of order $\log r$. This resistance bound is expected to be sharp, and is better than those following from previous proofs of recurrence for non bounded-degree planar maps models. Our main tools are the self-duality of uniform planar maps, a classical lemma about duality of resistances an…
We consider the generalization of the Pólya urn scheme with possibly infinite many colors as introduced in \cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors, we prove almost sure convergence of the urn configuration under \emph{uniform ergodicity} assumption on the associated Markov chain. The proof uses a stochastic coupling of the sequence of chosen colors with a \emph{branching Markov chain} on a weighted \emph{random recursive tree} as described in \cite{BaTh2017, Sv_2018}. Using this coupling we estimate the covariance between any two selected colors. In particular…
Let $X_n$ be independent random elements in the Skorohod space $D([0,1];E)$ of càdlàg functions taking values in a separable Banach space $E$. Let $S_n=\sum_{j=1}^nX_j$. We show that if $S_n$ converges in finite dimensional distributions to a càdlàg process, then $S_n+y_n$ converges a.s. pathwise uniformly over $[0,1]$, for some $y_n\in D([0,1];E)$. This result extends the Itô-Nisio theorem to the space $D([0,1];E)$, which is surprisingly lacking in the literature even for $E=R$. The main difficulties of dealing with $D([0,1];E)$ in this context are its nonseparability under the uniform norm a…
We classify completely the infinite, planar triangulations satisfying a weak spatial Markov property, without assuming one-endedness nor finiteness of vertex degrees. In particular, the Uniform Infinite Planar Triangulation (UIPT) is the only such triangulation with average degree 6. As a consequence, we prove that the convergence of uniform triangulations of the sphere to the UIPT is robust, in the sense that it is preserved under various perturbations of the uniform measure. As another application, we obtain large deviation estimates for the number of occurencies of a pattern in uniform tria…
We establish a connection between the uniform infinite planar triangulation and some critical time-reversed branching process. This allows to find a scaling limit for the principal boundary component of a ball of radius R for large R (i.e. for a boundary component separating the ball from infinity). We show also that outside of R-ball a contour exists that has length linear in R.
We prove that the random simple cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices admits a novel uniform infinite cubic planar graph (UICPG) as quenched local limit. We describe how the limit may be constructed by a series of random blow-up operations applied to the dual map of the type~III Uniform Infinite Planar Triangulation established by Angel and Schramm (Comm. Math. Phys., 2003). Our main technical lemma is a contiguity relation between $\mathsf{C}_n$ and a model where the networks inserted at the links of the largest $3$-connected component of $\mathsf{C}_n$ are rep…
Generalized uniform laws for tied-down occupation times of infinite ergodic transformations
本文利用算子更新理论建立无限遍历变换在轨道终点返回有限测度集条件下停留时间的条件极限定理，所得广义均匀极限定律适用于含多个中性不动点的间歇性映射。
We develop a method to compute the generating function of the number of vertices inside certain regions of the Uniform Infinite Planar Triangulation (UIPT). The computations are mostly combinatorial in flavor and the main tool is the decomposition of the UIPT into layers, called the skeleton decomposition, introduced by Krikun. In particular, we get explicit formulas for the generating functions of the number of vertices inside hulls (or completed metric balls) centered around the root, and the number of vertices inside geodesic slices of these hulls. We also recover known results about the sc…
The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied. In particular, the limit is a probability measure on random triangulations of the plane.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。