ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be any unweighted directed graph, possibly with loops and bidirected arcs, and let α1\alpha_1 and α2\alpha_2 be two jumping constants. For each jumping constant, write παi\pi_{\alpha_i} for the corresponding PageRank vector. Extremal PageRank distance conjecture. For every such graph and every pair α1,α2\alpha_1,\alpha_2,

∣πα1−πα2∣<6750.\\|\pi_{\alpha_1}-\pi_{\alpha_2}\\| < \sqrt{\frac{67}{50}}.

The paper's main theorem constructs unweighted directed graphs whose PageRank distance approaches 67/50\sqrt{67/50} 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 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.