Skip to main content
SpringerLink
Log in

Probabilistic Properties of Topologies of Minimal Fillings of Finite Metric Spaces

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

Abstract

In this work, we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, obtained from the analytical solution, coincide with the computer simulation for the computed cases. Also the developed technique makes it possible to find the asymptotic of the ratio for families of graph structures.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. A. Y. Eremin, “A formula for the weight of a minimal filling of a finite metric space,” Sb. Math., 204, No. 9, 1285–1306 (2013).

    Article  MATH  MathSciNet  Google Scholar 

  2. M. R. Garey, R. L. Graham, and D. S. Johnson, “The complexity of computing Steiner minimal trees,” SIAM J. Appl. Math., 32, 835–859 (1977).

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Gromov, “Filling Riemannian manifolds,” J. Differ. Geom., 18, 1–147 (1983).

    MATH  MathSciNet  Google Scholar 

  4. A. O. Ivanov and A. A. Tuzhilin, Extreme Networks Theory [in Russian], Inst. Komp’yut. Issled., Moscow, Izhevsk (2003).

    Google Scholar 

  5. A. O. Ivanov and A. A. Tuzhilin, “One-dimensional Gromov minimal filling problem,” Sb. Math., 203, No. 5, 677–726 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  6. R. M. Karp, “Reducibility among combinatorial problems,” in: R. E. Miller and J. W. Thatcher, eds., Complexity of Computer Computations: Proc. of a Symp. on the Complexity of Computer Computations, IBM Res. Symp. Ser., Plenum, New York (1972), pp. 85–103.

  7. Z. N. Ovsyannikov, “Generalized additive spaces,” in press.

  8. K. A. Zareckiy, “Constructing a tree on the basis of a set of distances between the hanging vertices,” Usp. Mat. Nauk, 20, No. 6, 90–92 (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia

    V. Salnikov

  2. Yaroslavl State University, Delone Laboratory of Discrete and Computational Geometry, Yaroslavl, Russia

    V. Salnikov

Authors
  1. V. Salnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. Salnikov.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 18, No. 2, pp. 181–196, 2013.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Salnikov, V. Probabilistic Properties of Topologies of Minimal Fillings of Finite Metric Spaces. J Math Sci 203, 873–883 (2014). https://doi.org/10.1007/s10958-014-2179-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-014-2179-2

Keywords

Search

Navigation