Search arXivSearch

arXiv · 2008.02242

Geodesics in the Brownian map: Strong confluence and geometric structure

Abstract

We study geodesics in the Brownian map $(\mathcal{S},d,ν)$, the random metric measure space which arises as the Gromov-Hausdorff scaling limit of uniformly random planar maps. Our results apply to all geodesics including those between exceptional points. First, we prove a strong and quantitative form of the confluence of geodesics phenomenon which states that any pair of geodesics which are sufficiently close in the Hausdorff distance must coincide with each other except near their endpoints. Then, we show that the intersection of any two geodesics minus their endpoints is connected, the number of geodesics which emanate from a single point and are disjoint except at their starting point is at most $5$, and the maximal number of geodesics which connect any pair of points is $9$. For each $1\le k \le 9$, we obtain the Hausdorff dimension of the pairs of points connected by exactly $k$ geodesics. For $k=7,8,9$, such pairs have dimension zero and are countably infinite. Further, we classify the (finite number of) possible configurations of geodesics between any pair of points in $\mathcal{S}$, up to homeomorphism, and give a dimension upper bound for the set of endpoints in each case. Finally, we show that every geodesic can be approximated arbitrarily well and in a strong sense by a geodesic connecting $ν$-typical points. In particular, this gives an affirmative answer to a conjecture of Angel, Kolesnik, and Miermont that the geodesic frame of $\mathcal{S}$, the union of all of the geodesics in $\mathcal{S}$ minus their endpoints, has dimension one, the dimension of a single geodesic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Miller, Wei Qian. 2023-09-12. Geodesics in the Brownian map: Strong confluence and geometric structure. https://arxiv.org/abs/2008.02242

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bounded weak solutions to cross-diffusion semiconductor model with electron-hole scattering

Semiconductor model is a system of parabolic partial differential equations with cross-diffusion phenomenon. Previous results showed that a weak solution exists and is not bounded in general. So semiconductor model was categorized as a cross-diffusion system without bounded weak solutions. In this work, we show that once the initial value is bounded, there exists a weak solution that is also bounded. The entropy method is a major tool in global existence analysis of cross-diffusion systems. We notice that traditional entropies in volume-filling cases may not provide required positive semi-definiteness result for the existence proof. In this situation, a transformation of variables technique has been applied. The product between Hessian matrix of the entropy and replacement diffusion matrix is positive semi-definite, then we apply the entropy method to show semiconductor model has a bounded weak solution.

math.PR

Global existence and uniqueness analysis of cross-diffusion multispecies chemotaxis system with volume-filling

The system of multispecies chemotaxis equations is a cross-diffusion system with volume-filling. In this work, we show that a weak solution of the two species chemotaxis system exists. The entropy method is a major tool in existence analysis of cross-diffusion systems. Previous investigations indicate that traditional entropies in volume-filling cases may not be able to provide required gradient estimates. In this situation, we upgrade existing matrix computation methods to derive gradient estimates. Due to the cross-diffusion phenomenon, the uniqueness of the weak solution to a cross-diffusion system is very difficult to prove in general. In this work, we apply the distance functional to show that when parameters of the chemotaxis system are identical, the weak solution is unique.

math.PR

Self-normalized scaled quadratic variation

The concept of a scaled quadratic variation was originally introduced by E. Gladyshev in 1961 for processes with Gaussian increments. Using certain deterministic scaling, arrived at from the covariance of the process, Gladyshev showed that the sum of scaled square increments along the dyadic partition sequence converges almost surely to a finite limit. In this paper, we propose a pathwise counterpart in which the deterministic normalization is replaced by a self-normalizing factor built from the $p$-th variation of the path along a given sequence of partitions. The resulting quantity requires no probabilistic assumption and no knowledge of a covariance structure, and its scale is both path-dependent and sensitive to the partition sequence. Under a mild regularity condition on the limiting $p$-th variation, we show that the self-normalized and the classical deterministic normalizations are comparable, and for fractional Brownian motion the two agree up to a multiplicative constant. We establish a switching behaviour in the index, and prove that for $p \ge 2$ the self-normalized scaled quadratic variation obeys a smooth-transformation formula under $C^2$ maps; at $p=2$ this recovers the known transformation rule for quadratic variation. Since only squared increments are scaled, the construction polarizes, yielding a matrix-valued scaled quadratic variation for every $p \geq 1$ for $\mathbb R^d$ valued paths. We conclude with examples beyond the Gaussian setting.

math.PR