TY - GEN A1 - Banisch, Ralf A1 - Djurdjevac Conrad, Natasa A1 - Schütte, Christof T1 - Reactive flows and unproductive cycles for random walks on complex networks N2 - We present a comprehensive theory for analysis and understanding of transition events between an initial set A and a target set B for general ergodic finite-state space Markov chains or jump processes, including random walks on networks as they occur, e.g., in Markov State Modelling in molecular dynamics. The theory allows us to decompose the probability flow generated by transition events between the sets A and B into the productive part that directly flows from A to B through reaction pathways and the unproductive part that runs in loops and is supported on cycles of the underlying network. It applies to random walks on directed networks and nonreversible Markov processes and can be seen as an extension of Transition Path Theory. Information on reaction pathways and unproductive cycles results from the stochastic cycle decomposition of the underlying network which also allows to compute their corresponding weight, thus characterizing completely which structure is used how often in transition events. The new theory is illustrated by an application to a Markov State Model resulting from weakly damped Langevin dynamics where the unproductive cycles are associated with periodic orbits of the underlying Hamiltonian dynamics. T3 - ZIB-Report - 15-19 KW - Complex networks KW - molecular transition networks KW - transition path theory KW - cycle decomposition KW - reactive trajectories KW - Markow State Methods Y1 - 2015 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-54239 SN - 1438-0064 ER - TY - JOUR A1 - Lorenz-Spreen, Philipp A1 - Wolf, Frederik A1 - Braun, Jonas A1 - Ghoshal, Gourab A1 - Djurdjevac Conrad, Natasa A1 - Hövel, Philipp T1 - Tracking online topics over time: understanding dynamic hashtag communities JF - Computational Social Networks N2 - Background: Hashtags are widely used for communication in online media. As a condensed version of information, they characterize topics and discussions. For their analysis, we apply methods from network science and propose novel tools for tracing their dynamics in time-dependent data. The observations are characterized by bursty behaviors in the increases and decreases of hashtag usage. These features can be reproduced with a novel model of dynamic rankings. Hashtag communities in time: We build temporal and weighted co-occurrence networks from hashtags. On static snapshots, we infer the community structure using customized methods. On temporal networks, we solve the bipartite matching problem of detected communities at subsequent timesteps by taking into account higher-order memory. This results in a matching protocol that is robust toward temporal fluctuations and instabilities of the static community detection. The proposed methodology is broadly applicable and its outcomes reveal the temporal behavior of online topics. Modeling topic-dynamics: We consider the size of the communities in time as a proxy for online popularity dynamics. We find that the distributions of gains and losses, as well as the interevent times are fat-tailed indicating occasional, but large and sudden changes in the usage of hashtags. Inspired by typical website designs, we propose a stochastic model that incorporates a ranking with respect to a time-dependent prestige score. This causes occasional cascades of rank shift events and reproduces the observations with good agreement. This offers an explanation for the observed dynamics, based on characteristic elements of online media. Y1 - 2018 U6 - https://doi.org/10.1186/s40649-018-0058-6 VL - 5 IS - 9 ER - TY - JOUR A1 - Djurdjevac Conrad, Natasa A1 - Banisch, Ralf A1 - Schütte, Christof T1 - Modularity of Directed Networks: Cycle Decomposition Approach JF - Journal of Computational Dynamics 2 (2015) pp. 1-24 N2 - The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a coarsegrained description of complex systems, often revealing functional subunits of these systems. A variety of module detection algorithms have been proposed, mostly oriented towards finding hard partitionings of undirected networks. Despite the increasing number of fuzzy clustering methods for directed networks, many of these approaches tend to neglect important directional information. In this paper, we present a novel random walk based approach for finding fuzzy partitions of directed, weighted networks, where edge directions play a crucial role in defining how well nodes in a module are interconnected. We will show that cycle decomposition of a random walk process connects the notion of network modules and information transport in a network, leading to a new, symmetric measure of node communication. Finally, we will use this measure to introduce a communication graph, for which we will show that although being undirected it inherits all necessary information about modular structures from the original network. Y1 - 2015 U6 - https://doi.org/10.3934/jcd.2015.2.1 ER - TY - JOUR A1 - Klus, Stefan A1 - Djurdjevac Conrad, Natasa T1 - Koopman-based spectral clustering of directed and time-evolving graphs JF - Journal of Nonlinear Science N2 - While spectral clustering algorithms for undirected graphs are well established and have been successfully applied to unsupervised machine learning problems ranging from image segmentation and genome sequencing to signal processing and social network analysis, clustering directed graphs remains notoriously difficult. Two of the main challenges are that the eigenvalues and eigenvectors of graph Laplacians associated with directed graphs are in general complex-valued and that there is no universally accepted definition of clusters in directed graphs. We first exploit relationships between the graph Laplacian and transfer operators and in particular between clusters in undirected graphs and metastable sets in stochastic dynamical systems and then use a generalization of the notion of metastability to derive clustering algorithms for directed and time-evolving graphs. The resulting clusters can be interpreted as coherent sets, which play an important role in the analysis of transport and mixing processes in fluid flows. Y1 - 2022 U6 - https://doi.org/10.1007/s00332-022-09863-0 VL - 33 ER - TY - CHAP A1 - Kostre, Margarita A1 - Sunkara, Vikram A1 - Djurdjevac Conrad, Natasa T1 - Inference of historical influence networks T2 - International Conference on Complex Networks & Their Applications Proceedings N2 - We study the romanization process of northern Africa from 50 BC till 300 AD. Our goal is to infer the communication strength between different subregions, based on the evolution of the status of cities. Herefore, we use the general inverse infection model, that infers the weights of a known underlying network, given observations of the spreading on this network. As infection process we choose the SI metapopulation model, where I stands for a city with a Roman status. To solve the minimization problem we use the particle swarm optimization algorithm with a specific choice of parameters. Y1 - 2021 U6 - https://doi.org/10.12752/8558 SP - 110 EP - 113 ET - International Conference on Complex Networks & Their Applications ER - TY - JOUR A1 - Sarich, Marco A1 - Djurdjevac Conrad, Natasa A1 - Bruckner, Sharon A1 - Conrad, Tim A1 - Schütte, Christof T1 - Modularity revisited: A novel dynamics-based concept for decomposing complex networks JF - Journal of Computational Dynamics Y1 - 2014 UR - http://publications.mi.fu-berlin.de/1127/ U6 - https://doi.org/10.3934/jcd.2014.1.191 VL - 1 IS - 1 SP - 191 EP - 212 ER - TY - JOUR A1 - Lorenz, Philipp A1 - Wolf, Frederik A1 - Braun, Jonas A1 - Djurdjevac Conrad, Natasa A1 - Hövel, Philipp T1 - Capturing the Dynamics of Hashtag-Communities JF - International Workshop on Complex Networks and their Applications Y1 - 2017 U6 - https://doi.org/10.1007/978-3-319-72150-7_33 SP - 401 EP - 413 ER - TY - JOUR A1 - Zonker, Johannes A1 - Padilla-Iglesias, Cecilia A1 - Djurdjevac Conrad, Natasa T1 - Insights into drivers of mobility and cultural dynamics of African hunter-gatherers over the past 120 000 years JF - Royal Society Open Science N2 - Humans have a unique capacity to innovate, transmit and rely on complex, cumulative culture for survival. While an important body of work has attempted to explore the role of changes in the size and interconnectedness of populations in determining the persistence, diversity and complexity of material culture, results have achieved limited success in explaining the emergence and spatial distribution of cumulative culture over our evolutionary trajectory. Here, we develop a spatio-temporally explicit agent-based model to explore the role of environmentally driven changes in the population dynamics of hunter–gatherer communities in allowing the development, transmission and accumulation of complex culture. By modelling separately demography- and mobility-driven changes in interaction networks, we can assess the extent to which cultural change is driven by different types of population dynamics. We create and validate our model using empirical data from Central Africa spanning 120 000 years. We find that populations would have been able to maintain diverse and elaborate cultural repertoires despite abrupt environmental changes and demographic collapses by preventing isolation through mobility. However, we also reveal that the function of cultural features was also an essential determinant of the effects of environmental or demographic changes on their dynamics. Our work can therefore offer important insights into the role of a foraging lifestyle on the evolution of cumulative culture. Y1 - 2023 U6 - https://doi.org/10.1098/rsos.230495 VL - 10 IS - 11 ER - TY - JOUR A1 - Klus, Stefan A1 - Djurdjevac Conrad, Natasa T1 - Dynamical systems and complex networks: A Koopman operator perspective N2 - The Koopman operator has entered and transformed many research areas over the last years. Although the underlying concept–representing highly nonlinear dynamical systems by infinite-dimensional linear operators–has been known for a long time, the availability of large data sets and efficient machine learning algorithms for estimating the Koopman operator from data make this framework extremely powerful and popular. Koopman operator theory allows us to gain insights into the characteristic global properties of a system without requiring detailed mathematical models. We will show how these methods can also be used to analyze complex networks and highlight relationships between Koopman operators and graph Laplacians. Y1 - 2024 ER - TY - GEN A1 - Zonker, Johannes A1 - Padilla-Iglesias, Cecilia A1 - Djurdjevac Conrad, Natasa T1 - Supplementary code and data for Royal Society Open Science Manuscript rsos.230495 N2 - In this repository are all files necessary to run the agent-based model of the paper "Insights into drivers of mobility and cultural dynamics of African hunter–gatherers over the past 120 000 years", Royal Society Open Science, 10(11), 2023. Y1 - 2023 U6 - https://doi.org/10.12752/9254 ER -