This is a preview. Log in through your library . Abstract Let HG(x, y) be the expected hitting time from vertex x to vertex y for the first time on a simple connected graph G and φ(G) = ...

The Annals of Applied Probability, Vol. 16, No. 1 (Feb., 2006), pp. 295-309 (15 pages) We consider the discrete Laplace operator $\Delta ^{(N)}$ on Erdős-Rényi random graphs with N vertices and edge ...

ABSTRACT: Graph burning is a model for describing the spread of influence in social networks and the burning number is a parameter used to describe the speed of information spread. In 2016, Bonato ...

Abstract: This paper proposes a method for sampling graph signals by designing a flexible sampling operator via a difference-of-convex (DC) based algorithm. Departing from conventional methods limited ...