4 papers
Four-Cycle Counting in Low-Degeneracy Graph Streams
Sebastian Lüderssen, Stefan Neumann, Pan Peng
We study the problem of -approximating the number of four-cycles in graphs given as arbitrary order edge streams. We propose two new algorithms based on sampling i…
A Survey on Algorithmic Interventions in Opinion Dynamics
Atsushi Miyauchi, Yuko Kuroki, Federico Cinus +2
Social media platforms have become critical infrastructures for public communication, where large-scale interaction can both support socially beneficial collective pressure and amp…
OptiRefine: Densest subgraphs and maximum cuts with refinements
Sijing Tu, Aleksa Stankovic, Stefan Neumann +1
Data-analysis tasks often involve an iterative process, which requires refining previous solutions. For instance, when analyzing dynamic social networks, we may be interested in mo…
The Impact of External Sources on the Friedkin-Johnsen Model
Charlotte Out, Sijing Tu, Stefan Neumann +1
To obtain a foundational understanding of timeline algorithms and viral content in shaping public opinions, computer scientists started to study augmented versions of opinion forma…