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

References in corpus (2)

• The properties of the distribution of Gaussian packets on a spatial network
• Towards Dynamic-Point Systems on Metric Graphs with Longest Stabilization Time