Scaling of distances in a random hierarchical graph
Statement
In the random hierarchical graph obtained by repeatedly replacing a uniformly chosen edge by the fixed three-edge pattern of Section 9.4, let be the distance between the two marked endpoints and let . Determine and find a normalization under which converges in distribution, equivalently giving a Gromov–Hausdorff scaling limit.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.