Related papers: A decomposition theorem for balanced measures

Let $I=[0,1]$ and consider disjoint closed regions $G_{1},....,G_{n}$ in $% I\times I$ and subintervals $I_{1},......,I_{n},$ such that $G_{i}$ projects onto $I_{i.}$ We define the lower and upper maps $\tau_{1},$ $\tau_{2}$ by the lower…

We generalize to a broader class of decoupled measures a result of Ziv and Merhav on universal estimation of the specific cross (or relative) entropy for a pair of multi-level Markov measures. The result covers pairs of suitably regular…

The first three sections of this paper are a survey of the author's work on balanced metrics and stability notions in algebraic geometry. The last section is devoted to proving the well-known result that a geodesically convex function on a…

We show that every diffeomorphism with mostly contracting center direction exhibits a geometric-combinatorial structure, which we call \emph{skeleton}, that determines the number, basins and supports of the physical measures. Furthermore,…

Let $(T,d)$ be a metric space and $\phi:\mathbb{R}_+\to \mathbb{R}$ an increasing, convex function with $\phi(0)=0$. We prove that if $m$ is a probability measure $m$ on $T$ which is majorizing with respect to $d,\phi$, that is,…

We consider optimal transportation of measures on metric and topological spaces in the case where the cost function and marginal distributions depend on a parameter with values in a metric space. The Hausdorff distance between the sets of…

We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $\mu(\om)$ of (not necessarily compact) basic semi-algebraic sets$\om\subset\R^n$. We obtain two monotone (non increasing and non…

This paper studies the problem of estimation from relative measurements in a graph, in which a vector indexed over the nodes has to be reconstructed from pairwise measurements of differences between its components associated to nodes…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

We introduce, and partially resolve, a conjecture that brings a three-centuries-old derangements phenomenon and its much younger two-decades-old analogue under the same umbrella. Through a graph-theoretic lens, a derangement is a perfect…

Let $(X,T)$ and $(Y,S)$ be two topological dynamical systems, where $(X,T)$ has the weak specification property. Let $\xi$ be an invariant measure on the product system $(X\times Y, T\times S)$ with marginals $\mu$ on $X$ and $\nu$ on $Y$,…

A connected graph $G$ of diameter ${\rm diam}(G) \ge \ell$ is $\ell$-distance-balanced if $|W_{xy}|=|W_{yx}|$ for every $x,y\in V(G)$ with $d_{G}(x,y)=\ell$, where $W_{xy}$ is the set of vertices of $G$ that are closer to $x$ than to $y$.…

We consider a gas whose each particle is characterised by a pair $(x,v_x)$ with the position $x\in \mathbb R^d$ and the velocity $v_x\in \mathbb R^d_0= \mathbb R^d\setminus \{0\}$. We define Gibbs measures on the cone of vector-valued…

The invariant measure is a fundamental object in the theory of Markov processes. In finite dimensions a Markov process is defined by transition rates of the corresponding stochastic matrix. The Markov tree theorem provides an explicit…

The classical Choquet theorem establishes a barycentric decomposition for elements in a compact convex subset of a locally convex topological vector space. This decomposition is achieved through a probability measure that is supported on…

The main goal of this paper is to provide a connection between the generalized robustness of entanglement ($R_g$) and the geometric measure of entanglement ($E_{GME}$). First, we show that the generalized robustness is always higher than or…

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows…

A joint degree matrix (JDM) specifies the number of connections between nodes of given degrees in a graph, for all degree pairs and uniquely determines the degree sequence of the graph. We consider the space of all balanced realizations of…

The parameterized entanglement monotone, the $q$-concurrence, is also a reasonable parameterized entanglement measure. By exploring the properties of the $q$-concurrence with respect to the positive partial transposition and realignment of…