The extremal PageRank distance conjecture
Statement
Let be any unweighted directed graph, possibly with loops and bidirected arcs, and let and be two jumping constants. For each jumping constant, write for the corresponding PageRank vector. Extremal PageRank distance conjecture. For every such graph and every pair ,
The paper's main theorem constructs unweighted directed graphs whose PageRank distance approaches from below, so this conjecture asserts that the limiting value is the best possible universal bound. Its status is not resolved by the supplied text.
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.