49 citations · 263 across the 36 of their papers we have counts for
5 papers · 1 filter
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations
Michael B. Cohen, Jonathan Kelner, Rasmus Kyng +4
We show how to solve directed Laplacian systems in nearly-linear time. Given a linear system in an Eulerian directed Laplacian with nonzero entries, we show how to…
Latent Network Summarization: Bridging Network Embedding and Summarization
Di Jin, Ryan Rossi, Danai Koutra +3
Motivated by the computational and storage challenges that dense embeddings pose, we introduce the problem of latent network summarization that aims to learn a compact, latent repr…
Higher-order Spectral Clustering for Heterogeneous Graphs
Aldo G. Carranza, Ryan A. Rossi, Anup Rao +1
Higher-order connectivity patterns such as small induced sub-graphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) go…
Higher-order Graph Convolutional Networks
John Boaz Lee, Ryan A. Rossi, Xiangnan Kong +3
Following the success of deep convolutional networks in various vision and speech related tasks, researchers have started investigating generalizations of the well-known technique…
New Insights into Bootstrapping for Bandits
Sharan Vaswani, Branislav Kveton, Zheng Wen +3
We investigate the use of bootstrapping in the bandit setting. We first show that the commonly used non-parametric bootstrapping (NPB) procedure can be provably inefficient and est…