ABSTRACT: The study of stochastic PDEs has known tremendous advances in recent years and, thanks to Hairer's theory of regularity structures and Gubinelli and Perkowski's paracontrolled approach, (loc...
Abstract: We consider a random walk jumping on a dynamic graph; that is, a graph that changes at the same time as the walker moves. Previous works considered the case where the graph changes via dynam...
Abstract: A spanning tree of a graph G is a connected subset of G without cycles. The Uniform Spanning Tree (UST) is obtained by choosing one of the possible spanning trees of G at random. The Minimum...
