Skip to main content
Log in

Connecting measures by means of branched transportation networks at finite cost

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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

$$ W^{\alpha } \left( {\varphi_0, \varphi_1 } \right): = \inf \left\{ {\mathbb{M}^{\alpha} \left( T \right):\partial T = \varphi_0 - \varphi_1} \right\},\quad \alpha \in \left[ {0,1} \right], $$

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. N. Gilbert, “Minimum cost communication networks,” Bell System Tech. J. 46, 2209–2227 (1967).

    Google Scholar 

  2. S. Bhaskaran and F. J. M. Salzborn, “Optimal design of gas pipeline networks,” J. Oper. Res. Soc. 30, 1047–1060 (1979).

    Article  MATH  Google Scholar 

  3. D. H. Lee, “Low cost drainage networks,” Networks 6, 351–371 (1976).

    Article  MATH  Google Scholar 

  4. V. Caselles and J.-M. Morel, “Irrigation,” In: Variational Methods for Discontinuous Structures, Birkhäuser, Basel (2002), pp. 81–90.

    Google Scholar 

  5. F. Maddalena, S. Solimini, and J.-M. Morel, “A variational model of irrigation patterns,” Interfaces Free Bound. 5, No. 4, 391–415 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Bernot, V. Caselles, and J.-M. Morel, “Traffic plans,” Publ. Mat. 49, No. 2, 417–451 (2005).

    MATH  MathSciNet  Google Scholar 

  7. M. Bernot, V. Caselles, and J.-M. Morel, “Are there infinite irrigation trees?” J. Math. Fluid Mech. 8, No. 3, 311–332 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  8. 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).

    Article  MathSciNet  Google Scholar 

  9. G. Devillanova and S. Solimini, “On the dimension of an irrigable measure,” Rend. Semin. Mat. Univ. Padova 117, 1–49 (2007).

    MATH  MathSciNet  Google Scholar 

  10. F. Santambrogio, “Optimal channel networks, landscape function and branched transport,” Interfaces Free Bound. 9, No. 1, 149–169 (2007).

    MATH  MathSciNet  Google Scholar 

  11. Q. Xia, “Optimal paths related to transport problems,” Commun. Contemp. Math. 5, No. 2, 251–279 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  12. Q. Xia, “lnterior regularity of optimal transport paths,” Calc. Var. Partial Differ. Equations 20, No. 3, 283–299 (2004).

    Article  MATH  Google Scholar 

  13. J.-M. Morel and F. Santambrogio, “Comparison of distances between measures,” Appl. Math. Lett. 20, No. 4, 427–432 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  14. L. Ambrosio, N. Fusco, and D. Pallara, Functions of Bounded Variation and Free Discontinuity Problems, Oxford Univ. Press, Oxford (2000).

    MATH  Google Scholar 

  15. F. Morgan, Geometric Measure Theory. A Beginner’s Guide, Academic Press (1987).

  16. L. Simon, Lectures on Geometric Measure Theory, Australian National Univ. Canberra (1983).

    MATH  Google Scholar 

  17. E. Paolini and E. Stepanov, “Optimal transportation networks as flat chains,” Interfaces Free Bound. 8, 393–436 (2006).

    MATH  MathSciNet  Google Scholar 

  18. H. Federer, Geometric Measure Theory, Springer-Verlag (1969).

  19. B. White, “Rectifiability of flat chains,” Ann. Math. 150, 165–184 (1999).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eugene Stepanov.

Additional information

Translated from Problems in Mathematical Analysis 39 February, 2009, pp. 65–79.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-009-9362-x

Keywords

Navigation