東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Search in social networks.

Muhamad, Roby.

FindBook

Google Book

Amazon

博客來

Search in social networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Search in social networks./
作者:	Muhamad, Roby.
面頁冊數:	147 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-09, Section: A, page: 3451.
Contained By:	Dissertation Abstracts International71-09A.
標題:	Sociology, Theory and Methods. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3420718
ISBN:	9781124174310

Search in social networks.
Muhamad, Roby.

Search in social networks. - 147 p.

Source: Dissertation Abstracts International, Volume: 71-09, Section: A, page: 3451.

Thesis (Ph.D.)--Columbia University, 2010.

More than four decades ago, Stanley Milgram and his collaborators performed a series of original experiments to test the small-world hypothesis: whether any random pair of individuals can be connected through short chains of acquaintances. They found support for the hypothesis and their results are currently known as the "six degrees of separation." Closer examinations, however, revealed that Milgram's experiments actually confirmed two related but distinct hypotheses: topological and algorithmic small-world hypotheses. Topological small-world hypothesis posits that there are short paths connecting two individuals. Algorithmic small-world hypothesis asserts that individuals with limited information can actually find these short paths by actively searching social networks. The goals of this dissertation are two-fold: (1) to test the algorithmic small-world hypothesis, and (2) to understand the mechanisms that make the algorithmic small-world possible. To achieve the first goal, we used data from our global internet-based search experiment and, using a novel statistical method, estimated algorithmic distance distributions. Then we used computational models to understand search processes and identified search strategies, individual characteristics, and structural conditions that increase the probability of success in search processes.

ISBN: 9781124174310Subjects--Topical Terms:

626625
Sociology, Theory and Methods.

Search in social networks.
LDR:02184nam 2200277 4500 001 1401433
005 20111020091953.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124174310
035 $a (UMI)AAI3420718
035 $a AAI3420718
040 $a UMI $c UMI
100 1 $a Muhamad, Roby. $3 1680566
245 1 0 $a Search in social networks.
300 $a 147 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-09, Section: A, page: 3451.
500 $a Adviser: Peter Bearman.
502 $a Thesis (Ph.D.)--Columbia University, 2010.
520 $a More than four decades ago, Stanley Milgram and his collaborators performed a series of original experiments to test the small-world hypothesis: whether any random pair of individuals can be connected through short chains of acquaintances. They found support for the hypothesis and their results are currently known as the "six degrees of separation." Closer examinations, however, revealed that Milgram's experiments actually confirmed two related but distinct hypotheses: topological and algorithmic small-world hypotheses. Topological small-world hypothesis posits that there are short paths connecting two individuals. Algorithmic small-world hypothesis asserts that individuals with limited information can actually find these short paths by actively searching social networks. The goals of this dissertation are two-fold: (1) to test the algorithmic small-world hypothesis, and (2) to understand the mechanisms that make the algorithmic small-world possible. To achieve the first goal, we used data from our global internet-based search experiment and, using a novel statistical method, estimated algorithmic distance distributions. Then we used computational models to understand search processes and identified search strategies, individual characteristics, and structural conditions that increase the probability of success in search processes.
590 $a School code: 0054.
650 4 $a Sociology, Theory and Methods. $3 626625
650 4 $a Information Science. $3 1017528
690 $a 0344
690 $a 0723
710 2 $a Columbia University. $3 571054
773 0 $t Dissertation Abstracts International $g 71-09A.
790 1 0 $a Bearman, Peter, $e advisor
790 $a 0054
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3420718