Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks

DOI10.1109/TIT.2021.3127272MaRDI QIDQ5030359zbMATH OpenOpenAlexFDO

Authors Yuhao Yi, Bingjia Yang, Zuobai Zhang, Zhongzhi Zhang, Stacy Patterson

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2021.3127272

zbMATH Keywords

approximation algorithmcomplete graphscyclespathsperformance measuresrandom additive disturbancessecond-order consensus dynamicsstar graphssteady-state variance of deviation of vertex state from the averagesteady-state variance of pairwise differences between vertex statestotal steady-state variance

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
• Modeling spatial networks by contact graphs of disk packings
• Resistance distances in directed graphs: definitions, properties, and applications
• Simplicial Kirchhoff index of random complexes
• Diagonal of pseudoinverse of graph Laplacian: fast estimation and exact results

This page was built for publication: Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030359)