Graph limit and exponential consensus for the large-scale multi-agent system with delay
From MaRDI portal
Cites work
- A noncommutative approach to the graphon Fourier transform
- A simple proof of the Cucker-Smale flocking dynamics and mean-field limit
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Collective dynamics of `small-world' networks
- Concentration of measure for graphon particle system
- Consensus formation in first-order graphon models with time-varying topologies
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Exponential convergence towards consensus for non-symmetric linear first-order systems in finite and infinite dimensions
- Exponential stability and relative controllability of nonsingular delay systems
- Flocking and asymptotic velocity of the Cucker-Smale model with processing delay
- Flocking in noisy environments
- Global Synchronization of Linearly Hybrid Coupled Networks with Time-Varying Delay
- Graph limit of the consensus model with self-delay
- Graphon mean field systems
- scientific article; zbMATH DE number 2114123 (Why is no real title available?)
- Hydrodynamic Cucker--Smale Model with Normalized Communication Weights and Time Delay
- Intentional delay can benefit consensus of second-order multi-agent systems
- Large networks and graph limits
- Mean field limit for Coulomb-type flows
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Mean-field limits: from particle descriptions to macroscopic equations
- Percolation on dense graph sequences
- Representation and stability of solutions of systems of functional differential equations with multiple delays
- Representation of solutions of neutral differential equations with delay and with linear parts defined by pairwise permutable matrices
- Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
- Sufficient conditions for the asymptotic stability of nonlinear multidelay differential equations with linear parts defined by pairwise permutable matrices
- The graph limit for a pairwise competition model
- The mean field equation for the Kuramoto model on graph sequences with non-Lipschitz limit
- The nonlinear heat equation on dense graphs and graph limits
This page was built for publication: Graph limit and exponential consensus for the large-scale multi-agent system with delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967028)