Related papers: Finer estimates on the 2-dimensional matching prob…
This paper aims to investigate the distributed stochastic optimization problems on compact embedded submanifolds (in the Euclidean space) for multi-agent network systems. To address the manifold structure, we propose a distributed…
We investigate the problem of Min-cost Perfect Matching with Delays (MPMD) in which requests are pairwise matched in an online fashion with the objective to minimize the sum of space cost and time cost. Though linear-MPMD (i.e., time cost…
Given a compactly supported probability measure on a Riemannian manifold, we study the asymptotic speed at which it can be approximated (in Wasserstein distance of any exponent p) by finitely supported measure. This question has been…
We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle.…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
An emerging line of work has shown that machine-learned predictions are useful to warm-start algorithms for discrete optimization problems, such as bipartite matching. Previous studies have shown time complexity bounds proportional to some…
We propose a method to extend the fast on-the-fly weight determination scheme for simulated tempering to two-dimensional space including not only temperature but also pressure. During the simulated tempering simulation, weight parameters…
Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
We investigate the so-called recoverable robust assignment problem on balanced bipartite graphs with $2n$ vertices, a mainstream problem in robust optimization: For two given linear cost functions $c_1$ and $c_2$ on the edges and a given…
We get back to the computation of the leading finite size corrections to some random link matching problems, first adressed by Mezard and Parisi [J. Physique 48 (1987) 1451-1459]. In the so-called bipartite case, their result is in…
We study the problems of asymptotic and approximate consensus in which agents have to get their values arbitrarily close to each others' inside the convex hull of initial values, either without or with an explicit decision by the agents. In…
In this paper, we derive an asymptotic error expansion for the eigenvalue approximations by the lowest order Raviart-Thomas mixed finite element method for the general second order elliptic eigenvalue problems. Extrapolation based on such…
We study the problem of predicting the results of computations that are too expensive to run, via the observation of the results of smaller computations. We model this as an online learning problem with delayed feedback, where the length of…
In this paper we study the quantization problem for probability measures on Riemannian manifolds. Under a suitable assumption on the growth at infinity of the measure we find asymptotic estimates for the quantization error, generalizing the…
We propose a novel penalty method framework for the non-self-adjoint topology optimization problems, taking compliant mechanism problems as an example, by incorporating a convex nonlocal perimeter approximation scheme. We rigorously analyze…
We discuss the equivalence relation between the Euclidean bipartite matching problem on the line and on the circumference and the Brownian bridge process on the same domains. The equivalence allows us to compute the correlation function and…
We investigate the asymptotic behavior, in the long time limit, of the random homology associated to realizations of stochastic diffusion processes on a compact Riemannian manifold. In particular a rigidity result is established: if the…
In this paper we investigate the asymptotic behavior and decay of the solution of the discrete in time $N$-dimensional heat equation. We give a convergence rate with which the solution tends to the discrete fundamental solution, and the…
We consider the assignment problem between two sets of $N$ random points on a smooth, two-dimensional manifold $\Omega$ of unit area. It is known that the average cost scales as $E_{\Omega}(N)\sim\frac{1}{2\pi}\ln N$ with a correction that…