Related papers: The sum of all width-one matrices

We introduce a general class of transport distances ${\rm WB}_{\Lambda}$ over the space of positive semi-definite matrix-valued Radon measures $\mathcal{M}(\Omega,\mathbb{S}_+^n)$, called the weighted Wasserstein-Bures distance. Such a…

Let R and S be two vectors of real numbers whose entries have the same sum. In the transportation problems one wishes to find a matrix A with row sum vector R and column sum vector S. If, in addition, the two vectors only contain…

Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent…

Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n…

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…

Starting from a sequence of independent Wright-Fisher diffusion processes on $[0,1]$, we construct a class of reversible infinite dimensional diffusion processes on $\DD_\infty:= \{{\bf x}\in Let $M$ be a complete Riemnnian manifold and…

In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…

Let $W_n$ denote the wheel graph having $n$-vertices. If $i$ and $j$ are any two vertices of $W_n$, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\]…

We investigate the transportation problem under a Monge cost structure and derive compact formulas for optimal dual solutions based on the northwest-corner rule. As an application illustrating how these formulas yield structural insight…

Mass sum rules for meson multiplets derived from exotic commutators may be written for complex masses. Then the real parts give the well known mass formulae (GM-O, Schwinger, Ideal) and the imaginary ones give the corresponding sum rules…

Consider an unweighted, directed graph $G$ with the diameter $D$. In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication time $\widetilde{O}(n^\omega)$. The framework is based on the…

The classical problem of computing a complete system of Stokes multipliers of a linear system of ODEs of rank one in terms of some connection coefficients of an associated hypergeometric system of ODEs, is solved with no genericness…

We investigate metric conditions that allow to prove existence and uniqueness of a map solving the Monge problem between two marginals in a metric (measure) space, proving two main results. Firstly, we introduce a nonsmooth version of the…

Non-negative matrix and tensor factorisations are a classical tool for finding low-dimensional representations of high-dimensional datasets. In applications such as imaging, datasets can be regarded as distributions supported on a space…

The inverse optimal transport problem is to find the underlying cost function from the knowledge of optimal transport plans. While this amounts to solving a linear inverse problem, in this work we will be concerned with the nonlinear…

This work considers minimizing a sum of convex functions, each with potentially different structure ranging from nonsmooth to smooth, Lipschitz to non-Lipschitz. Nesterov's universal fast gradient method provides an optimal black-box…

For a finite metric graph $X=(V,E,\ell)$, where $V$ is endowed with the shortest path metric, we consider the transportation cost problem associated with the distance $d$ on $V$. Namely, for $f$ a function with total sum 0 on $V$, write…

We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…

Transportation matrices are $m\times n$ non-negative matrices whose row sums and row columns are equal to, or dominated above with given integral vectors $R$ and $C$. Those matrices belong to a convex polytope whose extreme points have been…

Let $R$ and $B$ be two point sets in $\mathbb{R}^d$, with $|R|+ |B| = n$ and where $d$ is a constant. Next, let $\lambda : R \cup B \to \mathbb{N}$ such that $\sum_{r \in R } \lambda(r) = \sum_{b \in B} \lambda(b)$ be demand functions over…