Related papers: On the stability of solutions to random optimizati…
We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite temperature traveling salesman problem on several…
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for…
We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: given a set of $n$ points in the plane, compute a shortest…
The 2-Opt heuristic is a simple improvement heuristic for the Traveling Salesman Problem. It starts with an arbitrary tour and then repeatedly replaces two edges of the tour by two other edges, as long as this yields a shorter tour. We will…
Intriguing symmetries are uncovered regarding all magic squares of orders 3, 4, and 5, with 1, 880, and 275,305,224 distinct configurations, respectively. In analogy with the travelling salesman problem, the distributions of the total…
We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…
We study the stability of symmetric trajectories of a particle on the Lie group $SO(3)$ whose motion is governed by an $SO(3)\times SO(2)$ invariant metric and an $SO(2)\times SO(2)$ invariant potential. Our method is to reduce the number…
Update rules for learning in dynamic time warping spaces are based on optimal warping paths between parameter and input time series. In general, optimal warping paths are not unique resulting in adverse effects in theory and practice. Under…
Recent papers have shown optimally-competitive on-line strategies for a robot traveling from a point $s$ to a point $t$ in certain unknown geometric environments. We consider the question: Having gained some partial information about the…
Solutions of an optimization problem are sensitive to changes caused by approximations or parametric perturbations, especially in the nonconvex setting. This paper shows that solutions of substitute problems, constructed from Rockafellian…
Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the…
This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…
We consider, in the Aw-Rascle-Zhang traffic flow model, the problem of the asymptotic stability of constant flows. By using a perturbative approach, we show the stability in a larger space of perturbation than previous results. Furthermore,…
Given a set $P$ of $n$ points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is rectilinear when the points lie in the plane and the distance…
We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…
Atypically large fluctuations in macroscopic non-equilibrium systems continue to attract interest. Their probability can often be determined by the optimal fluctuation method (OFM). The OFM brings about a conditional variational problem,…
The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances…
We study local features, and provide a topological insight into the global structure of the probability density distribution and of the pattern of the optimal paths for large rare fluctuations away from a stable state. In contrast to…