no code implementations • 16 Jan 2023 • Luka V. Petrović, Vincenzo Perri
We usually detect mesoscale structures under the assumption of independence of interactions.
no code implementations • 27 Oct 2022 • Vincenzo Perri, Luka V. Petrovic, Ingo Scholtes
Lastly, we show that this higher accuracy improves the results for downstream network analysis tasks like cluster detection and node ranking, which highlights the practical relevance of our method for analyses of various networked systems.
no code implementations • 14 Oct 2022 • Vincenzo Perri, Lisi Qarkaxhija, Albin Zehe, Andreas Hotho, Ingo Scholtes
Natural Language Processing and Machine Learning have considerably advanced Computational Literary Studies.
no code implementations • 17 Sep 2022 • Lisi Qarkaxhija, Vincenzo Perri, Ingo Scholtes
Our architecture builds on multiple layers of higher-order De Bruijn graphs, an iterative line graph construction where nodes in a De Bruijn graph of order k represent walks of length k-1, while edges represent walks of length k. We develop a graph neural network architecture that utilizes De Bruijn graphs to implement a message passing scheme that follows a non-Markovian dynamics, which enables us to learn patterns in the causal topology of a dynamic graph.
no code implementations • 26 Jul 2021 • Christoph Gote, Vincenzo Perri, Ingo Scholtes
We compare MOGen-based centralities to equivalent measures for network models and path data in a prediction experiment where we aim to identify influential nodes in out-of-sample data.
no code implementations • 16 Aug 2019 • Vincenzo Perri, Ingo Scholtes
Addressing this gap, we present a novel dynamic graph visualisation algorithm that utilises higher-order graphical models of causal paths in time series data to compute time-aware static graph visualisations.