Asymptotics of the Number of Endpoints of a Random Walk on a Certain Class of Directed Metric Graphs
Abstract
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.