2 citations · 3 across the 6 of their papers we have counts for
4 papers · 1 filter
Efficiently Estimating Cycle Statistics on Graphs via Spanning Trees
Josef Hoppe, Michael T. Schaub
Simple cycles encode feedback and alternative routes in networks and are important for routing problems, the convergence of dynamical processes on networks, message passing and bel…
Faster Inference of Cell Complexes from Flows via Matrix Factorization
Til Spreuer, Josef Hoppe, Michael T. Schaub
We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be…
Topological Trajectory Classification and Landmark Inference on Simplicial Complexes
Vincent P. Grande, Josef Hoppe, Florian Frantzen +1
We consider the problem of classifying trajectories on a discrete or discretised 2-dimensional manifold modelled by a simplicial complex. Previous works have proposed to project th…
Representing Edge Flows on Graphs via Sparse Cell Complexes
Josef Hoppe, Michael T. Schaub
Obtaining sparse, interpretable representations of observable data is crucial in many machine learning and signal processing tasks. For data representing flows along the edges of a…