Related papers: Consensus on simplicial complexes, or: The nonline…
We study gradient flows of general functionals with linear growth with very weak assumptions. Classical results concerning characterisation of solutions require differentiability of the Lagrangian, as for the time-dependent minimal surface…
Simplicial complexes are increasingly used to study complex system structure and dynamics including diffusion, synchronization and epidemic spreading. The spectral dimension of the graph Laplacian is known to determine the diffusion…
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed…
One of the more challenging tasks in the understanding of dynamical properties of models on top of complex networks is to capture the precise role of multiplex topologies. In a recent paper, Gomez et al. [Phys. Rev. Lett. 101, 028701…
In this paper, we study a class of equations representing nonlinear diffusion on networks. A particular instance of our model can be seen as a network equivalent of the porous-medium equation. We are interested in studying perturbations of…
Despite being a source of rich information, graphs are limited to pairwise interactions. However, several real-world networks such as social networks, neuronal networks, etc., involve interactions between more than two nodes. Simplicial…
The basic interaction unit of many dynamical systems involves more than two nodes. In such situations where networks are not an appropriate modelling framework, it has recently become increasingly popular to turn to higher-order models,…
Topological signals, i.e., dynamical variables defined on nodes, links, triangles, etc. of higher-order networks, are attracting increasing attention. However the investigation of their collective phenomena is only at its infancy. Here we…
Simplicial synchronization reveals the role that topology and geometry have in determining the dynamical properties of simplicial complexes. Simplicial network geometry and topology are naturally encoded in the spectral properties of the…
Consensus of autonomous agents is a benchmark problem in cooperative control. In this paper, we consider standard continuous-time averaging consensus policies (or Laplacian flows) over time-varying graphs and focus on robustness of…
For a finite number of agents evolving on a Euclidean space and linked to each other by a connected graph, the Laplacian flow that is based on the inter-agent errors, ensures consensus or synchronization for both first and second-order…
A study of regularity estimate for weak solution to generalized stationary Stokes-type systems involving $p$-Laplacian is offered. The governing systems of equations are based on steady incompressible flow of a Newtonian fluids. This paper…
This study develops an original and innovative matrix representation with respect to the information flow for networked multi-agent system. To begin with, the general concepts of the edge Laplacian of digraph are proposed with its algebraic…
Higher-order networks have so far been considered primarily in the context of studying the structure of complex systems, i.e., the higher-order or multi-way relations connecting the constituent entities. More recently, a number of studies…
We explore the problem of inferring the graph Laplacian of a weighted, undirected network from snapshots of a single or multiple discrete-time consensus dynamics, subject to parameter uncertainty, taking place on the network. Specifically,…
Quadratic Lyapunov functions are prevalent in stability analysis of linear consensus systems. In this paper we show that weighted sums of convex functions of the different coordinates are Lyapunov functions for irreducible consensus…
We develop wavelet representations for edge-flows on simplicial complexes, using ideas rooted in combinatorial Hodge theory and spectral graph wavelets. We first show that the Hodge Laplacian can be used in lieu of the graph Laplacian to…
Consensus on nonlinear spaces is of use in many control applications. This paper proposes a gradient descent flow algorithm for consensus on hypersurfaces. We show that if an inequality holds, then the system converges for almost all…
We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…
Foundations of a new projection-based model reduction approach for convection dominated nonlinear fluid flows are summarized. In this method the evolution of the flow is approximated in the Lagrangian frame of reference. Global basis…