相关论文: On the one dimensional Euclidean matching problem:…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
The complete physical understanding of the optimization of the thermodynamic work still is an important open problem in stochastic thermodynamics. We address this issue using the Hamiltonian approach of linear response theory in finite time…
The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the…
We study the Dirichlet problem associated to the equation for self-similar surfaces for graphs over the Euclidean plane with a disk removed. We show the existence of a solution provided the boundary conditions on the boundary circle are…
Broyden's method is a general method commonly used for nonlinear systems of equations, when very little information is available about the problem. We develop an approach based on Broyden's method for nonlinear eigenvalue problems. Our…
We solve two stochastic control problems in which a player tries to minimize or maximize the exit time from an interval of a Brownian particle, by controlling its drift. The player can change from one drift to another but is subject to a…
We study the law of the minimum of a Brownian bridge, conditioned to take specific values at specific points, and the law of the location of the minimum. They are used to compare some non-adaptive optimisation algorithms for black-box…
We identify the distribution of a natural triplet associated with the pseudo-Brownian bridge. In particular, for $B$ a Brownian motion and $T_1$ its first hitting time of the level one, this remarkable law allows us to understand some…
We show that simple explicit formulas can be obtained for several relevant quantities related to the laws of the uniformly sampled Brownian bridge, Brownian meander and three dimensional Bessel process. To prove such results, we use the…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
Consider the length $L_{MM}^E$ of the minimum matching of N points in d-dimensional Euclidean space. Using numerical simulations and the finite size scaling law $< L_{MM}^E > = \beta_{MM}^E(d) N^{1-1/d}(1+A/N+... )$, we obtain precise…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…
We consider combinatorial optimization problems defined over random ensembles, and study how solution cost increases when the optimal solution undergoes a small perturbation delta. For the minimum spanning tree, the increase in cost scales…
Considering the paradigmatic driven Brownian motion, we perform extensive numerical analysis on the performance of optimal linear-response processes far from equilibrium. We focus on the overdamped regime where exact optimal processes are…
An expansion in the number of spatial covariant derivatives is carried out to compute the $\zeta$-function regularized effective action of 2+1-dimensional fermions at finite temperature in an arbitrary non-Abelian background. The real and…
The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a $1-\epsilon$ approximation to the multicommodity flow problem on graphs is a well-studied problem.…
The general, multidimensional barrier crossing problem for diffusive processes under the action of conservative forces is studied with the goal of developing tractable approximations. Particular attention is given to the effect of different…
In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph $G$ on two sets of points $A$ and $B$ in $\mathbb{R}^2$ and the weight of each…
We provide a probabilistic approach to studying minimal surfaces in three-dimensional Euclidean space. Following a discussion of the basic relationship between Brownian motion on a surface and minimality of the surface, we introduce a way…
Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known…