English
Related papers

Related papers: One-point large deviations of the directed landsca…

200 papers

While modern representation learning relies heavily on global error signals, decentralized algorithms driven by local interactions offer a fundamental distributed alternative. However, the macroscopic convergence properties of these…

Machine Learning · Computer Science 2026-04-21 Zilin Li , Weiwei Xu , Xuchun Tong , Xuanbo Lu , Xuanqi Zhao

We seek a practical method for establishing dense correspondences between two images with similar content, but possibly different 3D scenes. One of the challenges in designing such a system is the local scale differences of objects…

Computer Vision and Pattern Recognition · Computer Science 2016-04-20 Moria Tau , Tal Hassner

A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…

Combinatorics · Mathematics 2025-03-04 Saveliy V. Skresanov

The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph and a positive integer $d$, what is the minimum number of arc…

Combinatorics · Mathematics 2025-07-18 Panna Gehér , Max Kölbl , Lydia Mirabel Mendoza-Cadena , Daniel P. Szabo

In their work [IM16] I.A. Ikromov and D. M\"{u}ller proved the full range $L^p-L^2$ Fourier restriction estimates for a very general class of hypersurfaces in $\R^3$ which includes the class of real analytic hypersurfaces. In this article…

Classical Analysis and ODEs · Mathematics 2020-07-15 Ljudevit Palle

Let E be an elliptic curve defined over a number field k. In this paper, we define the ``global discrepancy'' of a finite set Z of algebraic points on E which in a precise sense measures how far the set is from being adelically…

Number Theory · Mathematics 2007-05-23 Matthew Baker , Clayton Petsche

We prove sandwich theorems and a Tauberian theorem in the space of compact metric measure spaces, endowed with the Gromov-Hausdorff-Prokhorov (GHP) topology. These results hold with respect to a close relative of Gromov's Lipschitz order.…

Probability · Mathematics 2025-10-08 William Fleurat

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

Metric Geometry · Mathematics 2010-03-23 Assaf Naor , Terence Tao

For the exactly solvable model of exponential last passage percolation on $\mathbb{Z}^2$, it is known that given any non-axial direction, all the semi-infinite geodesics starting from points in $\mathbb{Z}^2$ in that direction almost surely…

Probability · Mathematics 2023-08-15 Márton Balázs , Riddhipratim Basu , Sudeshna Bhattacharjee

This paper establishes mesoscopic rates of convergence in the $L^1$-Wasserstein distance for eigenvalue determinantal point processes (DPPs) derived from the Laguerre Unitary Ensemble (LUE) to the corresponding limiting point process (Airy…

Probability · Mathematics 2026-05-14 Mengchun Cai

The problem of least squares regression of a $d$-dimensional unknown parameter is considered. A stochastic gradient descent based algorithm with weighted iterate-averaging that uses a single pass over the data is studied and its convergence…

Information Theory · Computer Science 2016-06-10 Kobi Cohen , Angelia Nedic , R. Srikant

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

We study the convergence properties of Riemannian gradient method for solving the consensus problem (for an undirected connected graph) over the Stiefel manifold. The Stiefel manifold is a non-convex set and the standard notion of averaging…

Optimization and Control · Mathematics 2021-01-26 Shixiang Chen , Alfredo Garcia , Mingyi Hong , Shahin Shahrampour

We continue the study of infinite geodesics in planar first-passage percolation, pioneered by Newman in the mid 1990s. Building on more recent work of Hoffman, and Damron and Hanson, we develop an ergodic theory for infinite geodesics via…

Probability · Mathematics 2019-07-19 Daniel Ahlberg , Christopher Hoffman

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

Differential Geometry · Mathematics 2023-01-30 Chengcheng Yang

We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…

Optimization and Control · Mathematics 2026-05-20 Lorenzo Portinale , Filippo Quattrocchi

We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…

Probability · Mathematics 2020-02-03 Tongseok Lim , Robert J. McCann

We consider geodesics for first passage percolation (FPP) on $\mathbb{Z}^d$ with iid passage times. As has been common in the literature, we assume that the FPP system satisfies certain basic properties conjectured to be true, and derive…

Probability · Mathematics 2022-05-04 Kenneth S. Alexander

We refine the recent local rigidity result for the marked length spectrum obtained by the first and third author in \cite{Guillarmou-Lefeuvre-18} and give an alternative proof using the geodesic stretch between two Anosov flows and some…

Differential Geometry · Mathematics 2023-06-22 Colin Guillarmou , Gerhard Knieper , Thibault Lefeuvre

Let $G$ be a $d$-regular graph and let $F\subseteq\{0, 1, 2, \ldots, d\}$ be a list of forbidden out-degrees. Akbari, Dalirrooyfard, Ehsani, Ozeki, and Sherkati conjectured that if $|F|<\tfrac{1}{2}d$, then $G$ should admit an $F$-avoiding…

Combinatorics · Mathematics 2024-06-10 Owen Henderschedt , Jessica McDonald