ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each nn, let αn\alpha_n be the cut-off value at which the Katz similarity index and effective resistance distance rankings for the path graph PnP_n change from agreeing to disagreeing. Cut-off convergence conjecture. The cut-off values αn\alpha_n converge to 15\frac{1}{\sqrt{5}} from above. This conjecture concerns the asymptotic relationship between Katz similarity and resistance-distance rankings for path graphs; the source says that computational evidence will be presented, but does not state a proof or resolution.

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.