Skip to main content
SpringerLink
Log in

Lomonosov’s Turnip

  • Chapter
  • First Online:
Book cover Network Reliability

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSELECTRIC))

Abstract

Lomonosov’s turnip is a very powerful Monte Carlo algorithm for estimating Network reliability. It was invented by M.V. Lomonosov in 1986 and first described in [1]. This algorithm is applicable to finding the probability of network terminal (or all-node) connectivity probability for the case of arbitrary values of edge (or node) failure probabilities. An outstanding feature of this algorithm is that it enables obtaining estimates with high accuracy for very small network failure probabilities known as “rare event situation”. The name “turnip” comes from a diagram reminding a turnip which describes so-called evolution process which is central to the main idea of the algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Lomonosov, M. (1994). On Monte Carlo estimates in network reliability. Probability in the Engineering and Informational Sciences, 8, 245–264.

    Article  Google Scholar 

  2. Elperin, T., Gertsbakh, I. B., & Lomonosov, M. (1991). Estimation of network reliability using graph evolution models. IEEE Transactions on Reliability, 40(5), 572–581.

    Article  Google Scholar 

  3. Gertsbakh, I., & Shpungin, Y. (2009). Models of network reliability: Analysis, combinatorics and Monte Carlo. Boca Raton: CRC Press.

    MATH  Google Scholar 

  4. Lomonosov, M., & Shpungin, Y. (1999). Combinatorics and reliability Monte Carlo. Random Structures and Algorithms, 14, 329–343.

    Article  MathSciNet  Google Scholar 

  5. Gertsbakh, I., & Shpungin, Y. (2011). Network reliability and resilience. New York: Springer.

    Google Scholar 

  6. Gertsbakh, I., Shpungin, Y., & Vaisman, R. (2014). Network reliability Monte Carlo with nodes subject to failure. International Journal of Performability Engineering, 10(2), 161–170.

    MATH  Google Scholar 

  7. Kroese, D., Taimre, T., & Botev, Z. I. (2011). Handbook of Monte Carlo methods. New York: Wiley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ben Gurion University, Beer-Sheva, Israel

    Ilya Gertsbakh

  2. Software Engineering Department, Shamoon College of Engineering, Beer-Sheva, Israel

    Yoseph Shpungin

Authors
  1. Ilya Gertsbakh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoseph Shpungin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilya Gertsbakh .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Gertsbakh, I., Shpungin, Y. (2020). Lomonosov’s Turnip. In: Network Reliability. SpringerBriefs in Electrical and Computer Engineering. Springer, Singapore. https://doi.org/10.1007/978-981-15-1458-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-1458-6_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-1457-9

  • Online ISBN: 978-981-15-1458-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation