Weight allocation in Laplacian matrix of random networks based on geodesic distances
From MaRDI portal
Publication:5026729
DOI10.1080/00207721.2020.1758234zbMath1483.93030OpenAlexW3023303839MaRDI QIDQ5026729
Xuxin Zhang, Ya Zhang, Kecheng Liu
Publication date: 8 February 2022
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2020.1758234
Cites Work
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Tracking control for multi-agent consensus with an active leader and variable topology
- Consensus tracking in sensor networks with periodic sensing and switching connected topologies
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- A fully distributed weight design approach to consensus Kalman filtering for sensor networks
- Second-order consensus protocols based on transformed \(d\)-path Laplacians
- Consensus-based linear distributed filtering
- Optimizing the convergence rate of the quantum consensus: a discrete-time model
- On the signless Laplacian spectral radius of weighted digraphs
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations
- Attitude Synchronization for Flexible Spacecraft With Communication Delays
- Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
- Recursive Filtering for Time-Varying Systems with Random Access Protocol
- Bounds on the Smallest Eigenvalue of a Pinned Laplacian Matrix
- Necessary and Sufficient Conditions for Consensusability of Linear Multi-Agent Systems
- Event-triggered consensus control for uncertain multi-agent systems with external disturbance
- Leader-following scaled consensus of second-order multi-agent systems under directed topologies
- Moving Horizon Estimation for Networked Time-Delay Systems Under Round-Robin Protocol
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems
- Weighted Consensus Protocols Design Based on Network Centrality for Multi-Agent Systems With Sampled-Data
- Consensusability of Discrete-Time Dynamic Multiagent Systems
- Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks
- Time-Varying Formation Tracking for Linear Multiagent Systems With Multiple Leaders
This page was built for publication: Weight allocation in Laplacian matrix of random networks based on geodesic distances
