Related papers: Kleinberg navigation on anisotropic lattices
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
We study an optimal stretching problem, which is a variant lattice point problem, for convex domains in $\mathbb{R}^d$ ($d\geq 2$) with smooth boundary of finite type that are symmetric with respect to each coordinate hyperplane/axis. We…
We study numerically a spreading of an initially localized wave packet in a one-dimensional discrete nonlinear Schr\"odinger lattice with disorder. We demonstrate that above a certain critical strength of nonlinearity the Anderson…
In the absence of nonlinearity all normal modes (NMs) of a chain with disorder are spatially localized (Anderson localization). We study the action of nonlinearity, whose strength is ramped linearly in time. It leads to a spreading of a…
Systems with local dynamics are characterized by a finite velocity of propagation of perturbations, known as the Lieb-Robinson velocity. On the other hand, irreducible stochastic processes drive states towards some unique fixed point.…
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light on data sciences.…
This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence…
Monte Carlo simulations have been used to study a discretized Heisenberg ferromagnet (FM) with random uniaxial single-site anisotropy on $L \times L \times L$ simple cubic lattices, for $L$ up to 64. The spin variable on each site is chosen…
The maximum-entropy sampling problem is the NP-hard problem of maximizing the (log) determinant of an order-$s$ principle submatrix of a given order $n$ covariance matrix $C$. Exact algorithms are based on a branch-and-bound framework. The…
We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable…
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
We study sampling from a target distribution ${\nu_* = e^{-f}}$ using the unadjusted Langevin Monte Carlo (LMC) algorithm. For any potential function $f$ whose tails behave like ${\|x\|^\alpha}$ for ${\alpha \in [1,2]}$, and has…
Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
Motivated by applications in deep learning, where the global Lipschitz continuity condition is often not satisfied, we examine the problem of sampling from distributions with super-linearly growing log-gradients. We propose a novel tamed…
As the length scales of the smallest technology continue to advance beyond the micron scale it becomes increasingly important to equip robotic components with the means for intelligent and autonomous decision making with limited…
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…
We consider the Zermelo navigation problem on the ellipsoid of revolution (spheroid) in the presence of a perturbation $W$ determined by a mild velocity vector field, $|W|<1$, with application of Finsler metric of Randers type in the…
We obtain lower bound for the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion.
Findings by M. L. Lyra, S. Mayboroda and M. Filoche relate invertibility and positivity of a class of discrete Schr\"odinger matrices with the existence of the "Landscape Function", which provides an upper bound on all eigenvectors…