Kalyagin / Koldanov / Pardalos Statistical Analysis of Graph Structures in Random Variable Networks

1. Auflage 2020
ISBN: 978-3-030-60293-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 101 Seiten, eBook

Reihe: SpringerBriefs in Optimization

This book studies complex systems with elements represented by random variables. Its main goal is to study and compare uncertainty of algorithms of network structure identification with applications to market network analysis. For this, a mathematical model of random variable network is introduced, uncertainty of identification procedure is defined through a risk function, random variables networks with different measures of similarity (dependence) are discussed, and general statistical properties of identification algorithms are studied. The volume also introduces a new class of identification algorithms based on a new measure of similarity and prove its robustness in a large class of distributions, and presents applications to social networks, power transmission grids, telecommunication networks, stock market networks, and brain networks through a theoretical analysis that identifies network structures. Both researchers and graduate students in computer science, mathematics, and optimization will find the applications and techniques presented useful.

Zielgruppe

Research

Autoren/Hrsg.

Kalyagin, V. A.

Koldanov, A. P.

Pardalos, P. M.

Inhaltsverzeichnis

1. Introduction.- 2. Random variable networks. -3. Network Identification Structure Algorithms.- 4. Uncertainty of Network Structure Identification.- 5. Robustness of Network Structure Identification.- 6. Optimality of Network Structure Identification.- 7. Applications to Market Network Analysis.- 8. Conclusion.- 9. References.