论文标题
一个度量图，随机步行的可能端点数量最小
A Metric Graph for Which the Number of Possible Endpoints of a Random Walk Grows Minimally
论文作者
论文摘要
我们证明，随机步行可能终点数量的最小生长的度量图是从同一顶点出来的几个线性路径的结合
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
