Related papers: Distance statistics in large toroidal maps
We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
Data structures known as $k$-d trees have numerous applications in scientific computing, particularly in areas of modern statistics and data science such as range search in decision trees, clustering, nearest neighbors search, local…
We determine the distribution of the number of saddle connections on a random translation surface of large genus. More specifically, for genus $g$ tending to infinity, the number of saddle connections with lengths in a given interval…
We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to be better known to applied probabilists and statisticians. We introduce and motivate…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…
Distance queries are a basic tool in data analysis. They are used for detection and localization of change for the purpose of anomaly detection, monitoring, or planning. Distance queries are particularly useful when data sets such as…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
In this paper, we address the question of comparison between populations of trees. We study an statistical test based on the distance between empirical mean trees, as an analog of the two sample z statistic for comparing two means. Despite…
We establish a connection between exclusion statistics with arbitrary integer exclusion parameter $g$ and a class of random walks on planar lattices. This connection maps the generating function for the number of closed walks of given…
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…
The conformations of topologically constrained double-folded ring polymers can be described as wrappings of randomly branched primitive trees. We extend previous work on the tree statistics under different (solvent) conditions to explore…
We study the statistics of quantum transmission through a one-dimensional disordered system modelled by a sequence of independent scattering units. Each unit is characterized by its length and by its action, which is proportional to the…
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
In this work, we investigate the spectrum of singularities of random stable trees with parameter $\gamma\in(1,2)$. We consider for that purpose the scaling exponents derived from two natural measures on stable trees: the local time $\ell^a$…
Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants…
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…
Leaves, i.e., vertices of degree one, can play a significant role in graph structure, especially in sparsely connected settings in which leaves often constitute the largest fraction of vertices. We consider a leaf-based counterpart of the…
The statistics of transmission through random 1D media are generally presumed to be universal and to depend only upon a single dimensionless parameter-the ratio of the sample length and the mean free path, s = L/l. Here, we show in…