We consider the generalised PageRank walk on a digraph $G$, with refresh probability $\alpha$ and resampling distribution $\lambda$. analyse convergence to stationarity when $G$ is large sparse random given degree sequences, in limit of vanishing $\alpha$. identify three scenarios: much smaller than inverse mixing time relaxation equilibrium dominated by simple displays cutoff behaviour; larger...

Abstract We obtain a polynomial upper bound on the mixing time $T_{CHR}(\epsilon)$ of coordinate Hit-and-Run (CHR) random walk an $n-$ dimensional convex body, where is number steps needed to reach within $\epsilon$ uniform distribution with respect total variation distance, starting from warm start (i.e., which has density body that bounded above by constant). Our in n , R and $\frac{1}{\epsil...