國立高雄大學圖資館 |

Language: English

Back

Potential-based analysis of social, ...

Etesami, Seyed Rasoul.

Potential-based analysis of social, communication, and distributed networks

Record Type:	Electronic resources : Monograph/item
Title/Author:	Potential-based analysis of social, communication, and distributed networksby Seyed Rasoul Etesami.
Author:	Etesami, Seyed Rasoul.
Published:	Cham :Springer International Publishing :2017.
Description:	xxvii, 172 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Multiagent systems.
Online resource:	http://dx.doi.org/10.1007/978-3-319-54289-8
ISBN:	9783319542898$q(electronic bk.)

Potential-based analysis of social, communication, and distributed networks
Etesami, Seyed Rasoul.

Potential-based analysis of social, communication, and distributed networks[electronic resource] /by Seyed Rasoul Etesami. - Cham :Springer International Publishing :2017. - xxvii, 172 p. :ill., digital ;24 cm. - Springer theses,2190-5053. - Springer theses..

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.

ISBN: 9783319542898$q(electronic bk.)

Standard No.: 10.1007/978-3-319-54289-8doiSubjects--Topical Terms:

484868
Multiagent systems.

LC Class. No.: QA76.76.I58

Dewey Class. No.: 006.3

Potential-based analysis of social, communication, and distributed networks
LDR:02243nmm a2200325 a 4500 001 509165
003 DE-He213
005 20170914155249.0
006 m d
007 cr nn 008maaau
008 171121s2017 gw s 0 eng d
020 $a 9783319542898$q(electronic bk.)
020 $a 9783319542881$q(paper)
024 7 $a 10.1007/978-3-319-54289-8 $2 doi
035 $a 978-3-319-54289-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.76.I58
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
082 0 4 $a 006.3 $2 23
090 $a QA76.76.I58 $b E83 2017
100 1 $a Etesami, Seyed Rasoul. $3 775791
245 1 0 $a Potential-based analysis of social, communication, and distributed networks $h [electronic resource] / $c by Seyed Rasoul Etesami.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xxvii, 172 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer theses, $x 2190-5053
505 0 $a 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.
520 $a 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.
650 0 $a Multiagent systems. $3 484868
650 0 $a Potential theory (Mathematics) $3 205715
650 0 $a Online social networks. $3 281852
650 1 4 $a Engineering. $3 210888
650 2 4 $a Communications Engineering, Networks. $3 273745
650 2 4 $a Computer Communication Networks. $3 218087
650 2 4 $a Mathematics of Algorithmic Complexity. $3 675328
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Springer theses. $3 557607
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-54289-8
950 $a Engineering (Springer-11647)