Optimality conjecture for shifted IDLA mixing time on quasi-regular graphs
Optimality conjecture for shifted IDLA mixing time on quasi-regular graphs
Let be a quasi-regular graph satisfying Assumption and let be the time scale from the mixing theorem, namely the quantity appearing in Theorem.
Optimality conjecture. Under Assumption, is optimal up to logarithmic factors.
This conjecture asserts that the bound for shifted internal diffusion-limited aggregation to forget its initial state cannot generally be improved by more than logarithmic factors. It is motivated by the corresponding near-optimal result for the base graph , while the general quasi-regular case remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Vittoria Silvestri, “Internal DLA on cylinder graphs: fluctuations and mixing”, arXiv:1909.09893 (2020).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.