Conjecture on the limiting cut-off for Katz similarity and resistance rankings
Statement
For each , let be the cut-off value at which the Katz similarity index and effective resistance distance rankings for the path graph change from agreeing to disagreeing. Cut-off convergence conjecture. The cut-off values converge to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.