Related papers: Synchronization in Random Geometric Graphs
We consider the two problems of predicting links in a dynamic graph sequence and predicting functions defined at each node of the graph. In many applications, the solution of one problem is useful for solving the other. Indeed, if these…
Heterogeneity in the degree (connectivity) distribution has been shown to suppress synchronization in networks of symmetrically coupled oscillators with uniform coupling strength (unweighted coupling). Here we uncover a condition for…
We study the effect of structured higher-order interactions on the collective behavior of coupled phase oscillators. By combining a hypergraph generative model with dimensionality reduction techniques, we obtain a reduced system of…
In this paper, we revisit a well-known distributed projected subgradient algorithm which aims to minimize a sum of cost functions with a common set constraint. In contrast to most of existing results, weight matrices of the time-varying…
We review our recent work on the synchronization of a network of delay-coupled maps, focusing on the interplay of the network topology and the delay times that take into account the finite velocity of propagation of interactions. We assume…
Coupled Map Lattice (CML) models are particularly suitable to study spatially extended behaviours, such as wave-like patterns, spatio-temporal chaos, and synchronisation. Complete synchronisation in CMLs emerges when all maps have their…
We investigate the phenomenon of chaos synchronization in systems subject to coexisting autonomous and external global fields by employing a simple model of coupled maps. Two states of chaos synchronization are found: (i) complete…
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
Generalized synchronization is plausibly the most complex form of synchronization. Previous studies have revealed the existence of weak or strong forms of generalized synchronization depending on the multi- or mono-valued nature of the…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
There are three key factors of a system of coupled oscillators that characterize the interaction among them: coupling (how to affect), delay (when to affect) and topology (whom to affect). For each of them, the existing work has mainly…
Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate the connectivity of random geometric graphs (RGGs) in the…
Coupled cell systems model interacting dynamical units and provide a natural framework for studying synchrony phenomena arising from collective behavior. Graph symmetries often induce such patterns, but certain networks exhibit additional…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of their natural bijection strongly converges to a novel measure of graph correlation $\rho_T$ that neatly combines intergraph with intragraph…
Networks of coupled nonlinear oscillators have been used to model circadian rhythms, flashing fireflies, Josephson junction arrays, high-voltage electric grids, and many other kinds of self-organizing systems. Recently, several authors have…
In this paper, we study the problem of robust global synchronization of resetting clocks in multi-agent networked systems, where by robust global synchronization we mean synchronization that is insensitive to arbitrarily small disturbances,…
k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes,…
We study the synchronizability and the synchronization dynamics of networks of nonlinear oscillators. We investigate how the synchronization of the network is influenced by some of its topological features such as variations of the power…