Related papers: Convergence of Eulerian triangulations
In this paper, we have reintroduced a new approach to conformal geometry developed and presented in two previous papers, in which we show that all n-dimensional pseudo-Riemannian metrics are conformal to a flat n-dimensional manifold as…
We propose an extension of a special form of gradient descent -- in the literature known as linearised Bregman iteration -- to a larger class of non-convex functions. We replace the classical (squared) two norm metric in the gradient…
In this paper a new approach is derived in the context of shape theory. The implemented methodology is motivated in an open problem proposed in \citet{GM93} about the construction of certain shape density involving Euler hypergeometric…
The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in the applied sciences. In this paper, we propose two algorithms…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
A method is presented for constructing closed surfaces out of Euclidean polygons with infinitely many segment identifications along the boundary. The metric on the quotient is identified. A sufficient condition is presented which guarantees…
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…
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.…
This article is the introductory part of authors PhD thesis. The article presents a new coordinate invariant definition of quasiregular and quasiconformal mappings on Riemannian manifolds that generalizes the definition of quasiregular…
This paper describes joint work with Oded Schramm and Wendelin Werner establishing the values of the planar Brownian intersection exponents from which one derives the Hausdorff dimension of certain exceptional sets of planar Brownian…
This paper considers a classical question of approximation of Brownian motion by a random walk in the setting of a sub-Riemannian manifold $M$. To construct such a random walk we first address several issues related to the degeneracy of…
As a well-known fact, the classical Euler scheme works merely for SDEs with coefficients of linear growth. In this paper, we study a general framework of modified Euler schemes, which is applicable to SDEs with super-linear drifts and…
Identifying parallel sides of a collection of Euclidean polygons yields a flat surface with cone points of angles multiples of 2 pi, naturally a compact Riemann surface but also an algebraic curve, and a hyperbolic surface. In general two…
We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…
Through a regularization procedure, few approximation schemes of the local time of a large class of one dimensional processes are given. We mainly consider the local time of continuous semimartingales and reversible diffusions, and the…
Consider a generic triangle in the upper half of the complex plane with one side on the real line. This paper presents a tailored construction of a discrete random walk whose continuum limit is a Brownian motion in the triangle, reflected…
We study geodesics in the Brownian map $(\mathcal{S},d,\nu)$, 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…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
Given two pants decompositions of a compact orientable surface $S$, we give an upper bound for their distance in the pants graph that depends logarithmically on their intersection number and polynomially on the Euler characteristic of $S$.…
We prove a version of the classical Runge and Mergelyan uniform approximation theorems for non-orientable minimal surfaces in Euclidean 3-space R3. Then, we obtain some geometric applications. Among them, we emphasize the following ones: 1.…