ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For γ>1\gamma>1, define

Fγ(r)=exp⁡{(log⁡(1/r))γ},F_\gamma(r)=\exp\{(\log(1/r))^\gamma\},

where log⁡x=max⁡{0,log⁡x}\log x=\max\{0,\log x\}. Let GnG_n be the geometric preferential attachment graph under the paper's standing assumptions, let vnv_n be the vertex selected by the new vertex, and let η1(n)\eta_1(n) 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 γ>1\gamma>1. The theorem establishes this conclusion for γ>3/2\gamma>3/2; extending it to the full range γ>1\gamma>1 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.