A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally
Abstract
We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex
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.