相关论文: Confluence of geodesic paths and separating loops …
We consider triangulations of closed surfaces in which every vertex is incident to exactly $d$ edges. These triangulations can be identified with subgroups of the triangle group $\langle a,b,c\mid a^2,b^2,c^2,(ab)^3,(ac)^2,(bc)^d\rangle$…
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…
We give a lower bound for the non-collision probability up to a long time T in a system of n independent random walks with fixed obstacles on the two-dimensional lattice. By `collision' we mean collision between the random walks as well as…
The existence of the limiting pair correlation for angles between reciprocal geodesics on the modular surface is established. An explicit formula is provided, which captures geometric information about the length of reciprocal geodesics, as…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
Based on a novel type of Sobolev-Poincar\'e inequality (for generalised weakly differentiable functions on varifolds), we establish a finite upper bound of the geodesic diameter of generalised compact connected surfaces-with-boundary of…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
We consider large random planar maps and study the first-passage percolation distance obtained by assigning independent identically distributed lengths to the edges. We consider the cases of quadrangulations and of general planar maps. In…
Geometrical optics provides an instructive insight into Brownian motion, ``pushed" into a large-deviations regime by imposed constraints. Here we extend geometrical optics of Brownian motion by accounting for diffusion inhomogeneity in…
We study the probability distribution, $P_N(T)$, of the coincidence time $T$, i.e. the total local time of all pairwise coincidences of $N$ independent Brownian walkers. We consider in details two geometries: Brownian motions all starting…
This master thesis looks at the gradient flow of the length functional on embedded loops. The space of embedded loops is endowed with a scale structure so that the length functional becomes scale smooth. For certain underlying manifolds,…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
The Brownian triangulation is a random compact subset of the unit disk introduced by Aldous. For $\epsilon>0$, let $N(\epsilon)$ be the number of triangles whose sizes (measured in different ways) are greater than $\epsilon$ in the Brownian…
We consider the motion by curvature of a network of smooth curves with multiple junctions in the plane, that is, the geometric gradient flow associated to the length functional. Such a flow represents the evolution of a two--dimensional…
In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in…
A geometric approach to understanding recursion relations for scattering amplitudes is developed. We achieve this by studying intersection numbers of triangulated accordiohedra presented as hyperplane arrangements. The cancellation of…
Motivated by a problem arising from pharmaceutical science [B. Baeumer et al., Discr. Contin. Dyn. Sys. B 12], we study random walks on the contact graph of a bidisperse random sphere packing. For a random walk on the unweighted graph that…
This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…
We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…