Skip to main content

Convergence of Distributions on Paths

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14292))

Included in the following conference series:

  • 167 Accesses

Abstract

We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we revisit some known results from reducible nonnegative matrix theory and obtain new ones, with a systematic use of tools from analytic combinatorics. In several fields of mathematics, computer science and system theory, including concurreny theory, one frequently faces non strongly connected weighted digraphs encoding the elements of combinatorial structures of interest; this motivates our study.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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. Abbes, S.: Introduction to probabilistic concurrent systems. Fundam. Inf. 187(2–4), 71–102 (2022)

    MathSciNet  MATH  Google Scholar 

  2. Abbes, S., Gouëzel, S., Jugé, V., Mairesse, J.: Asymptotic combinatorics of Artin-Tits monoids and of some other monoids. J. Algebra 525, 497–561 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berman, A., Plemmons, R.: Nonnegative Matrices in the Mathematical Sciences. SIAM (1994)

    Google Scholar 

  4. Billingsley, P.: Convergence of Probability Measures, 2nd edn. John Wiley, Hoboken (1999)

    Book  MATH  Google Scholar 

  5. Bousquet-Mélou, M.: Rational and algebraic series in combinatorial enumeration. In: Proceedings of the ICM, pp. 789–826 (2006)

    Google Scholar 

  6. Calegari, D., Fujiwara, K.: Combable functions, quasimorphisms, and the central limit theorem. Ergodic Theory Dyn. Syst. 30(5), 1343–1369 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Charney, R.: Geodesic automation and growth functions for Artin groups of finite type. Math. Ann. 301, 307–324 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dehornoy, P., Digne, F., Godelle, E., Krammer, D., Michel, J.: Foundations of Garside Theory. EMS Press (2014)

    Google Scholar 

  9. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  10. Parry, W.: Intrinsic Markov chains. Trans. Am. Math. Soc. 112(1), 55–66 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  11. Rothblum, U.: Nonnegative and stochastic matrices. In: Hogben, L. (ed.) Handbook of Linear Algebra, 2nd edn. Chapman & Hall (2014)

    Google Scholar 

  12. Seneta, E.: Non-Negative Matrices and Markov Chains, 2nd edn. Springer, Cham (1981). https://doi.org/10.1007/0-387-32792-4

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Samy Abbes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Abbes, S. (2023). Convergence of Distributions on Paths. In: Fernau, H., Jansen, K. (eds) Fundamentals of Computation Theory. FCT 2023. Lecture Notes in Computer Science, vol 14292. Springer, Cham. https://doi.org/10.1007/978-3-031-43587-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43587-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43586-7

  • Online ISBN: 978-3-031-43587-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics