The symmetric-point maximum conjecture for random geometric graph entropy
The symmetric-point maximum conjecture for random geometric graph entropy
Let denote the entropy of the random geometric graph distribution at parameter , and let be the corresponding edge-probability parameter at which the entropy is maximized. The dimension is denoted by . Symmetric-point maximum conjecture. The maximum of occurs when , and therefore
as . Numerical simulations suggest that the stationary point at is a global maximum, but the claim is not proved in the source; it concerns the asymptotic location of the maximum-entropy configuration in high dimensions.
Sources & referencesView supporting material
Primary source
Oliver Baker and Carl P. Dettmann, “Entropy of Random Geometric Graphs in High and Low Dimensions”, arXiv:2503.11418 (2025).
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.