Monotonicity conjecture for simple random walk on growing graphs
Statement
Let and be graphs non-decreasing in , of uniformly bounded degrees, with for every . Let and be simple random walks on these graph evolutions, both starting from . Monotonicity conjecture. If is transient, meaning that its sample path almost surely returns to only finitely often, then is also transient. The conjecture is a time-dependent analogue of Rayleigh monotonicity, which gives the claim when the graphs are fixed. Its validity for general growing graphs remains open; the paper notes that bounded degrees are essential to the formulation.
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.