arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.3945math-phmath.MP
收藏

空间网络上高斯波包分布的性质

The properties of the distribution of Gaussian packets on a spatial network

V. L. Chernyshev, A. A. Tolchennikov

AI总结:

本文利用半经典渐近将度量图上的高斯波包转化为经典动力系统,证明有限紧图中波包几乎总是均匀分布,并给出波包数随时间增长的首项渐近系数。

摘要:

本文讨论度量图上高斯波包的统计行为描述。Schrödinger方程Cauchy问题解的半经典渐近(其初始数据集中在一条边上某一点的邻域内)在图上生成一个经典动力系统。在波包通过各条边的所有时间(“边传播时间”)在有理数域上线性无关的情形下,对此类系统行为的描述与在扩张多面体中计数格点数的数论问题相关。本文证明,对于有限紧图,波包几乎总是均匀分布。文中得到了随时间增加时波包数量渐近行为首项系数的公式。本文还讨论了各条边上的通过时间在有理数域上并非线性无关的情形。

英文摘要:

The article deals with the description of the statistical behavior of Gaussian packets on a metric graph. Semiclassical asymptotics of solutions of the Cauchy problem for the Schrödinger equation with initial data concentrated in the neighborhood of one point on the edge, generates a classical dynamical system on a graph. In a situation where all times for packets to pass over edges ("edge travel times") are linearly independent over the rational numbers, a description of the behavior of such systems is related to the number-theoretic problem of counting the number of lattice points in an expanding polyhedron. In this paper we show that for a finite compact graph packets almost always are distributed evenly. A formula for the leading coefficient of the asymptotic behavior of the number of packets with an increasing time is obtained. The article also discusses a situation where the times of passage over the edges are not linearly independent over the rationals.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑