Skip to main content

Discussions on the Connectedness of a Random Closed Set

  • Conference paper
  • First Online:
Belief Functions: Theory and Applications (BELIEF 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12915))

Included in the following conference series:

Abstract

This work studies the connectedness of a random closed set in a Euclidean space. The well-known Choquet-Kendall-Matheron theorem states that a random closed set is characterized by its capacity functional. Consequently, any topological property must be also determined by such functional. In this work we consider connectedness. Under mild conditions, this property can be determined by taking into account only the capacity functional valued on predetermined finite families of compact and convex sets. The technique is based on the construction of an abstract simplicial complex associated with a cover of the support of the random closed set. We consider a new application in Probability, where we are able to approximate some probability computations.

By project PGC2018-098623-B-I00.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Similar content being viewed by others

References

  1. Bhattacharyya, P., Chakrabarti, B.K.: The mean distance to the nth neighbour in a uniform distribution of random points: an application of probability theory. Eur. J. Phys. 29, 639–645 (2008)

    Google Scholar 

  2. Cavanna, N.J., Sheehy, D.R.: The generalized persistent nerve theorem. arXiv preprint arXiv:1807.07920 (2008)

  3. Fritsch, R., Piccinini, R.: Cellular Structures in Topology. Cambridge University Press, Cambridge (1990)

    Google Scholar 

  4. Govc, D., Skraba, P.: An approximate nerve theorem. Found. Comput. Math. 18(5), 1245–1297 (2018)

    Article  MathSciNet  Google Scholar 

  5. Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2005)

    Google Scholar 

  6. Molchanov, I.: Theory of Random Sets. Springer, Heidelberg (2005)

    Google Scholar 

  7. Nguyen, H.T.: An Introduction to Random Sets. CRC Press, Boca Raton (2006)

    Google Scholar 

  8. Salamanca, J.J.: On the connectedness of random sets of \(\mathbb{R}\). Int. J. Uncertain. Fuzziness Knowl.-Based Syst. (2020)

    Google Scholar 

  9. Salamanca, J.J., Herrera, J., Rubio, R.M.: On the connectedness of a random closed set in a Euclidean space (submitted)

    Google Scholar 

  10. Walley, P.: Peter: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London (1991)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan Jesús Salamanca .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Salamanca, J.J. (2021). Discussions on the Connectedness of a Random Closed Set. In: Denœux, T., Lefèvre, E., Liu, Z., Pichon, F. (eds) Belief Functions: Theory and Applications. BELIEF 2021. Lecture Notes in Computer Science(), vol 12915. Springer, Cham. https://doi.org/10.1007/978-3-030-88601-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88601-1_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88600-4

  • Online ISBN: 978-3-030-88601-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics