Related papers: A decomposition theorem for balanced measures

Let $\mu$ be a probability measure on the real line. In this paper we prove that there exists a decomposition $\mu = \mu_{0} \boxplus \mu_{1} \boxplus \... \boxplus \mu_{n} \boxplus \...$ such that $\mu_{0}$ is infinitely divisible and…

We propose a "decomposition method" to prove non-asymptotic bound for the convergence of empirical measures in various dual norms. The main point is to show that if one measures convergence in duality with sufficiently regular observables,…

We consider the following convolution equation or equivalently stochastic difference equation $$\lam _k = \mu _k*\phi (\lam _{k-1}), k \in \Z \eqno (1) $$ for a given bi-sequence $(\mu _k)$ of probability measures on $\R ^d$ and a linear…

Let $(X,\mu)$ be a standard probability space. An automorphism $T$ of $(X,\mu)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less…

We introduce a notion of vague convergence for random marked metric measure spaces. Our main result shows that convergence of the moments of order $k \ge 1$ of a random marked metric measure space is sufficient to obtain its vague…

A measurable map between measure spaces is shown to have bounded compression if and only if its image via the measure-algebra functor is Lipschitz-continuous w.r.t. the measure-algebra distances. This provides a natural interpretation of…

Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…

We consider a separation problem where the observation consists of the sum of a high amplitude smooth signal and a low amplitude transient signal. We propose a method for decomposition that relies on solving instances of a `constrained…

Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…

We examine Fourier frames and, more generally, frame measures for different probability measures. We prove that if a measure has an associated frame measure, then it must have a certain uniformity in the sense that the weight is distributed…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

Let $(X, \mathcal{B}, \mu)$ be a probability measure space and $T_1$, $T_2$, $T_3$ three not necessarily commuting measure preserving transformations on $(X, \mathcal{B}, \mu)$. We prove that for all bounded functions $f_1$, $f_2$, $f_3$…

Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. When the…

There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the…

Consider a simple locally finite hypergraph on a countable vertex set, where each edge represents one unit of load which should be distributed among the vertices defining the edge. An allocation of load is called balanced if load cannot be…

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

Decompositions of the world into systems have typically been regarded as arbitrary extra-theoretical assumptions in discussions of quantum measurement. One can instead regard decompositions as part of the theory, and ask what conditions…

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…

A recent paper by Cordero-Erausquin and Klartag provides a characterization of the measures $\mu$ on $\R^d$ which can be expressed as the moment measures of suitable convex functions $u$, i.e. are of the form $(\nabla u)\_\\#e^{- u}$ for…