We study the couples finite Borel measures φ 0 and φ 1 with compact support in \( \mathbb{R}^n \) which can be transported to each other at a finite W α cost, where
the infimum is taken over real normal currents of finite mass and \( \mathbb{M}^{\alpha } \left( T \right) \) denotes the α-mass of T. Besides the class of α-irrigable measures (i.e., measures which can be transported to a Dirac measure with the appropriate total mass at a finite W α cost), two other important classes of measures are studied, which are called in the paper purely α-nonirrigable and marginally α-nonirrigable and are in a certain sense complementary to each other. For instance, purely α-nonirrigable and Ahlfors-regular measures are, roughly speaking, those having sufficiently high dimension. One shows that for φ 0 to be transported to φ 1 at finite W α cost their naturally defined purely α-nonirrigable parts have to coincide. Bibliography: 19 titles.
Similar content being viewed by others
References
E. N. Gilbert, “Minimum cost communication networks,” Bell System Tech. J. 46, 2209–2227 (1967).
S. Bhaskaran and F. J. M. Salzborn, “Optimal design of gas pipeline networks,” J. Oper. Res. Soc. 30, 1047–1060 (1979).
D. H. Lee, “Low cost drainage networks,” Networks 6, 351–371 (1976).
V. Caselles and J.-M. Morel, “Irrigation,” In: Variational Methods for Discontinuous Structures, Birkhäuser, Basel (2002), pp. 81–90.
F. Maddalena, S. Solimini, and J.-M. Morel, “A variational model of irrigation patterns,” Interfaces Free Bound. 5, No. 4, 391–415 (2003).
M. Bernot, V. Caselles, and J.-M. Morel, “Traffic plans,” Publ. Mat. 49, No. 2, 417–451 (2005).
M. Bernot, V. Caselles, and J.-M. Morel, “Are there infinite irrigation trees?” J. Math. Fluid Mech. 8, No. 3, 311–332 (2006).
M. Bernot, V. Caselles, and J.-M. Morel, “The structure of branched transportation networks,” Calc. Var. Partial Differ. Equations 32, No. 3, 279–317 (2006).
G. Devillanova and S. Solimini, “On the dimension of an irrigable measure,” Rend. Semin. Mat. Univ. Padova 117, 1–49 (2007).
F. Santambrogio, “Optimal channel networks, landscape function and branched transport,” Interfaces Free Bound. 9, No. 1, 149–169 (2007).
Q. Xia, “Optimal paths related to transport problems,” Commun. Contemp. Math. 5, No. 2, 251–279 (2003).
Q. Xia, “lnterior regularity of optimal transport paths,” Calc. Var. Partial Differ. Equations 20, No. 3, 283–299 (2004).
J.-M. Morel and F. Santambrogio, “Comparison of distances between measures,” Appl. Math. Lett. 20, No. 4, 427–432 (2007).
L. Ambrosio, N. Fusco, and D. Pallara, Functions of Bounded Variation and Free Discontinuity Problems, Oxford Univ. Press, Oxford (2000).
F. Morgan, Geometric Measure Theory. A Beginner’s Guide, Academic Press (1987).
L. Simon, Lectures on Geometric Measure Theory, Australian National Univ. Canberra (1983).
E. Paolini and E. Stepanov, “Optimal transportation networks as flat chains,” Interfaces Free Bound. 8, 393–436 (2006).
H. Federer, Geometric Measure Theory, Springer-Verlag (1969).
B. White, “Rectifiability of flat chains,” Ann. Math. 150, 165–184 (1999).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Problems in Mathematical Analysis 39 February, 2009, pp. 65–79.
Rights and permissions
About this article
Cite this article
Paolini, E., Stepanov, E. Connecting measures by means of branched transportation networks at finite cost. J Math Sci 157, 858–873 (2009). https://doi.org/10.1007/s10958-009-9362-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-009-9362-x