國立虎尾科技大學 |

Random graph dynamics /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Random graph dynamics // Rick Durrett.
作者:	Durrett, Richard,
面頁冊數:	1 online resource (ix, 212 pages) :digital, PDF file(s). :
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Random graphs. -
電子資源:	https://doi.org/10.1017/CBO9780511546594
ISBN:	9780511546594 (ebook)

Random graph dynamics /
Durrett, Richard,1951-

Random graph dynamics /Rick Durrett. - 1 online resource (ix, 212 pages) :digital, PDF file(s). - Cambridge series on statistical and probabilistic mathematics ;20. - Cambridge series on statistical and probabilistic mathematics ;32..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

Overview -- Erdös-Rényi random graphs -- Fixed degree distributions -- Power laws -- Small worlds -- Random walks -- CHKNS model.

The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.

ISBN: 9780511546594 (ebook)Subjects--Topical Terms:

580184
Random graphs.

LC Class. No.: QA166.17 / .D87 2007

Dewey Class. No.: 511/.5

Random graph dynamics /
LDR:02263nam a2200313 i 4500 001 1127096
003 UkCbUP
005 20151005020622.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 240926s2007||||enk o ||1 0|eng|d
020 $a 9780511546594 (ebook)
020 $z 9780521866569 (hardback)
020 $z 9780521150163 (paperback)
035 $a CR9780511546594
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA166.17 $b .D87 2007
082 0 0 $a 511/.5 $2 22
100 1 $a Durrett, Richard, $d 1951- $e author. $3 1446279
245 1 0 $a Random graph dynamics / $c Rick Durrett.
264 1 $a Cambridge : $b Cambridge University Press, $c 2007.
300 $a 1 online resource (ix, 212 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
490 1 $a Cambridge series on statistical and probabilistic mathematics ; $v 20
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 $a Overview -- Erdös-Rényi random graphs -- Fixed degree distributions -- Power laws -- Small worlds -- Random walks -- CHKNS model.
520 $a The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.
650 0 $a Random graphs. $3 580184
776 0 8 $i Print version: $z 9780521866569
830 0 $a Cambridge series on statistical and probabilistic mathematics ; $v 32. $3 1133567
856 4 0 $u https://doi.org/10.1017/CBO9780511546594