Internal DLA on cylinder graphs: fluctuations and mixing

From MaRDI portal
Publication:2201540




Abstract: We use coupling ideas introduced in cite{levine2018long} to show that an IDLA process on a cylinder graph GimesmathbbZ forgets a typical initial profile in mathcalO(NsqrtauN(log!N)2) steps for large N, where N is the size of the base graph G, and auN is the total variation mixing time of a simple random walk on G. The main new ingredient is a maximal fluctuations bound for IDLA on GimesmathbbZ which only relies on the mixing properties of the base graph G and the Abelian property.









This page was built for publication: Internal DLA on cylinder graphs: fluctuations and mixing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201540)