Potential-Based Analysis of Social, Communication, and Distributed Networks

• Κύριος συγγραφέας: Etesami, Seyed Rasoul (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2017.
• Σειρά: Springer Theses, Recognizing Outstanding Ph.D. Research,
• Θέματα: Engineering.; Computer communication systems.; Algorithms.; Electrical engineering.; Communications Engineering, Networks.; Computer Communication Networks.; Mathematics of Algorithmic Complexity.

 This work makes major contributions to the thriving area of social, communication, and distributed networks by introducing novel methodologies and tools toward the study of the evolutionary behaviors of these networks, as well as their computational complexity and rates of convergence. By departing from the classical approaches and results in the literature, this work shows that it is possible to handle more complex and realistic nonlinear models where either the traditional approaches fail or lead to weak results. The author also develops several easily implementable algorithms, delivering excellent performance guarantees while running faster than those that exist in the literature. The study undertaken and the approaches adopted enable the analysis of the evolution of several different types of social and distributed networks, with the potential to apply to and resolve several other outstanding issues in such networks. 

 Introduction -- Notation and Mathematical Preliminaries -- Unbiased Quantized Consensus -- Metropolis Quantized Consensus -- Hegselmann-Krause Opinion Dynamics in Finite Dimensions -- Capacitated Selfish Replication Game -- Diffusion Games Over Social Networks -- Conclusions and Directions for Future Research.