Thermokinetic relations.

Thermokinetic relations bound thermodynamic quantities, such as entropy production of a physical system over a certain time interval, with statistics of kinetic (or dynamical) observables, such as mean total variation of the observable over the time interval. We introduce a thermokinetic relation to bound the entropy production or the nonadiabatic (or excess) entropy production for overdamped Markov jump processes, possibly with time-varying rates and nonstationary distributions. For stationary cases, this bound is akin to a thermodynamic uncertainty relation, only involving absolute fluctuations rather than the mean square, thereby offering a better lower bound far from equilibrium.

The Diffusion of Smoking: Association Between School Tobacco Policies and the Diffusion of Adolescent Smoking in 38 Schools in 6 Countries.

Social network research has evidenced the role of peer effects in the adoption of behaviours. Little is known, however, about whether policies affect how behaviours are shared in a network. To contribute to this literature, we apply the concept of diffusion centrality to school tobacco policies and adolescent smoking.

Flow stability for dynamic community detection.

Many systems exhibit complex temporal dynamics due to the presence of different processes taking place simultaneously. An important task in these systems is to extract a simplified view of their time-dependent network of interactions. Community detection in temporal networks usually relies on aggregation over time windows or consider sequences of different stationary epochs.

State Aggregations in Markov Chains and Block Models of Networks.

We consider state-aggregation schemes for Markov chains from an information-theoretic perspective. Specifically, we consider aggregating the states of a Markov chain such that the mutual information of the aggregated states separated by T time steps is maximized. We show that for T=1 this recovers the maximum-likelihood estimator of the degree-corrected stochastic block model as a particular case, which enables us to explain certain features of the likelihood landscape of this generative network model from a dynamical lens.

The impact of human mobility data scales and processing on movement predictability.

Predictability of human movement is a theoretical upper bound for the accuracy of movement prediction models, which serves as a reference value showing how regular a dataset is and to what extent mobility can be predicted. Over the years, the predictability of various human mobility datasets was found to vary when estimated for differently processed datasets. Although attempts at the explanation of this variability have been made, the extent of these experiments was limited.

Structure-informed functional connectivity driven by identifiable and state-specific control regions.

Describing how the brain anatomical wiring contributes to the emergence of coordinated neural activity underlying complex behavior remains challenging. Indeed, patterns of remote coactivations that adjust with the ongoing task-demand do not systematically match direct, static anatomical links. Here, we propose that observed coactivation patterns, known as functional connectivity (FC), can be explained by a controllable linear diffusion dynamics defined on the brain architecture.

Network constraints on the mixing patterns of binary node metadata.

We consider the network constraints on the bounds of the assortativity coefficient, which aims to quantify the tendency of nodes with the same attribute values to be connected. The assortativity coefficient can be considered as the Pearson's correlation coefficient of node metadata values across network edges and lies in the interval [-1,1]. However, properties of the network, such as degree distribution and the distribution of node metadata values, place constraints upon the attainable values of the assortativity coefficient.

Stable biomarker identification for predicting schizophrenia in the human connectome.

Schizophrenia, as a psychiatric disorder, has recognized brain alterations both at the structural and at the functional magnetic resonance imaging level. The developing field of connectomics has attracted much attention as it allows researchers to take advantage of powerful tools of network analysis in order to study structural and functional connectivity abnormalities in schizophrenia. Many methods have been proposed to identify biomarkers in schizophrenia, focusing mainly on improving the classification performance or performing statistical comparisons between groups.

Multiscale dynamical embeddings of complex networks.

Complex systems and relational data are often abstracted as dynamical processes on networks. To understand, predict, and control their behavior, a crucial step is to extract reduced descriptions of such networks. Inspired by notions from control theory, we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect a node-input has on the network.

Category Theory for Autonomous and Networked Dynamical Systems.

In this discussion paper we argue that category theory may play a useful role in formulating, and perhaps proving, results in ergodic theory, topogical dynamics and open systems theory (control theory). As examples, we show how to characterize Kolmogorov-Sinai, Shannon entropy and topological entropy as the unique functors to the nonnegative reals satisfying some natural conditions. We also provide a purely categorical proof of the existence of the maximal equicontinuous factor in topological dynamics.

Outbreak of multidrug-resistant tuberculosis in South Africa undetected by WHO-endorsed commercial tests: an observational study.

Background: Global roll-out of rapid molecular assays is revolutionising the diagnosis of rifampicin resistance, predictive of multidrug-resistance, in tuberculosis. However, 30% of the multidrug-resistant (MDR) strains in an eSwatini study harboured the Ile491Phe mutation in the rpoB gene, which is associated with poor rifampicin-based treatment outcomes but is missed by commercial molecular assays or scored as susceptible by phenotypic drug-susceptibility testing deployed in South Africa. We evaluated the presence of Ile491Phe among South African tuberculosis isolates reported as isoniazid-monoresistant according to current national testing algorithms.

Multiscale mixing patterns in networks.

Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks, manifesting as a higher tendency of links occurring between people of the same age, race, or political belief. Quantifying the level of assortativity or disassortativity (the preference of linking to nodes with different attributes) can shed light on the organization of complex networks.

Dissipative open systems theory as a foundation for the thermodynamics of linear systems.

In this paper, we advocate the use of open dynamical systems, i.e. systems sharing input and output variables with their environment, and the dissipativity theory initiated by Jan Willems as models of thermodynamical systems, at the microscopic and macroscopic level alike.

The many facets of community detection in complex networks.

Community detection, the decomposition of a graph into essential building blocks, has been a core research topic in network science over the past years. Since a precise notion of what constitutes a community has remained evasive, community detection algorithms have often been compared on benchmark graphs with a particular form of assortative community structure and classified based on the mathematical techniques they employ. However, this comparison can be misleading because apparent similarities in their mathematical machinery can disguise different goals and reasons for why we want to employ community detection in the first place.

Graph partitions and cluster synchronization in networks of oscillators.

Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse-grained into clusters by means of External Equitable Partitions of the network graph and their associated quotient graphs. We exploit this graph-theoretical concept to study the phenomenon of cluster synchronization, in which different groups of nodes converge to distinct behaviors.

Diffusion on networked systems is a question of time or structure.

Network science investigates the architecture of complex systems to understand their functional and dynamical properties. Structural patterns such as communities shape diffusive processes on networks. However, these results hold under the strong assumption that networks are static entities where temporal aspects can be neglected.

Maximum work extraction and implementation costs for nonequilibrium Maxwell's demons.

We determine the maximum amount of work extractable in finite time by a demon performing continuous measurements on a quadratic Hamiltonian system subjected to thermal fluctuations, in terms of the information extracted from the system. The maximum work demon is found to apply a high-gain continuous feedback involving a Kalman-Bucy estimate of the system state and operates in nonequilibrium. A simple and concrete electrical implementation of the feedback protocol is proposed, which allows for analytic expressions of the flows of energy, entropy, and information inside the demon.

Trade integration and trade imbalances in the European Union: a network perspective.

We study the ever more integrated and ever more unbalanced trade relationships between European countries. To better capture the complexity of economic networks, we propose two global measures that assess the trade integration and the trade imbalances of the European countries. These measures are the network (or indirect) counterparts to traditional (or direct) measures such as the trade-to-GDP (Gross Domestic Product) and trade deficit-to-GDP ratios.

Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit.

In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the 'right' split into communities.

Centrality measures and thermodynamic formalism for complex networks.

In the study of small and large networks it is customary to perform a simple random walk where the random walker jumps from one node to one of its neighbors with uniform probability. The properties of this random walk are intimately related to the combinatorial properties of the network. In this paper we propose to use the Ruelle-Bowens random walk instead, whose probability transitions are chosen in order to maximize the entropy rate of the walk on an unweighted graph.