Search

Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three main groups: "simple" models, "Hodge-coupled" models, and "order-coupled" (Dirac) models. Our framework is based on topology, discrete differential geometry as well as gradient flows and frustrations, and permits a systematic analysis of their properties. We establish an equivalence between the simple simplicial Kuramoto model and the standard Kuramoto model on pairwise networks under the condition of manifoldness of the simplicial complex. Then, starting from simple models, we describe the notion of simplicial synchronization and derive bounds on the coupling strength necessary or sufficient for achieving it. For some variants, we generalize these results and provide new ones, such as the controllability of equilibrium solutions. Finally, we explore a potential application in the reconstruction of brain functional connectivity from structural connectomes and find that simple edge-based Kuramoto models perform competitively or even outperform complex extensions of node-based models., Comment: 36 pages, 11 figures

Clusters or communities can provide a coarse-grained description of complex systems at multiple scales, but their detection remains challenging in practice. Community detection methods often define communities as dense subgraphs, or subgraphs with few connections in-between, via concepts such as the cut, conductance, or modularity. Here we consider another perspective built on the notion of local dominance, where low-degree nodes are assigned to the basin of influence of high-degree nodes, and design an efficient algorithm based on local information. Local dominance gives rises to community centers, and uncovers local hierarchies in the network. Community centers have a larger degree than their neighbors and are sufficiently distant from other centers. The strength of our framework is demonstrated on synthesized and empirical networks with ground-truth community labels. The notion of local dominance and the associated asymmetric relations between nodes are not restricted to community detection, and can be utilised in clustering problems, as we illustrate on networks derived from vector data.

We formulate a general Kuramoto model on weighted simplicial complexes where phases oscillators are supported on simplices of any order $k$. Crucially, we introduce linear and non-linear frustration terms that are independent of the orientation of the $k+1$ simplices, providing a natural generalization of the Sakaguchi-Kuramoto model. In turn, this provides a generalized formulation of the Kuramoto higher-order parameter as a potential function to write the dynamics as a gradient flow. With a selection of simplicial complexes of increasingly complex structure, we study the properties of the dynamics of the simplicial Sakaguchi-Kuramoto model with oscillators on edges to highlight the complexity of dynamical behaviors emerging from even simple simplicial complexes. We place ourselves in the case where the vector of internal frequencies of the edge oscillators lies in the kernel of the Hodge Laplacian, or vanishing linear frustration, and, using the Hodge decomposition of the solution, we understand how the nonlinear frustration couples the dynamics in orthogonal subspaces. We discover various dynamical phenomena, such as the partial loss of synchronization in subspaces aligned with the Hodge subspaces and the emergence of simplicial phase re-locking in regimes of high frustration.

In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected graph and augment its components with direction information. We show that only four classes of directed cycles exist, and that they can be fully distinguished by the organisation and number of source-sink node pairs and their antichain structure. We are particularly interested in Directed Acyclic Graphs and introduce a set of metrics that characterise the Minimal Cycle Basis using the Directed Acyclic Graphs metadata information. In particular, we numerically show that Transitive Reduction stabilises the properties of Minimal Cycle Bases measured by the metrics we introduced while retaining key properties of the Directed Acyclic Graph. This makes the metrics consistent characterisation of Directed Acyclic Graphs and the systems they represent. We measure the characteristics of the Minimal Cycle Bases of four models of Transitively Reduced Directed Acyclic Graphs and show that the metrics introduced are able to distinguish the models and are sensitive to their generating mechanisms.

Reopening strategies are crucial to balance efforts of economic revitalization and bringing back a sense of normalcy while mitigating outbreaks and effectively flattening the infection curve. This paper proposes practical reopening, monitoring and testing strategies for institutions to reintroduce physical meetings based on SIR simulations run on a student friendship network collected pre-Covid-19. These serve as benchmarks to assess several testing strategies that can be applied in physical classes. Our simulations show that the best outbreak mitigation results are obtained with full knowledge of contact, but are also robust to non-compliance of students to new social interaction guidelines, simulated by partial knowledge of the interactions. These results are not only applicable to institutions but also for any organization or company wanting to navigate the Covid-19 ravaged world., Comment: Accepted for publication in Sains Malaysiana

Traditional classification tasks learn to assign samples to given classes based solely on sample features. This paradigm is evolving to include other sources of information, such as known relations between samples. Here we show that, even if additional relational information is not available in the data set, one can improve classification by constructing geometric graphs from the features themselves, and using them within a Graph Convolutional Network. The improvement in classification accuracy is maximized by graphs that capture sample similarity with relatively low edge density. We show that such feature-derived graphs increase the alignment of the data to the ground truth while improving class separation. We also demonstrate that the graphs can be made more efficient using spectral sparsification, which reduces the number of edges while still improving classification performance. We illustrate our findings using synthetic and real-world data sets from various scientific domains., Comment: Published in Patterns; Date of Publication: 09 April 2021

We show that the classification performance of graph convolutional networks (GCNs) is related to the alignment between features, graph, and ground truth, which we quantify using a subspace alignment measure (SAM) corresponding to the Frobenius norm of the matrix of pairwise chordal distances between three subspaces associated with features, graph, and ground truth. The proposed measure is based on the principal angles between subspaces and has both spectral and geometrical interpretations. We showcase the relationship between the SAM and the classification performance through the study of limiting cases of GCNs and systematic randomizations of both features and graph structure applied to a constructive example and several examples of citation networks of different origins. The analysis also reveals the relative importance of the graph and features for classification purposes., Comment: Published in IEEE Transactions on Neural Networks and Learning Systems; Date of Publication: 11 January 2021

There is recent evidence that the $XY$ spin model on complex networks can display three different macroscopic states in response to the topology of the network underpinning the interactions of the spins. In this work, we present a novel way to characterise the macroscopic states of the $XY$ spin model based on the spectral decomposition of time series using topological information about the underlying networks. We use three different classes of networks to generate time series of the spins for the three possible macroscopic states. We then use the temporal Graph Signal Transform technique to decompose the time series of the spins on the eigenbasis of the Laplacian. From this decomposition, we produce spatial power spectra, which summarise the activation of structural modes by the non-linear dynamics, and thus coherent patterns of activity of the spins. These signatures of the macroscopic states are independent of the underlying networks and can thus be used as universal signatures for the macroscopic states. This work opens new avenues to analyse and characterise dynamics on complex networks using temporal Graph Signal Analysis., Comment: 8 pages, to be appear in Physical Review E

We study the directed Abelian sandpile model on a square lattice, with $K$ downward neighbors per site, $K > 2$. The $K=3$ case is solved exactly, which extends the earlier known solution for the $K=2$ case. For $K>2$, the avalanche clusters can have holes and side-branches and are thus qualitatively different from the $K=2$ case where avalance clusters are compact. However, we find that the critical exponents for $K>2$ are identical with those for the $K=2$ case, and the large scale structure of the avalanches for $K>2$ tends to the $K=2$ case., Comment: Accepted for publication in PRE

We present a method to find the best temporal partition at any time-scale and rank the relevance of partitions found at different time-scales. This method is based on random walkers coevolving with the network and as such constitutes a generalization of partition stability to the case of temporal networks. We show that, when applied to a toy model and real datasets, temporal stability uncovers structures that are persistent over meaningful time-scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of a network mesoscopic structures., Comment: 15 pages, 12 figures

Many complex systems are organized in the form of a network embedded in space. Important examples include the physical Internet infrastucture, road networks, flight connections, brain functional networks and social networks. The effect of space on network topology has recently come under the spotlight because of the emergence of pervasive technologies based on geo-localization, which constantly fill databases with people's movements and thus reveal their trajectories and spatial behaviour. Extracting patterns and regularities from the resulting massive amount of human mobility data requires the development of appropriate tools for uncovering information in spatially-embedded networks. In contrast with most works that tend to apply standard network metrics to any type of network, we argue in this paper for a careful treatment of the constraints imposed by space on network topology. In particular, we focus on the problem of community detection and propose a modularity function adapted to spatial networks. We show that it is possible to factor out the effect of space in order to reveal more clearly hidden structural similarities between the nodes. Methods are tested on a large mobile phone network and computer-generated benchmarks where the effect of space has been incorporated., Comment: This preprint version combines paper and supplemenatary material of published version. Original title "Beyond Space For Spatial Networks" changed for journal

Adaptive behavior, cognition and emotion are the result of a bewildering variety of brain spatiotemporal activity patterns. An important problem in neuroscience is to understand the mechanism by which the human brain's 100 billion neurons and 100 trillion synapses manage to produce this large repertoire of cortical configurations in a flexible manner. In addition, it is recognized that temporal correlations across such configurations cannot be arbitrary, but they need to meet two conflicting demands: while diverse cortical areas should remain functionally segregated from each other, they must still perform as a collective, i.e., they are functionally integrated. Here, we investigate these large-scale dynamical properties by inspecting the character of the spatiotemporal correlations of brain resting-state activity. In physical systems, these correlations in space and time are captured by measuring the correlation coefficient between a signal recorded at two different points in space at two different times. We show that this two-point correlation function extracted from resting-state fMRI data exhibits self-similarity in space and time. In space, self-similarity is revealed by considering three successive spatial coarse-graining steps while in time it is revealed by the 1/f frequency behavior of the power spectrum. The uncovered dynamical self-similarity implies that the brain is spontaneously at a continuously changing (in space and time) intermediate state between two extremes, one of excessive cortical integration and the other of complete segregation. This dynamical property may be seen as an important marker of brain well-being both in health and disease., Comment: 14 pages 13 figures; published online before print September 22