國立高雄大學圖資館 |

Language: English

Back

A statistical physics approach to sc...

Stanford University.

A statistical physics approach to scale-free networks and their behaviors.

Record Type:	Electronic resources : Monograph/item
Title/Author:	A statistical physics approach to scale-free networks and their behaviors.
Author:	Wu, Fang.
Description:	112 p.
Notes:	Adviser: Bernardo Huberman.
Notes:	Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2128.
Contained By:	Dissertation Abstracts International66-04B.
Subject:	Physics, Condensed Matter.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3171802
ISBN:	9780542087103

A statistical physics approach to scale-free networks and their behaviors.
Wu, Fang.

A statistical physics approach to scale-free networks and their behaviors. - 112 p.

Adviser: Bernardo Huberman.

Thesis (Ph.D.)--Stanford University, 2005.

This thesis studies five problems of network properties from a unified local-to-global viewpoint of statistical physics: (1) We propose an algorithm that allows the discovery of communities within graphs of arbitrary size, based on Kirchhoff theory of electric networks. Its time complexity scales linearly with the network size. We additionally show how this algorithm allows for the swift discovery of the community surrounding a given node without having to extract all the communities out of a graph. (2) We present a dynamical theory of opinion formation that takes explicitly into account the structure of the social network in which individuals are embedded. We show that the weighted fraction of the population that holds a certain opinion is a martingale. We show that the importance of a given node is proportional to its degree. We verify our predictions by simulations. (3) We show that, when the information transmissibility decays with distance, the epidemic spread on a scale-free network has a finite threshold. We test our predictions by measuring the spread of messages in an organization and by numerical experiments. (4) Suppose users can switch between two behaviors when entering a queueing system: one that never restarts an initial request and one that restarts infinitely often. We show the existence of two thresholds. When the system load is below the lower threshold, it is always better off to be impatient. When above, it is always better off to be patient. Between the two thresholds there exists a homogeneous Nash equilibrium with non-trivial properties. We obtain exact solutions for the two thresholds. (5) We study the endogenous dynamics of reputations in a system consisting of firms with long horizons that provide services with varying levels of quality, and customers who assign to them reputations on the basis of the quality levels that they experience when interacting with them. We show that the dynamics can lead to either well defined equilibria or persistent nonlinear oscillations in the number of customers visiting a firm, implying unstable reputations. We establish the stable criteria.

ISBN: 9780542087103Subjects--Topical Terms:

226939
Physics, Condensed Matter.

A statistical physics approach to scale-free networks and their behaviors.
LDR:03075nmm _2200253 _450 001 170666
005 20061228142213.5
008 090528s2005 eng d
020 $a 9780542087103
035 $a 00242696
040 $a UnM $c UnM
100 0 $a Wu, Fang. $3 244694
245 1 2 $a A statistical physics approach to scale-free networks and their behaviors.
300 $a 112 p.
500 $a Adviser: Bernardo Huberman.
500 $a Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2128.
502 $a Thesis (Ph.D.)--Stanford University, 2005.
520 # $a This thesis studies five problems of network properties from a unified local-to-global viewpoint of statistical physics: (1) We propose an algorithm that allows the discovery of communities within graphs of arbitrary size, based on Kirchhoff theory of electric networks. Its time complexity scales linearly with the network size. We additionally show how this algorithm allows for the swift discovery of the community surrounding a given node without having to extract all the communities out of a graph. (2) We present a dynamical theory of opinion formation that takes explicitly into account the structure of the social network in which individuals are embedded. We show that the weighted fraction of the population that holds a certain opinion is a martingale. We show that the importance of a given node is proportional to its degree. We verify our predictions by simulations. (3) We show that, when the information transmissibility decays with distance, the epidemic spread on a scale-free network has a finite threshold. We test our predictions by measuring the spread of messages in an organization and by numerical experiments. (4) Suppose users can switch between two behaviors when entering a queueing system: one that never restarts an initial request and one that restarts infinitely often. We show the existence of two thresholds. When the system load is below the lower threshold, it is always better off to be impatient. When above, it is always better off to be patient. Between the two thresholds there exists a homogeneous Nash equilibrium with non-trivial properties. We obtain exact solutions for the two thresholds. (5) We study the endogenous dynamics of reputations in a system consisting of firms with long horizons that provide services with varying levels of quality, and customers who assign to them reputations on the basis of the quality levels that they experience when interacting with them. We show that the dynamics can lead to either well defined equilibria or persistent nonlinear oscillations in the number of customers visiting a firm, implying unstable reputations. We establish the stable criteria.
590 $a School code: 0212.
650 # 0 $a Physics, Condensed Matter. $3 226939
690 $a 0611
710 0 # $a Stanford University. $3 212607
773 0 # $g 66-04B. $t Dissertation Abstracts International
790 $a 0212
790 1 0 $a Huberman, Bernardo, $e advisor
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3171802 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3171802