Strong-geometry conjecture for geometric preferential attachment
Statement
For , define
where . Let be the geometric preferential attachment graph under the paper's standing assumptions, let be the vertex selected by the new vertex, and let be its on-line nearest neighbour. Strong-geometry conjecture. The conclusion of Theorem 1(ii), including convergence to the on-line nearest-neighbour degree sequence, is valid for every . The theorem establishes this conclusion for ; extending it to the full range remains open, as does the stronger almost-sure convergence discussed in the surrounding remark.
Record
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.