Upper bound on saturation time of metric graphs by intervals moving on them
From MaRDI portal
(Redirected from Publication:6542902)
Recommendations
Cites work
- A metric graph for which the number of possible end positions of a random walk grows minimally
- Behavior of quasi-particles on hybrid spaces. Relations to the geometry of geodesics and to the problems of analytic number theory
- Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
- scientific article; zbMATH DE number 4083739 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3191380 (Why is no real title available?)
- Statistics of Gaussian packets on metric and decorated graphs
- The number of endpoints of a random walk on a semi-infinite metric path graph
- The second term in the asymptotics for the number of points moving along a metric graph
- Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph
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)