Convergence-radius conjecture for STARLINK temporal visibility graphs
Convergence-radius conjecture for STARLINK temporal visibility graphs
Let be the number of nodes, and let a sub-TVG be a randomly sampled sub-temporal visibility graph of the STARLINK satellite system. Let denote the convergence radius of its Kleene star, meaning the radius at which the Kleene-star sequence converges. Convergence-radius conjecture. With high probability as , a randomly sampled sub-TVG of STARLINK has a Kleene star that converges for (weak version), and with high probability it has a Kleene star that converges at (strong version). The conjecture concerns the asymptotic behavior of the Kleene star for increasingly large STARLINK systems; simulations suggest convergence radii below , while geometric considerations indicate the limiting value should be .
Sources & referencesView supporting material
Primary source
William Bernardoni, Robert Cardona, Jacob Cleveland, Justin Curry, Robert Green, Brian Heller, Alan Hylton, Tung Lam and Robert Kassouf-Short, “Algebraic and Geometric Models for Space Networking”, arXiv:2304.01150 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.