Eigenvector Computation and Community Detection in Asynchronous Gossip Models

by   Frederik Mallmann-Trenn, et al.

We give a simple distributed algorithm for computing adjacency matrix eigenvectors for the communication graph in an asynchronous gossip model. We show how to use this algorithm to give state-of-the-art asynchronous community detection algorithms when the communication graph is drawn from the well-studied stochastic block model. Our methods also apply to a natural alternative model of randomized communication, where nodes within a community communicate more frequently than nodes in different communities. Our analysis simplifies and generalizes prior work by forging a connection between asynchronous eigenvector computation and Oja's algorithm for streaming principal component analysis. We hope that our work serves as a starting point for building further connections between the analysis of stochastic iterative methods, like Oja's algorithm, and work on asynchronous and gossip-type algorithms for distributed computation.


page 1

page 2

page 3

page 4


Efficient Distributed Community Detection in the Stochastic Block Model

Designing effective algorithms for community detection is an important a...

Community Detection in Bipartite Networks with Stochastic Blockmodels

In bipartite networks, community structures are restricted to being disa...

Exact Distributed Stochastic Block Partitioning

Stochastic block partitioning (SBP) is a community detection algorithm t...

Distributed Learning Systems with First-order Methods

Scalable and efficient distributed learning is one of the main driving f...

Streaming Belief Propagation for Community Detection

The community detection problem requires to cluster the nodes of a netwo...

BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs

Graph layouts are key to exploring massive graphs. An enormous number of...

Please sign up or login with your details

Forgot password? Click here to reset