Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...