Handbook of large-scale random networks
著者
書誌事項
Handbook of large-scale random networks
(Bolyai Society mathematical studies, 18)
Springer , János Bolyai Mathematical Society, c2009
- : Springer
- : János Bolyai Math. Soc.
大学図書館所蔵 全19件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
With the advent of digital computers more than half a century ago, - searchers working in a wide range of scienti?c disciplines have obtained an extremely powerful tool to pursue deep understanding of natural processes in physical, chemical, and biological systems. Computers pose a great ch- lenge to mathematical sciences, as the range of phenomena available for rigorous mathematical analysis has been enormously expanded, demanding the development of a new generation of mathematical tools. There is an explosive growth of new mathematical disciplines to satisfy this demand, in particular related to discrete mathematics. However, it can be argued that at large mathematics is yet to provide the essential breakthrough to meet the challenge. The required paradigm shift in our view should be compa- ble to the shift in scienti?c thinking provided by the Newtonian revolution over 300 years ago. Studies of large-scale random graphs and networks are critical for the progress, using methods of discrete mathematics, probabil- tic combinatorics, graph theory, and statistical physics. Recent advances in large scale random network studies are described in this handbook, which provides a signi?cant update and extension - yond the materials presented in the "Handbook of Graphs and Networks" published in 2003 by Wiley. The present volume puts special emphasis on large-scale networks and random processes, which deemed as crucial for - tureprogressinthe?eld. Theissuesrelatedtorandomgraphsandnetworks pose very di?cult mathematical questions.
目次
Part I: Theoretical Foundations
Chapter 1 Random graphs and branching processes
Bela Bollobas and Oliver Riordan (Cambridge University, UK)
Chapter 2 Sentry Selection in wireless networks
Paul Balister and Bela Bollobas (U of Memphis, TN, and Cambridge University, UK) Amites Sarkar and Mark Walters
Chapter 3 Scaling properties of complex networks and spanning trees
Reuven Cohen and Shlomo Havlin, (MIT, USA)
Chapter 4 Random Tree Growth with Branching Processes - a Survey
Anna Rudas and Balint Toth ( Technical University, Budapest, Hungary)
Part II. Large-scale networks in biological systems
Chapter 5 Reaction-diffusion processes in scale-free networks
Michele Catanzaro, Marian Boguna, and Romualdo Pastor-Satorras, (U Catalunya, Barcelona, Spain)
Chapter 6 Toward Understanding the Structure and Function of Cellular Interaction Networks
C. Christensen, J. Thakar and R. Albert (Penn State University, PA, USA)
Chapter 7 Scale-Free Cortical Planar Networks
Bela Bollobas (Cambridge University, UK), Walter J Freeman (UC Berkeley, CA), Robert Kozma (U of Memphis, TN, USA)
Chapter 8 Reconstructing Cortical Networks: Case of Directed Graphs with High Level of Reciprocity
Nepusz P., Bazso F, (KFKI, Hungarian Academy of Sciences), Negyessy L. (Semmelweis Medical University, Budapest, Hungary) Tusnady G. (Renyi Institute of Mathematics, Hungarian Academy of Sciences)
Part III. Large-scale networks in physics, technology, and the society
Chapter 9 k-clique percolation and clustering
Gergely Palla1, Daniel Abel, Illes J. Farkas, Peter Pollner, Imre Derenyi
Tamas Vicsek (Eotvos University, Budapest, Hungary)
Chapter 10 The inverse problem of evolving networks - with application to social nets
Gabor Csardi, Katherine J. Strandburg, Jan Tobochnik, and Peter Erdi, (KFKI, Hungarian Academy of Sciences, Budapest, Hungary and Kalamazoo College, Mi, USA)
Chapter 11 Learning and Representation: From Compressive Sampling to Szemeredi's Regularity Lemma
Andras Lorincz (Eotvos University, Budapest, Hungary)
Chapter 12 Telephone Call Network Data Mining: A Survey with Experiments Andras A. Benczur, Karoly Csalogany, Miklos Kurucz, Andras Lukacs, Laszlo Lukacs, David Siklosi (Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary)
「Nielsen BookData」 より