Skip to main content
SpringerLink
Log in

Asymptotics of the Number of Endpoints of a Random Walk on a Certain Class of Directed Metric Graphs

  • Research Articles
  • Published:
Russian Journal of Mathematical Physics Aims and scope Submit manuscript

Abstract

A certain class of directed metric graphs is considered. The asymptotics for a number of possible endpoints of a random walk at large times is found.

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

Fig. 1.

Similar content being viewed by others

References

  1. L. Lovasz, “Random Walks on Graphs: A Survey”, Combinatorics, Paul Erdos is Eighty, (1993), 1–46.

    Google Scholar 

  2. G. Berkolaiko and P. Kuchment, Introduction to Quantum Graphs, vol. 186, Mathematical Surveys and Monographs, AMS, 2014.

    MATH  Google Scholar 

  3. V. L. Chernyshev and A. A. Tolchennikov, “Polynomial Approximation for the Number of All Possible Endpoints of a Random Walk on a Metric Graph”, Electron. Notes Discrete Math., 70 (2018), 31тАУ-35.

    Article  MathSciNet  Google Scholar 

  4. V. L. Chernyshev and A. I. Shafarevich, “Statistics of Gaussian Packets on Metric and Decorated Graphs”, Philos. trans. R. Soc., A, 372:2007 (2014).

    Article  MathSciNet  Google Scholar 

  5. V. L. Chernyshev and A. A. Tolchennikov, “Correction to the Leading Term of Asymptotics in the Problem of Counting the Number of Points Moving on a Metric Tree”, Russ. J. Math. Phys., 24:3 (2017), 290–298.

    Article  MathSciNet  Google Scholar 

  6. V. L. Chernyshev and A. A. Tolchennikov, “The Second Term in the Asymptotics for the Number of Points Moving Along a Metric Graph”, Regul. Chaotic Dyn., 22:8 (2017), 937–948.

    Article  ADS  MathSciNet  Google Scholar 

  7. V. N. Salii, “The Sperner Property for Trees”, Prikl. Diskr. Mat. Suppl., :8 (2015), 124-тАУ127.

    Google Scholar 

Download references

Acknowledgments

The authors are grateful to V. E. Nazaikinskii and A. I. Shafarevich for support and useful discussions. The work of A. T. in Section 2 was supported by grant no. 16-11-10069 of the Russian Science Foundation. The work of V. C. in Section 3 was supported by the RFBR grant no. 20-07-01103a.

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics (HSE), Moscow, Russia

    V. L. Chernyshev

  2. Ishlinsky Institute for Problems in Mechanics of the Russian Academy of Sciences, Moscow, Russia

    A. A. Tolchennikov

  3. Lomonosov Moscow State University, Moscow, Russia

    A. A. Tolchennikov

Authors
  1. V. L. Chernyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Tolchennikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. L. Chernyshev or A. A. Tolchennikov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chernyshev, V.L., Tolchennikov, A.A. Asymptotics of the Number of Endpoints of a Random Walk on a Certain Class of Directed Metric Graphs. Russ. J. Math. Phys. 28, 434–438 (2021). https://doi.org/10.1134/S1061920821040038

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1061920821040038

Search

Navigation