ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let pp be the stationary probability of a vertex under simple random walk, and let obreakε obreak\varepsilon be the controller's bias parameter. Azar et al.'s conjecture. In any graph, a controller can increase the stationary probability of any vertex from pp to p1−εp^{1-\varepsilon}.

The conjecture is false for K2K_2, and the paper explains that additional technical conditions are needed in the original formulation. It motivates the refined conjecture that allows an error term in the exponent.

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.