Related papers: Polychrony as Chinampas
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Synchrony is inevitable in many oscillating systems -- from the canonical alignment of two ticking grandfather clocks, to the mutual entrainment of beating flagella or spiking neurons. Yet both biological and manmade systems provide…
Nonlinear systems driven by recurrent signals are known to exhibit complex dynamical responses which, in the physiological context, can have important functional consequences. One of the simplest biological systems that is exposed to such…
This paper (parts I and II) provides an expository introduction to monotone and near-monotone dynamical systems associated to biochemical networks, those whose graphs are consistent or near-consistent. Many conclusions can be drawn from…
The functionality of an entity frequently necessitates the support of a group situated in another layer of the system. To unravel the profound impact of such group support on a system's resilience against cascading failures, we devise a…
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…
This paper examines networks of $n$ measuring parties sharing $m$ nonsignaling resources that can be locally wired together: that is, each party follows a scheme to measure the resources in a cascaded fashion with inputs to later resources…
We study a system of coupled pendula with diffusive interactions, which could depend both on positions and on momenta. The coupling structure is defined by an undirected network, while the dynamic equations are derived from a Hamiltonian;…
The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of…
This paper is the forth part of our series of work, is devoted to the analysis on the multiscales and cascade aspects of the statistical theory of isotropic turbulence based on the new Sedov-type solution. In this paper, we use the explicit…
We study the emergence of synchronisation in a chiral network of harmonic oscillators. The network consists of a set of locally incoherently pumped harmonic oscillators coupled pairwise in cascade with travelling field modes. Such cascaded…
We study a network of three populations of coupled phase oscillators with identical frequencies. The populations interact nonlocally, in the sense that all oscillators are coupled to one another, but more weakly to those in neighboring…
We study a non-linear dynamical system on networks inspired by the pitchfork bifurcation normal form. The system has several interesting interpretations: as an interconnection of several pitchfork systems, a gradient dynamical system and…
Synchronization of weakly-coupled non-linear oscillators is a ubiquitous phenomenon that has been observed across the natural sciences. We study the dynamics of optomechanical arrays - networks of mechanically compliant structures that…
The functions of many networked systems in physics, biology or engineering rely on a coordinated or synchronized dynamics of its constituents. In power grids for example, all generators must synchronize and run at the same frequency and…
We explore relations between cyclic sequences determined by a quadratic difference relation, cyclotomic polynomials, Eulerian digraphs and walks in the plane. These walks correspond to closed paths for which at each step one must turn…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
We investigate a model of transportation networks with nonlinear elements which may represent local shortage of resources. Frustrations arise from competition for resources. When the initial resources are uniform, different regimes with…
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of its performances. We concentrate on the logarithmic tail…
In a graph, we say that two nodes are topologically equivalent if their sets of first neighbors, excluding the two nodes, coincide. We prove that nonlinearly coupled heterogeneous oscillators located on a group of topologically equivalent…