Showing math.NAShow all
3 papers · 1 filter
math.NA2026
Deterministic sketching for Krylov subspace methods
Kai Bergermann
Randomized sketching is currently introduced into every area of numerical linear algebra. In Krylov subspace methods, it allows runtime savings at the cost of small accuracy reduct…
math.NA2024
Gradient flow-based modularity maximization for community detection in multiplex networks
Kai Bergermann, Martin Stoll
We propose two methods for the unsupervised detection of communities in undirected multiplex networks. These networks consist of multiple layers that record different relationships…
math.NA2024
A nonlinear spectral core-periphery detection method for multiplex networks
Kai Bergermann, Martin Stoll, Francesco Tudisco
Core-periphery detection aims to separate the nodes of a complex network into two subsets: a core that is densely connected to the entire network and a periphery that is densely co…