Related papers: Kleinberg navigation on anisotropic lattices
This paper proposes a novel reinforcement learning framework to address the Liner Shipping Network Design Problem (LSNDP), a challenging combinatorial optimization problem focused on designing cost-efficient maritime shipping routes.…
We study the stability of entropically regularized optimal transport with respect to the marginals. Given marginals converging weakly, we establish a strong convergence for the Schr\"odinger potentials describing the density of the optimal…
We study the variational problem of finding the fastest path between two points that belong to different anisotropic media, each with a prescribed speed profile and a common interface. The optimal curves are Finsler geodesics that are…
Robustness of deep neural networks against adversarial perturbations is a pressing concern motivated by recent findings showing the pervasive nature of such vulnerabilities. One method of characterizing the robustness of a neural network…
Transmission line failures in power systems propagate non-locally, making the control of the resulting outages extremely difficult. In this work, we establish a mathematical theory that characterizes the patterns of line failure propagation…
Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…
We study the Laplacian-infinity path as an extreme case of the Laplacian-alpha random walk. Although, in the finite alpha case, there is reason to believe that the process converges to SLE, we show that this is not the case when alpha is…
We study the problem of finding a minimum weight connected subgraph spanning at least $k$ vertices on planar, node-weighted graphs. We give a $(4+\eps)$-approximation algorithm for this problem. We achieve this by utilizing the recent LMP…
We study the error of the number of unimodular lattice points that fall into a dilated and centred ellipse around $0$. We first show that the study of the error, when the error is normalized by $\sqrt{t}$ with $t$ the parameter of…
Recently Grassberger has shown that the correction to scaling for the conductance of a bond percolation network on a square lattice is a nonmonotonic function of the linear lattice dimension with a minimum at $L = 10$, while this anomalous…
We study in this paper optimal mass transport over a strongly connected, directed graph on a given discrete time interval. Differently from previous literature, we do not assume full knowledge of the initial and final goods distribution…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
Hyperbolicity is a property of a graph that may be viewed as being a "soft" version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…
Topic of the thesis is a theoretical description of the ultracold atomic gases in one- and two-dimensional optical lattices in the presence of the disorder leading to the Anderson localization. The disorder is created by interaction of the…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
Motivated by recent experiments with ultra-cold matter, we derive a new bound on the propagation of information in $D$-dimensional lattice models exhibiting $1/r^{\alpha}$ interactions with $\alpha>D$. The bound contains two terms: One…
We consider the adaptive shortest-path routing problem in wireless networks under unknown and stochastically varying link states. In this problem, we aim to optimize the quality of communication between a source and a destination through…
We consider a system of classical Heisenberg spins on a cubic lattice in dimensions three or more, interacting via the dipole-dipole interaction. We prove that at low enough temperature the system displays orientational long range order, as…
We consider the Lagrange problem of optimal control with unrestricted controls and address the question: under what conditions we can assure optimal controls are bounded? This question is related to the one of Lipschitzian regularity of…