Random Graph Dynamics (Paperback)

Rick Durrett

ISBN 10: 0521150167 / ISBN 13: 9780521150163

Published by Cambridge University Press, Cambridge, 2010

About this Item

Paperback. 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. This book presents a wide-ranging variety of mathematical argument to give insights into the small world model, the preferential attachment model and related random graphs. A unique feature is the focus on the dynamics of process taking place on the graphs in addition to geometric properties such as correctness and diameter. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Seller Inventory # 9780521150163

Bibliographic Details

• Title: Random Graph Dynamics (Paperback)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2010
• Language: English
• ISBN 10: 0521150167
• ISBN 13: 9780521150163
• Binding: Paperback
• Condition: new

About this title

Synopsis

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 about the same 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. While this literature is extensive, many of the papers are based on simulations and nonrigorous arguments. 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 of this book is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.

Book Description

The notion of six degrees of separation - that any two people on the planet can be connected by a short chain of people - inspired Strogatz and Watts to define the small world random graph, where each site is connected to close neighbors, but also has long range connections. At about the same time, it was observed in human social networks and on the internet that the number of neighbors of an individual has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers led to an explosion of research, but much was nonrigorous and relied on simulations. This book uses mathematical arguments to obtain insights into these graphs. A unique feature of this book is the interest in the dynamics of process taking place on the graphs in addition to their geometric properties, like correctness and diameter.