Central Library

Normal view MARC view ISBD view

Potential-Based Analysis of Social, Communication, and Distributed Networks [electronic resource] / by Seyed Rasoul Etesami.

By: Etesami, Seyed Rasoul [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Springer Theses, Recognizing Outstanding Ph.D. Research: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017.Description: XXVII, 172 p. 35 illus., 25 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319542898.Subject(s): Telecommunication | Computer networks  | Mathematics | Communications Engineering, Networks | Computer Communication Networks | Applications of MathematicsAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 621.382 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.