3 problems

Let $p_1,p_2,\dots$ be a sequence of arbitrary discrete distributions presented adaptively over time. An online random sampling algorithm generates exact samples from these distrib…

Let $\mathrm{SG}$ be the Sierpiński gasket, let $\mathcal{L}$ be its Laplacian, and let $\mathcal{L}_\epsilon(\omega)$ be the random graph averaging Laplacian defined from random s…

Stability conjecture. Eigenmaps of the random averaging Laplacians give numerically stable locally uniform approximations to the corresponding eigenmap of $\mathcal{L}_{(g)}$. This…