$W_{1,+}$-interpolation of probability measures on graphs
نویسندگان
چکیده
منابع مشابه
W1,+-interpolation of probability measures on graphs
We generalize an equation introduced by Benamou and Brenier in [BB00] and characterizing Wasserstein Wp-geodesics for p > 1, from the continuous setting of probability distributions on a Riemannian manifold to the discrete setting of probability distributions on a general graph. Given an initial and a final distributions (f0(x))x∈G, (f1(x))x∈G, we prove the existence of a curve (ft(x))t∈[0,1],x...
متن کاملProbability on Graphs
The random assignment problem is to minimize the cost of an assignment in a n×n matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider both uniform distributions on 1, 2, . . . , m, for m = n or n, and random permutations of 1, 2, . . . , n for each row, or of 1, 2, . . . , n for the whole matrix. We find the limit of the expected cos...
متن کاملProbability and Interpolation
An m x n matrix E with n ones and (m — l)/i zeros, which satisfies the Polya condition, may be regular and singular for Birkhoff interpolation. We prove that for random distributed ones, E is singular with probability that converges to one if m, n -» oo. Previously, this was known only if m > (1 + 8)n/log n. For constant m and n -» oo, the probability is asymptotically at least i.
متن کاملOn an interpolation property of outerplanar graphs
LetD be an acyclic orientation of a graphG.An arc ofD is said to be dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs inD. Define dmin(G) (dmax(G)) to be theminimum (maximum) number of d(D) over all acyclic orientationsD ofG.We determine dmin(G) for an outerplanar graph G and prove that G has an acyclic orientation with exactly k dependent arcs if ...
متن کاملGeodesic of Minimal Length in the Set of Probability Measures on Graphs
We endow the set of probability measures on a weighted graph with a Monge– Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have n vertices and so, the boundary of the probability simplex is an affine (n − 2)– chain. Characterizing the geodesics of minimal length which may intersect the boundary, is a challenge we overcome even when the endpoints...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2014
ISSN: 1083-6489
DOI: 10.1214/ejp.v19-3336