Related papers: Non-converging hysteretic cycles in random spin ne…
Convection structures in binary fluid mixtures are investigated for positive Soret coupling in the driving regime where solutal and thermal contributions to the buoyancy forces compete. Bifurcation properties of stable and unstable…
Clustering $\unicode{x2013}$ the tendency for neighbors of nodes to be connected $\unicode{x2013}$ quantifies the coupling of a complex network to its latent metric space. In random geometric graphs, clustering undergoes a continuous phase…
Motivated by the hyperfine interaction of electron spins with surrounding nuclei, we investigate systems of central spins coupled to a bath of noninteracting spins in the framework of random matrix theory. With increasing number of central…
A common feature of biological networks is the geometric property of self-similarity. Molecular regulatory networks through to circulatory systems, nervous systems, social systems and ecological trophic networks, show self-similar…
In [30] different statistical behavior of dynamical orbits without syndetic center are considered. In present paper we continue this project and consider different statistical behavior of dynamical orbits with nonempty syndetic center: Two…
Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. For non identical elements, the lack of…
Common experience suggests that attracting invariant sets in nonlinear dynamical systems are generally stable. Contrary to this intuition, we present a dynamical system, a network of pulse-coupled oscillators, in which \textit{unstable…
The topological information of a network can be retrieved equivalently from its complement consisting of the same nodes but complementary edges. Hence the partition of a network into certain substructures based on given criteria should be…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
Continuous and discrete time systems possessing strange non-chaotic attractors are under investigation. It is demonstrated that unpredictable trajectories exist in the dynamics. A recent numerical technique, the sequential test, is utilized…
We report on a hitherto unnoticed type of resonances occurring in scattering from networks (quantum graphs) which are due to the complex connectivity of the graph - its topology. We consider generic open graphs and show that any cycle leads…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Synchrony is one of the most common dynamical states emerging on networks. The speed of convergence towards synchrony provides a fundamental collective time scale for synchronizing systems. Here we study the asymptotic synchronization times…
Extreme events are emergent phenomena in multi-particle transport processes on complex networks. In practice, such events could range from power blackouts to call drops in cellular networks to traffic congestion on roads. All the earlier…
Motivated by recent experiments with two-component Bose-Einstein condensates, we study fully-connected spin models subject to an additional constraint. The constraint is responsible for the Hilbert space dimension to scale only linearly…
Extreme events such as earthquakes, floods, and power blackouts often display burst phenomena where multiple extreme events occur in quick succession or in bunches. This study examines bunching of extreme events on a complex network using a…
We consider the size and structure of the automorphism groups of a variety of empirical `real-world' networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We relate automorphism…
We analyze networked heterogeneous nonlinear systems, with diffusive coupling and interconnected over a generic static directed graph. Due to the network's hetereogeneity, complete synchronization is impossible, in general, but an emergent…
In contrast to dyadic interactions, higher-order interactions may contain one another, with subgroups naturally embedded within larger groups. These containment patterns arise empirically in ecology, sociology, computer science and the…
To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between…