2 citations · 4 across the 3 of their papers we have counts for
3 papers
A Wasserstein Graph Distance Based on Distributions of Probabilistic Node Embeddings
Michael Scholkemper, Damin Kühn, Gerion Nabbefeld +3
Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a d…
Learning the effective order of a hypergraph dynamical system
Leonie Neuhäuser, Michael Scholkemper, Francesco Tudisco +1
Dynamical systems on hypergraphs can display a rich set of behaviours not observable for systems with pairwise interactions. Given a distributed dynamical system with a putative hy…
An Optimization-based Approach To Node Role Discovery in Networks: Approximating Equitable Partitions
Michael Scholkemper, Michael T. Schaub
Similar to community detection, partitioning the nodes of a network according to their structural roles aims to identify fundamental building blocks of a network. The found partiti…