Random Graph Dynamics
Mei 2010 · Cambridge Series in Statistical and Probabilistic Mathematics Buku 20 · Cambridge University Press
e-Buku
203
Halaman
reportRating dan ulasan tidak disahkan Ketahui Lebih Lanjut
Perihal e-buku ini
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.
Berikan rating untuk e-Buku ini
Beritahu kami pendapat anda.
Maklumat pembacaan
Telefon pintar dan tablet
Pasang apl Google Play Books untuk Android dan iPad/iPhone. Apl ini menyegerak secara automatik dengan akaun anda dan membenarkan anda membaca di dalam atau luar talian, walau di mana jua anda berada.
Komputer riba dan komputer
Anda boleh mendengar buku audio yang dibeli di Google Play menggunakan penyemak imbas web komputer anda.
eReader dan peranti lain
Untuk membaca pada peranti e-dakwat seperti Kobo eReaders, anda perlu memuat turun fail dan memindahkan fail itu ke peranti anda. Sila ikut arahan Pusat Bantuan yang terperinci untuk memindahkan fail ke e-Pembaca yang disokong.
