相关论文: Synchrony and Anti-synchrony in Weighted Networks
Multiplex networks describe a large number of systems ranging from social networks to the brain. These multilayer structure encode information in their structure. This information can be extracted by measuring the correlations present in…
Being cognizant of the abundance of multi-body interactions in various complex systems, here we investigate a possible way to incorporate multi-body interactions in dynamical networks. Adopting hypergraph as the underlying architecture aids…
Subgraph counting is a fundamental task that underpins several network analysis methodologies, including community detection and graph two-sample tests. Counting subgraphs is a computationally intensive problem. Substantial research has…
By considering the eigenratio of the Laplacian of the connection graph as synchronizability measure, we propose a procedure for weighting dynamical networks to enhance theirsynchronizability. The method is based on node and edge betweenness…
Motivated by the empirical analysis of the air transportation system, we define a network model that includes geographical attributes along with topological and weight (traffic) properties. The introduction of geographical attributes is…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
Synchronization and resonance on networks are some of the most remarkable collective dynamical phenomena. The network topology, or the nature and distribution of the connections within an ensemble of coupled oscillators, plays a crucial…
A basic model of a dynamical distribution network is considered, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
In the light of the recently proposed scenario of asymmetry-induced synchronization (AISync), in which dynamical uniformity and consensus in a distributed system would demand certain asymmetries in the underlying network, we investigate…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
The emergence of synchronization in a network of coupled oscillators is a pervasive topic in various scientific disciplines ranging from biology, physics, and chemistry to social networks and engineering applications. A coupled oscillator…
We propose a natural model of evolving weighted networks in which new links are not necessarily connected to new nodes. The model allows a newly added link to connect directly two nodes already present in the network. This is plausible in…
Neural feedback-triads consisting of two feedback loops with a non-reciprocal lateral connection from one loop to the other are ubiquitous in the brain. We show analytically that the dynamics of this network topology are determined by two…
Designing high-performing networks requires optimizing for functionality while respecting physical, geometric, or budget constraints. Yet, mathematical and computational tools to design such systems remain limited, particularly for…
We characterize synchronization phenomenon in discrete-time, discrete-state random dynamical systems, with random and probabilistic Boolean networks as particular examples. In terms of multiplicative ergodic properties of the induced linear…
In this work a theory is developed for unifying large classes of nonlinear discrete-time dynamical systems obeying a superposition of a weighted maximum or minimum type. The state vectors and input-output signals evolve on nonlinear spaces…
In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph $\bar G$ of an unweighted…
The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a…
In this study, we apply a mean field theory to the neural network model with two periodic inputs in order to clarify the conditions of synchronies. This mean field theory yields a self-consistent condition for the synchrony and enables us…