Random graph dynamics
著者
書誌事項
Random graph dynamics
（Cambridge series on statistical and probabilistic mathematics）
Cambridge University Press, 2007
- : hbk
大学図書館所蔵 件 / 全38件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 203-210) and index
内容説明・目次
内容説明
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.
目次
- 1. Overview
- 2. Erdos-Renyi random graphs
- 3. Fixed degree distributions
- 4. Power laws
- 5. Small worlds
- 6. Random walks
- 7. CHKNS model.
「Nielsen BookData」 より
