Related papers: Random coalescing geodesics in first-passage perco…
Random fields are ubiquitous mathematical structures in physics, with applications ranging from thermodynamics and statistical physics to quantum field theory and cosmology. Recent works on information geometry of Gaussian random fields…
In this note, we study the model of directed last passage percolation on $\mathbb{Z}^2$, with i.i.d. exponential weight. We consider the maximum paths from vertices $\left(0,\lfloor k^{2/3} \rfloor\right)$ and $(\lfloor k^{2/3} \rfloor,0)$…
The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…
We study the geometry of infinite random Boltzmann planar maps with vertices of high degree. These correspond to the duals of the Boltzmann maps associated to a critical weight sequence $(q_{k})_{ k \geq 0}$ for the faces with polynomial…
Mixed effect modeling for longitudinal data is challenging when the observed data are random objects, which are complex data taking values in a general metric space without linear structure. In such settings the classical additive error…
In random geometry, a recurring theme is that any two geodesics emanating from a typical point part ways at a strictly positive distance from the above point, and we call such points as $1$-stars. However, the measure zero set of atypical…
We consider directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics as the endpoints are varied spatially and…
We present a method using Feynman-like diagrams to calculate the statistical properties of random many-body potentials. This method provides a promising alternative to existing techniques typically applied to this class of problems, such as…
We consider Brownian last passage percolation evolving dynamically via a discrete resampling procedure. Using $\Gamma_{(0,0)}^{(n,n),r}$ to denote a geodesic from $(0,0)$ to $(n,n)$ at time $r$, we prove that the expected total number of…
In discrete planar last passage percolation (LPP), random values are assigned independently to each vertex in $\mathbb Z^2$, and each finite upright path in $\mathbb Z^2$ is ascribed the weight given by the sum of values of its vertices.…
In this paper, we investigate some geometric properties of non-smooth random curves within a stochastic flow. We consider a polygonal line $\Gamma(\vec{u}_{1},\cdots,\vec{u}_{n})$, which connects the points…
We prove that embedded infinite planar maps in ergodic scale-free environments are close to their circle packing and Riemann uniformization embedding on a large scale, as long as suitable moment and connectivity conditions are satisfied.…
We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…
We consider any classical Grassmannian geometry $\Gamma$; that is, any projective or polar Grassmann space. Suppose every line in $\Gamma$ contains $s+1$ points. Then we classify all sets of points in $\Gamma$ of cardinality $s+1$, with the…
We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…
Maximum-density dimer packings (maximum matchings) of non-bipartite site-diluted lattices, such as the triangular and Shastry-Sutherland lattices in $d=2$ dimensions and the stacked-triangular and corner-sharing octahedral lattices in…
We construct an edge-weight distribution for i.i.d. first-passage percolation on $\mathbb{Z}^2$ whose limit shape is not a polygon and whose extreme points are arbitrarily dense in the boundary. Consequently, the associated Richardson-type…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
This talk is about solving cosmological equations analytically without approximations, and discovering new phenomena that could not be noticed with approximate solutions. We found all the solutions of the Friedmann equations for a specific…