Random graph dynamics / Rick Durrett.

By:

Durrett, Richard, 1951-

Material type: Text

TextSeries: Cambridge series on statistical and probabilistic mathematicsPublication details: Cambridge ; New York : Cambridge University Press, 2007.Description: 1 online resource (ix, 212 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9780511349836
0511349831
0521866561
9780521866569
0511546599
9780511546594

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Print version:: Random graph dynamics.DDC classification:

511/.5 22

LOC classification:

QA166.17 .D87 2007eb

Other classification:

31.12
SK 890
MAT 055f

Online resources:

Click here to access online

Contents:

Overview -- Erdös-Rényi random graphs -- Fixed degree distributions -- Power laws -- Small worlds -- Random walks -- CHKNS model.

Summary: 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.

Item type:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

Includes bibliographical references (pages 203-210) and index.

Overview -- Erdös-Rényi random graphs -- Fixed degree distributions -- Power laws -- Small worlds -- Random walks -- CHKNS model.

Print version record.

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.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.