Related papers: Directed Hypercube Routing, a Generalized Lehman-R…

In this paper we focus on dynamical properties of (real) convex projective surfaces. Our main theorem provides an asymptotic formula for the number of free homotopy classes with roughly the same renormalized Hilbert length for two distinct…

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…

Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set separating two vertex sets $X$ and $Y$ is the same as the…

We identify the holomorphic de Rham complex of the minimal extension of a meromorphic vector bundle with connexion on a compact Riemann surface X with the L^2 complex relative to a suitable metric on the bundle and a complete metric on the…

For every non-elementary hyperbolic group, we introduce the Manhattan curve associated to any pair of left-invariant hyperbolic metrics which are quasi-isometric to a word metric. It is convex; we show that it is continuously differentiable…

Measuring transport coefficients at the microscale remains challenging, often relying on indirect methods that require modeling and calibration. This Letter derives universal asymptotic forms for the autocorrelation and relative uncertainty…

This paper significantly strengthens directed low-diameter decompositions in several ways. We define and give the first results for separated low-diameter decompositions in directed graphs, tighten and generalize probabilistic guarantees,…

In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of…

We prove a sharp continuum Beck-type theorem for hyperplanes. Our work is inspired by foundational work of Beck on the discrete problem, as well as refinements due to Do and Lund. The inductive proof uses recent breakthrough results in…

Within a framework of noncommutative geometry, we develop an analogue of (pseudo) Riemannian geometry on finite and discrete sets. On a finite set, there is a counterpart of the continuum metric tensor with a simple geometric…

In this work we develop a novel approach using deep neural networks to reconstruct the conductivity distribution in elliptic problems from one measurement of the solution over the whole domain. The approach is based on a mixed reformulation…

We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum…

We establish the global existence of weak entropy solutions for 1D isentropic gas dynamics with general pressure laws ($\gamma > 1$). To address vacuum degeneracy, we introduce a novel structural regularization via a "Synchronized Dual…

We give a transport proof of a discrete version of the displacement convexity of entropy on integers (Z), and get, as a consequence, two discrete forms of the Pr{\'e}kopa-Leindler Inequality : the Four Functions Theorem of Ahlswede and…

We derive Cheeger inequalities for directed graphs and hypergraphs using the reweighted eigenvalue approach that was recently developed for vertex expansion in undirected graphs [OZ22,KLT22,JPV22]. The goal is to develop a new spectral…

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes.…

We prove that uniformly disconnected subsets of metric measure spaces with controlled geometry (complete, Ahlfors regular, supporting a Poincare inequality, and a mild topological condition) are contained in a quasisymmetric arc. This…

The last decade has seen the development of path homology and magnitude homology -- two homology theories of directed graphs, each satisfying classic properties such as Kunneth and Mayer-Vietoris theorems. Recent work of Asao has shown that…

It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these results rely on isoperimetric properties of the underlying…