東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Statistical physics of complex networks.

Xie, Huafeng.

Linked to FindBook

Google Book

Amazon

博客來

Statistical physics of complex networks.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Statistical physics of complex networks./
Author:	Xie, Huafeng.
Description:	86 p.
Notes:	Advisers: Brian Schwartz; Sergei Maslov.
Contained By:	Dissertation Abstracts International69-05B.
Subject:	Physics, Theory. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3313186
ISBN:	9780549651857

Statistical physics of complex networks.
Xie, Huafeng.

Statistical physics of complex networks. - 86 p.

Advisers: Brian Schwartz; Sergei Maslov.

Thesis (Ph.D.)--City University of New York, 2008.

We live in a connected world. It is of great practical importance and intellectual appeal to understand the networks surrounding us. In this work we study ranking of the nodes in complex networks. In large networks such as World Wide Web (WWW) and citation networks of scientific literature, searching by keywords is a common practice to retrieve useful information. On the WWW, apart from the contents of webpages, the topology of the network itself can be a rich source of information about their relative importance and relevancy to the search query. It is the effective utilization of this topological information [50] which advanced the Google search engine to its present position of the most popular tool on the WWW. The World-Wide Web (WWW) is characterized by a strong community structure in which communities of webpages are densely interconnected by hyperlinks. We study how such network architecture affects the average Google ranking of individual webpages in the community. Using a mean-field approximation, we quantify how the average Google rank of community's webpages depends on the degree to which it is isolated from the rest of the world in both incoming and outgoing directions, and alpha -- the only intrinsic parameter of Google's PageRank algorithm. We proceed with numerical study of simulated networks and empirical study of several internal web-communities within two US universities. The predictions of our mean-field treatment were qualitatively verified in those real-life networks. Furthermore, the value alpha = 0.15 used by Google seems to be optimized for the degree of isolation of communities as they exist in the actual WWW.

ISBN: 9780549651857Subjects--Topical Terms:

1019422
Physics, Theory.

Statistical physics of complex networks.
LDR:03384nam 2200289 a 45 001 946573
005 20110523
008 110523s2008 ||||||||||||||||| ||eng d
020 $a 9780549651857
035 $a (UMI)AAI3313186
035 $a AAI3313186
040 $a UMI $c UMI
100 1 $a Xie, Huafeng. $3 1269984
245 1 0 $a Statistical physics of complex networks.
300 $a 86 p.
500 $a Advisers: Brian Schwartz; Sergei Maslov.
500 $a Source: Dissertation Abstracts International, Volume: 69-05, Section: B, page: 3071.
502 $a Thesis (Ph.D.)--City University of New York, 2008.
520 $a We live in a connected world. It is of great practical importance and intellectual appeal to understand the networks surrounding us. In this work we study ranking of the nodes in complex networks. In large networks such as World Wide Web (WWW) and citation networks of scientific literature, searching by keywords is a common practice to retrieve useful information. On the WWW, apart from the contents of webpages, the topology of the network itself can be a rich source of information about their relative importance and relevancy to the search query. It is the effective utilization of this topological information [50] which advanced the Google search engine to its present position of the most popular tool on the WWW. The World-Wide Web (WWW) is characterized by a strong community structure in which communities of webpages are densely interconnected by hyperlinks. We study how such network architecture affects the average Google ranking of individual webpages in the community. Using a mean-field approximation, we quantify how the average Google rank of community's webpages depends on the degree to which it is isolated from the rest of the world in both incoming and outgoing directions, and alpha -- the only intrinsic parameter of Google's PageRank algorithm. We proceed with numerical study of simulated networks and empirical study of several internal web-communities within two US universities. The predictions of our mean-field treatment were qualitatively verified in those real-life networks. Furthermore, the value alpha = 0.15 used by Google seems to be optimized for the degree of isolation of communities as they exist in the actual WWW.
520 $a We then extend Google's PageRank algorithm to citation networks of scientific literature. Unlike hyperlinks, citations cannot be updated after the point of publication. This results in strong aging characteristics of citation networks that affect the performance of the PageRank algorithm. To rectify this we modify the PageRank algorithm to a new ranking method, CiteRank, in which the starting point of random surfers is exponentially biased towards more recent publications. The ranking results are compared for two rather different citation networks: all American Physical Society publications between 1893 and 2003 and the set of high energy physics theory (hep-th) preprints. Despite major differences between these two networks, we find that their optimal parameters of the CiteRank algorithm are remarkably similar.
590 $a School code: 0046.
650 4 $a Physics, Theory. $3 1019422
690 $a 0753
710 2 $a City University of New York. $b Physics. $3 1025716
773 0 $t Dissertation Abstracts International $g 69-05B.
790 $a 0046
790 1 0 $a Maslov, Sergei, $e advisor
790 1 0 $a Schwartz, Brian, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3313186