Transitional Behavior of q-Composite Random Key Graphs With Applications to Networked Control

DOI10.1109/TCNS.2017.2754379MaRDI QIDQ4630201FDO

Authors

Publication date 29 March 2019

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.08313

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Recommendations

• Distributed Estimation and Control of Algebraic Connectivity Over Random Graphs
• On rendezvous control with randomly switching communication graphs
• Control‐channel interactions in diffusive dynamical networks: A graph‐theoretic perspective
• <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Connectivity in Random Key Graphs With Unreliable Links
• Ergodic Randomized Algorithms and Dynamics Over Networks
• Controllability of system dynamics on networks, quantum walks and random walks
• Graphanalytical model of key distribution in networks with dynamic architecture

Cited in

(1)

• Transitional Behavior of q-Composite Random Key Graphs with Applications to Networked Control

This page was built for publication: Transitional Behavior of $q$-Composite Random Key Graphs With Applications to Networked Control

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