Azar et al.'s stationary-probability boosting conjecture for biased random walks
Statement
Let be a graph, let be the stationary probability of a vertex under simple random walk, and let 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 to .
The conjecture is false for , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.