Related papers: On the one dimensional Euclidean matching problem:…
We present a study of the distance between a Brownian motion and a submanifold of a complete Riemannian manifold. We include a variety of results, including an inequality for the Laplacian of the distance function derived from a Jacobian…
We solve the Random Euclidean Matching problem with exponent 2 for the Gaussian distribution defined on the plane. Previous works by Ledoux and Talagrand determined the leading behavior of the average cost up to a multiplicative constant.…
The classical Melan equation modeling suspension bridges is considered. We first study the explicit expression and the uniform positivity of the analytical solution for the simplified ``less stiff'' model, based on which we develop a…
We analyze a token-based Brownian circuit in which Brownian particles, coined `tokens,' move randomly by exploiting thermal fluctuations, searching for a path in multi-token state space corresponding to the solution of a given problem. The…
It is known that the Brownian bridge or L\'evy-Ciesielski construction of Brownian paths almost surely converges uniformly to the true Brownian path. In the present article the focus is on the uniform error. In particular, we show…
We introduce and study Brownian bridges to submanifolds. Our method involves proving a general formula for the integral over a submanifold of the minimal heat kernel on a complete Riemannian manifold. We use the formula to derive lower…
We study some optimal control problems on networks with junctions, approximate the junctions by a switching rule of delay-relay type and study the passage to the limit when $\varepsilon$, the parameter of the approximation, goes to zero.…
We consider two formulations of the random-link fractional matching problem, a relaxed version of the more standard random-link (integer) matching problem. In one formulation, we allow each node to be linked to itself in the optimal…
In the Euclidean $k$-means problems we are given as input a set of $n$ points in $\mathbb{R}^d$ and the goal is to find a set of $k$ points $C\subseteq \mathbb{R}^d$, so as to minimize the sum of the squared Euclidean distances from each…
This thesis is devoted to studying two tasks: refrigeration and the creation of correlations. In the refrigeration part, two different paradigms of cooling, namely coherent and incoherent, are defined. The connection that these paradigms…
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer…
Correlations lie at the heart of almost all scientific predictions. It is therefore of interest to ask whether there exist general limitations to the amount of correlations that can be created at a finite amount of invested energy. Within…
We consider the Euclidean bi-chromatic matching problem in the dynamic setting, where the goal is to efficiently process point insertions and deletions while maintaining a high-quality solution. Computing the minimum cost bi-chromatic…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
We consider a directed random walk making either 0 or $+1$ moves and a Brownian bridge, independent of the walk, conditioned to arrive at point $b$ on time $T$. The Hamiltonian is defined as the sum of the square of increments of the bridge…
We present first results of our study on the Euclidean topological charge density correlation function. In order to get a well defined topological charge density and to improve the signal of the correlation function at large separations we…
The model consists of a signal process $X$ which is a general Brownian diffusion process and an observation process $Y$, also a diffusion process, which is supposed to be correlated to the signal process. We suppose that the process $Y$ is…
Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…
Given a graph $G=(V,E)$ with costs on its edges, the minimum-cost edge cover problem consists of finding a subset of $E$ covering all vertices in $V$ at minimum cost. If $G$ is bipartite, this problem can be solved in time $O(|V|^3)$ via a…
We consider a set of Euclidean optimization problems in one dimension, where the cost function associated to the couple of points $x$ and $y$ is the Euclidean distance between them to an arbitrary power $p\ge1$, and the points are chosen at…