Related papers: Soft edge results for longest increasing paths on …

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Reachability questions are one of the most fundamental algorithmic primitives in temporal graphs -- graphs whose edge set changes over discrete time steps. A core problem here is the NP-hard Short Restless Temporal Path: given a temporal…

We present a short and flexible improvement-of-flatness argument adapted to the setting of exterior domains, where one is naturally led to work with annuli instead of balls. As a model application in the classical setting of minimal…

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…

We prove a strong approximation result for the empirical process associated to a stationary sequence of real-valued random variables, under dependence conditions involving only indicators of half lines. This strong approximation result also…

We consider paths of steepest descent, in the complex plane, for the norm of a non-constant one variable polynomial $f$. We show that such paths, starting from a zero of the logarithmic derivative of $f$ and ending in a root of $f$, draw a…

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

We approach the issue of exponentiation of soft gauge boson corrections to scattering amplitudes from a path integral point of view. We show that if one represents the amplitude as a first quantized path integral in a mixed…

We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in…

We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…

We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation…

We consider the emergence of edge states in a finite optical lattice and show that the boundaries of the lattice play a decisive role for their location in the corresponding energy spectrum. We introduce a simple parametrisation of the…

We consider the boundary case (in the sense of Biggins and Kyprianou [Electron. J. Probab. 10 (2005) 609--631] in a one-dimensional super-critical branching random walk, and study the additive martingale $(W_n)$. We prove that, upon the…

We sharpen to nearly optimal the known asymptotic and explicit bounds for the number of $\mathbb{F}_q$-rational points on a geometrically irreducible hypersurface over a (large) finite field. The proof involves a Bertini-type probabilistic…

Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…

We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that…

We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…

We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comput. Sci. 770 (2019), 88--94] and, for any given constant…

The theory of P\'olya ensembles of positive definite random matrices provides structural formulas for the corresponding biorthogonal pair, and correlation kernel, which are well suited to computing the hard edge large $N$ asymptotics. Such…

We investigate the percolation properties of a planar reinforced network model. In this model, at every time step, every vertex chooses $k \ge 1$ incident edges, whose weight is then increased by 1. The choice of this $k$-tuple occurs…