Performance Analysis of Communications Networks and Systems
From MaRDI portal
Publication:5323914
DOI10.1017/CBO9780511616488zbMath1168.94301OpenAlexW1585038871MaRDI QIDQ5323914
Publication date: 31 July 2009
Full work available at URL: https://doi.org/10.1017/cbo9780511616488
Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15) Signal detection and filtering (aspects of stochastic processes) (60G35) Communication theory (94A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
A new type of lower bound for the largest eigenvalue of a symmetric matrix ⋮ Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ Containment control of general multi-agent systems with directed random switching topology ⋮ Graphs with given diameter maximizing the algebraic connectivity ⋮ The minimal spectral radius of graphs with a given diameter ⋮ Influence of assortativity and degree-preserving rewiring on the spectra of networks ⋮ Graph spectra in computer science ⋮ The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights ⋮ Dynamic behaviour of competing memes' spread with alert influence in multiplex social-networks ⋮ The \(N\)-intertwined SIS epidemic network model ⋮ The correlation of metrics in complex networks with applications in functional brain networks ⋮ Approximate Verification of the Symbolic Dynamics of Markov Chains ⋮ Measuring agility of networked organizational structures via network entropy and mutual information ⋮ Weight of a link in a shortest path tree and the Dedekind Eta function ⋮ The impact of the topology on cascading failures in a power grid model ⋮ A topological investigation of phase transitions of cascading failures in power grids ⋮ Optimal design for manipulation of random consensus over discrete information in networked systems ⋮ WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m
This page was built for publication: Performance Analysis of Communications Networks and Systems
