相关论文: One-point large deviations of the directed landsca…

Brownian motion is a continuum scaling limit for a wide class of random processes, and there has been great success in developing a theory for its properties (such as distribution functions or regularity) and expanding the breadth of its…

Let $G$ be a simple connected graph, and $D(G)$ be the distance matrix of $G$. Suppose that $D_{\max}(G)$ and $\lambda_1(G)$ are the maximum row sum and the spectral radius of $D(G)$, respectively. In this paper, we give a lower bound for…

Current differentiable renderers provide light transport gradients with respect to arbitrary scene parameters. However, the mere existence of these gradients does not guarantee useful update steps in an optimization. Instead, inverse…

Decentralized optimization has become a fundamental tool for large-scale learning systems; however, most existing methods rely on the classical Lipschitz smoothness assumption, which is often violated in problems with rapidly varying…

We study the topological dynamics of H\'enon maps. For a parameter set generalizing the Benedicks-Carleson parameters (the Wang-Young parameter set) we obtain the following: The pruning front conjecture (due to Cvitanovi\'c); A kneading…

The diameter of an undirected unweighted graph $G=(V,E)$ is the maximum value of the distance from any vertex $u$ to another vertex $v$ for $u,v \in V$ where distance i.e. $d(u,v)$ is the length of the shortest path from $u$ to $v$ in $G$.…

We prove that for every set $S$ of vertices of a directed graph $D$, the maximum number of vertices in $S$ contained in a collection of vertex-disjoint cycles in $D$ is at least the minimum size of a set of vertices that hits all cycles…

In this paper, we are interested in the mixing behaviour of simple random walks on inhomogeneous directed graphs. We focus our study on the Chung-Lu digraph, which is an inhomogeneous network that generalizes the Erd\H{o}s-R\'enyi digraph.…

We consider planar directed last-passage percolation on the square lattice with general i.i.d. weights and study the geometry of the full set of semi-infinite geodesics in a typical realization of the random environment. The structure of…

We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…

Monitoring edge-geodetic sets in a graph are subsets of vertices such that every edge of the graph must lie on all the shortest paths between two vertices of the monitoring set. These objects were introduced in a work by Foucaud, Krishna…

We consider weighted geodesic random walks in a complete Riemannian manifold $(M,g)$. We show that for almost all sequences of weights (with respect to a suitable measure), these weighted geodesic random walks satisfy, when suitably scaled,…

Heat flows in 1+1 dimensional stochastic environment converge after scaling to the random geometry described by the directed landscape. In this first part, we show that the O'Connell-Yor polymer and the KPZ equation converge to the KPZ…

A vertex $w$ resolves two vertices $u$ and $v$ in a directed graph $G$ if the distance from $w$ to $u$ is different to the distance from $w$ to $v$. A set of vertices $R$ is a resolving set for a directed graph $G$ if for every pair of…

We consider the problem of learning a one-hidden-layer neural network: we assume the input $x\in \mathbb{R}^d$ is from Gaussian distribution and the label $y = a^\top \sigma(Bx) + \xi$, where $a$ is a nonnegative vector in $\mathbb{R}^m$…

A well-known question in planar first-passage percolation concerns the convergence of the empirical distribution of weights as seen along geodesics. We demonstrate this convergence for an explicit model, directed last-passage percolation on…

The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot…

We study first order methods to compute the barycenter of a probability distribution $P$ over the space of probability measures with finite second moment. We develop a framework to derive global rates of convergence for both gradient…

A famous conjecture by Thomassen from 1983 asserts that for any given $k,g\in \mathbb{N}$ there exists some $d=d(k,g)\in \mathbb{N}$ such that every graph of minimum degree at least $d$ contains a subgraph of minimum degree at least $k$ and…

The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph with given diameter and degree parameters. Similarly the \emph{degree/geodecity} problem concerns the smallest order of a $k$-geodetic mixed…