Upper bound on saturation time of metric graphs by intervals moving on them

DOI10.1016/J.JMAA.2023.127873zbMATH Open1540.05047MaRDI QIDQ6542902FDOQ6542902

Authors: Andrew Eliseev, Vsevolod L. Chernyshev 

Publication date: 23 May 2024

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

random walkmetric graphsaturationwave packetepsilon-netdynamical system of points

Mathematics Subject Classification ID

Distance in graphs (05C12) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistics of Gaussian packets on metric and decorated graphs
• Title not available (Why is that?)
• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph
• The second term in the asymptotics for the number of points moving along a metric graph
• Behavior of quasi-particles on hybrid spaces. Relations to the geometry of geodesics and to the problems of analytic number theory
• The number of endpoints of a random walk on a semi-infinite metric path graph
• A metric graph for which the number of possible end positions of a random walk grows minimally

This page was built for publication: Upper bound on saturation time of metric graphs by intervals moving on them

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542902)