Related papers: Optimal Shifting Method in Dirichlet's divisor pro…
We propose a technique for interpolating between probability distributions on discrete surfaces, based on the theory of optimal transport. Unlike previous attempts that use linear programming, our method is based on a dynamical formulation…
In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph modes. Unlike the…
Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy…
We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…
The Piltz divisor problem is a natural generalization of the classical Dirichlet divisor problem. In this paper, we study this problem over number fields and obtain improved $\Omega-$bounds for its error terms. Our approach involves…
Many offline unsupervised change point detection algorithms rely on minimizing a penalized sum of segment-wise costs. We extend this framework by proposing to minimize a sum of discrepancies between segments. In particular, we propose to…
We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it…
In this paper we study the subset sum problem with real numbers. Starting from the given problem, we formulate a quadratic maximization problem over a polytope which is eventually written as a distance maximization to a fixed point. For…
We present recent advances on Dirichlet forms methods either to extend financial models beyond the usual stochastic calculus or to study stochastic models with less classical tools. In this spirit, we interpret the asymptotic error on the…
We propose two methods to find a proper shift parameter in the shift-and-invert method for computing matrix exponential matrix-vector products. These methods are useful in the case of matrix exponential action has to be computed for a…
As in algebraic geometry, an effective divisor class on a vertex-weighted graph is called special if also its residual class is effective. We study the question, when this is true already on the level of divisors; that is, when there exists…
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
We define a new family of similarity and distance measures on graphs, and explore their theoretical properties in comparison to conventional distance metrics. These measures are defined by the solution(s) to an optimization problem which…
In this paper we prove optimal error estimates for {solutions with natural regularity} of the equations describing the unsteady motion of incompressible shear-thinning fluids. We consider a full space-time semi-implicit scheme for the…
We study a shape optimization problem for the first eigenvalue of an elliptic operator in divergence form, with non constant coefficients, over a fixed domain $\Omega$. Dirichlet conditions are imposed along $\partial \Omega$ and, in…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We investigate numerically the optimal constants in Lieb-Thirring inequalities by studying the associated maximization problem. We use a monotonic fixed-point algorithm and a finite element discretization to obtain trial potentials which…
The optimal transport (OT) problem aims to find the most efficient mapping between two probability distributions under a given cost function, and has diverse applications in many fields such as machine learning, computer vision and computer…
The Dirichlet divisor problem is used as a model to give a conjecture concerning the conditional convergence of the Dirichlet series of an L-function.