The paper introduces forward-backward Green cosine geometry to improve directed community detection and overlap expansion using centered diffusive profiles from random walks.
Community detection in graphs.Physics Reports, 486(3–5):75–174
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Spectral cut-persistence ranking of hyperedges reduces final infection size more than random removal in Erdős–Rényi hypergraphs but not in Watts–Strogatz or Barabási–Albert hypergraphs.
citing papers explorer
-
Forward--Backward Green Cosine Geometry for Directed Community Detection and Overlap Expansion
The paper introduces forward-backward Green cosine geometry to improve directed community detection and overlap expansion using centered diffusive profiles from random walks.
-
Targeted Disruption of Hypernetworks via Spectral Partitioning
Spectral cut-persistence ranking of hyperedges reduces final infection size more than random removal in Erdős–Rényi hypergraphs but not in Watts–Strogatz or Barabási–Albert hypergraphs.