Profile picture

PhD Student

Computational Network Science
RWTH Aachen University
hoppe@cs.rwth-aachen.de

Github   Gitlab   LinkedIn   ORCID   Google Scholar  

Bio

I am currently a PhD Student in Michael T. Schaub’s Group at RWTH Aachen University.

Previously, I also obtained my Bachelor’s and Master’s in Computer Science at RWTH University. My master’s thesis led to my first (joint) publication on passenger prediction in public transport, but my focus has since shifted toward graph signal processing, algebraic topology, and higher-order networks. In that area, I am proud to report that our paper Representing Edge Flows on Graphs via Sparse Cell Complexes received the Best Paper award at the 2023 Learning on Graphs Conference.

In connection with my research, I have also published or contributed to the following software packages:

In my free time, I am active in the german-language debating scene, more specifically, the debating club Aachen. Recently, I organized the Western German Debating Championship (WDM 2024).

Recent Talks & Poster Presentations

Publications

, ,
Random Abstract Cell Complexes
In arXiv Preprints, 2024.
We define a model for random (abstract) cell complexes (CCs), similiar to the well-known Erdős-Rényi model for graphs and its extensions for simplicial complexes. To build a random cell complex, we first draw from an Erdős-Rényi graph, and consecutively augment the graph with cells for each dimension with a specified probability. As the number of possible cells increases combinatorially — e.g., 2-cells can be represented as cycles, or permutations — we derive an approximate sampling algorithm for this model limited to two-dimensional abstract cell complexes. Since there is a large variance in the number of simple cycles on graphs drawn from the same configuration of ER, we also provide an efficient method to approximate that number, which is of independent interest. Moreover, it enables us to specify the expected number of 2-cells of each boundary length we want to sample. We provide some initial analysis into the properties of random CCs drawn from this model. We further showcase practical applications for our random CCs as null models, and in the context of (random) liftings of graphs to cell complexes.
PDFGithubPyPIPoster
, ,
Representing Edge Flows on Graphs via Sparse Cell Complexes
In The Second Learning on Graphs Conference, 2023.
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 graph, an intuitively interpretable way to obtain such representations is to lift the graph structure to a simplicial complex: The eigenvectors of the associated Hodge-Laplacian, respectively the incidence matrices of the corresponding simplicial complex then induce a Hodge decomposition, which can be used to represent the observed data in terms of gradient, curl, and harmonic flows. In this paper, we generalize this approach to cellular complexes and introduce the cell inference optimization problem, i.e., the problem of augmenting the observed graph by a set of cells, such that the eigenvectors of the associated Hodge Laplacian provide a sparse, interpretable representation of the observed edge flows on the graph. We show that this problem is NP-hard and introduce an efficient approximation algorithm for its solution. Experiments on real-world and synthetic data demonstrate that our algorithm outperforms current state-of-the-art methods while being computationally efficient.
PDFDOIGithubPosterSlidesTalk at LoG 2023arXivPyPI
, ,
Topological Trajectory Classification and Landmark Inference on Simplicial Complexes
In Asilomar Conference on Signals, Systems, and Computers (in press), 2024.
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 the trajectories into the harmonic eigenspace of the Hodge Laplacian, and then cluster the resulting embeddings. However, if the considered space has vanishing homology (i.e., no "holes"), then the harmonic space of the 1-Hodge Laplacian is trivial and thus the approach fails. Here we propose to view this issue akin to a sensor placement problem and present an algorithm that aims to learn "optimal holes" to distinguish a set of given trajectory classes. Specifically, given a set of labelled trajectories, which we interpret as edge-flows on the underlying simplicial complex, we search for 2-simplices whose deletion results in an optimal separation of the trajectory labels according to the corresponding spectral embedding of the trajectories into the harmonic space. Finally, we generalise this approach to the unsupervised setting.
PDFDOIGit
, ,
Improving the Prediction of Passenger Numbers in Public Transit Networks by Combining Short-Term Forecasts With Real-Time Occupancy Data
In IEEE Open Journal of Intelligent Transportation Systems, 2023.
Good public transport occupancy predictions are important for both passengers (to avoid crowded vehicles) and operating companies (to intervene with dispositive actions, hereby increasing the service quality). In this paper, we present a novel approach to improve the real-time prediction of passenger numbers. It combines a day-ahead prediction made using SARIMA with a real-time detection of characteristic deviation profiles. In our experiments with data from Germany, the proposed model outperforms artificial neural networks when only little data is available or the prediction happens with larger lead times than 90 minutes. It also has the inherent advantage of being faster to train and explainable in all steps.
PDFDOI