度量图上随机游走的所有可能端点数目的多项式近似

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-12-01 DOI:10.1016/j.endm.2018.11.005

Vsevolod Chernyshev, Anton Tolchennikov

引用次数: 8

摘要

给出了边长度不可公度的度量图上随机游走可能端点数的渐近性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph

The asymptotics of the number of possible endpoints of a random walk on a metric graph with incommensurable edge lengths is found.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.