SearcharxivSearch

arXiv subjects

Wilfried Segnou

Publications and source records attributed to Wilfried Segnou.

3 recordsLinked to original sources

Turing patterns in Matrix-Weighted Networks

Diffusion-driven instability is a fundamental mechanism underlying pattern formation in spatially extended systems. In almost all existing works, diffusion across the links of the underlying network is modeled through scalar weights, possibly complemented by cross-diffusion terms that are homogeneous across links. In this work, we investigate the emergence of Turing patterns on Matrix Weighted Networks (MWNs), a recently introduced framework in which each edge is associated with a matrix weight. Focusing on the class of coherent MWNs, we provide a novel characterization of coherence in terms of node-dependent orthonormal matrices, showing that link transformations can be written as relative rotations between nodes. This representation allows us to deal with coherent MWNs of any size and to introduce an orthonormal change of variables capable to reduce diffusion on a coherent MWN to diffusion on a standard weighted network with scalar weights. Building on this, we extend the classical Turing instability analysis to MWNs and derive the conditions under which a homogeneous equilibrium of the local dynamics loses stability due to matrix-weighted diffusion. Moving beyond the dimensional constraints of previous approaches, our results show how network topology, scalar weights, and inter-node transformations jointly shape pattern formation, and provide a constructive framework to analyze and design Turing patterns on matrix-weighted and higher-order networked systems.

cond-mat.stat-mech

Synchronization of nonlinearly coupled Stuart-Landau oscillators on networks

The dynamics of coupled Stuart-Landau oscillators play a central role in the study of synchronization phenomena. Previous works have focused on linearly coupled oscillators in different configurations, such as all-to-all or generic complex networks, allowing for both reciprocal or non-reciprocal links. The emergence of synchronization can be deduced by proving the linear stability of the limit cycle solution for the Stuart-Landau model; the linear coupling assumption allows for a complete analytical treatment of the problem, mostly because the linearized system turns out to be autonomous. In this work, we analyze Stuart-Landau oscillators coupled through nonlinear functions on both undirected and directed networks; synchronization now depends on the study of a non-autonomous linear system and thus novel tools are required to tackle the problem. We provide a complete analytical description of the system for some choices of the nonlinear coupling, e.g., in the resonant case. Otherwise, we develop a semi-analytical framework based on Jacobi-Anger expansion and Floquet theory, which allows us to derive precise conditions for the emergence of complete synchronization. The obtained results extend the classical theory of coupled oscillators and pave the way for future studies of nonlinear interactions in networks of oscillators and beyond.

nlin.PS

Impact of directionality on the emergence of Turing patterns on m-directed higher-order structures

We hereby develop the theory of Turing instability for reaction-diffusion systems defined on m-directed hypergraphs, the latter being generalization of hypergraphs where nodes forming hyperedges can be shared into two disjoint sets, the head nodes and the tail nodes. This framework encodes thus for a privileged direction for the reaction to occur: the joint action of tail nodes is a driver for the reaction involving head nodes. It thus results a natural generalization of directed networks. Based on a linear stability analysis we have shown the existence of two Laplace matrices, allowing to analytically prove that Turing patterns, stationary or wave-like, emerges for a much broader set of parameters in the m-directed setting. In particular directionality promotes Turing instability, otherwise absent in the symmetric case. Analytical results are compared to simulations performed by using the Brusselator model defined on a m-directed d-hyperring as well as on a m-directed random hypergraph.

nlin.PS