atlas

Research map / Graph learning / Graph algorithms and clustering

Community detection in sparse time-evolving graphs with a dynamical Bethe-Hessian

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 7 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use dynamical Bethe-Hessian instead of dynamic adjacency averagingAlgorithm 1 · synthetic D-DCSBM, low label persistenceoverlapHelped
use Algorithm 1 instead of belief propagationcommunity detection · synthetic D-DCSBM, n=5000, T=4overlapHurt
use dynamical Bethe-Hessian instead of static Bethe-Hessian per time stepAlgorithm 1 · synthetic D-DCSBMoverlapMixed
use dynamical Bethe-Hessian instead of dynamical non-backtrackingAlgorithm 1 · synthetic D-DCSBMoverlapHelped
use xi = lambda (oracle) instead of xi = lambda_d (ablation)dynamical Bethe-Hessian · synthetic D-DCSBMoverlapHelped
use Algorithm 1 instead of the non-dynamic method on Primary schoolcommunity detection · SocioPatterns Primary schoolmodularityHelped
use fast approximate implementation (ablation)Algorithm 1 · synthetic D-DCSBM large Truntime: 40 minutes -> less than 4 minutesHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy