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

Buch | Hardcover
XXVII, 172 Seiten
2017 | 1st ed. 2017
Springer International Publishing (Verlag)
978-3-319-54288-1 (ISBN)

Lese- und Medienproben

Potential-Based Analysis of Social, Communication, and Distributed Networks - Seyed Rasoul Etesami
106,99 inkl. MwSt
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.

Syed Rasoul Etesami, PhD, performed his thesis research at the University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, and is now affiliated with Princeton University, Electrical Engineering department. He is the first ever recipient of the CSL Dissertation Award, given to a graduate student in engineering whose PhD thesis makes major advances to a topic area.

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.

Erscheinungsdatum
Reihe/Serie Springer Theses
Zusatzinfo XXVII, 172 p. 35 illus., 25 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 467 g
Themenwelt Mathematik / Informatik Informatik Netzwerke
Mathematik / Informatik Mathematik Angewandte Mathematik
Technik Elektrotechnik / Energietechnik
Technik Nachrichtentechnik
Schlagworte Algorithmic Complexity • approximation algorithm • Communications Engineering, Networks • Communications engineering / telecommunications • Competitive diffusion games • Computer Communication Networks • Control of distributed systems • Engineering • Engineering: general • Hegelsmann-Krause opinion dynamics • Hierarchical networks • markov chains • Mathematical Modelling • Mathematics of Algorithmic Complexity • Nash Equilibria • network hardware • Online Social Networks • Quantized consensus protocol • Time-varying networks • Unbiased quantized algorithm
ISBN-10 3-319-54288-5 / 3319542885
ISBN-13 978-3-319-54288-1 / 9783319542881
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Ein einführendes Lehrbuch

von Wolfgang Riggert; Ralf Lübben

Buch | Hardcover (2022)
Hanser, Carl (Verlag)
34,99
das umfassende Handbuch für den Einstieg in die Netzwerktechnik

von Martin Linten; Axel Schemberg; Kai Surendorf

Buch | Hardcover (2023)
Rheinwerk (Verlag)
29,90
das Praxisbuch für Admins und DevOps-Teams

von Michael Kofler

Buch | Hardcover (2023)
Rheinwerk (Verlag)
39,90