| 書目名稱 | Random Walks and Diffusions on Graphs and Databases |
| 副標(biāo)題 | An Introduction |
| 編輯 | Philippe Blanchard,Dimitri Volchenkov |
| 視頻video | http://file.papertrans.cn/822/821097/821097.mp4 |
| 概述 | Written by the experts who have contributed to the original development of the field.Offers a lecture-based pedagogical approach for a broad audience.Includes detailed benchmarking of theory with dive |
| 叢書名稱 | Springer Series in Synergetics |
| 圖書封面 |  |
| 描述 | Most networks and databases that humans have to deal with contain large, albeit finite number of units. Their structure, for maintaining functional consistency of the components, is essentially not random and calls for a precise quantitative description of relations between nodes (or data units) and all network components. This book is an introduction, for both graduate students and newcomers to the field, to the theory of graphs and random walks on such graphs. The methods based on random walks and diffusions for exploring the structure of finite connected graphs and databases are reviewed (Markov chain analysis). This provides the necessary basis for consistently discussing a number of applications such diverse as electric resistance networks, estimation of land prices, urban planning, linguistic databases, music, and gene expression regulatory networks. |
| 出版日期 | Book 2011 |
| 關(guān)鍵詞 | Complex Networks; Diffusion metric; Effective resistance metric; Markov Chain Analysis; Path integral ap |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-19592-1 |
| isbn_softcover | 978-3-642-26842-7 |
| isbn_ebook | 978-3-642-19592-1Series ISSN 0172-7389 Series E-ISSN 2198-333X |
| issn_series | 0172-7389 |
| copyright | Springer-Verlag Berlin Heidelberg 2011 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-20 19:28
發(fā)表于 2025-3-21 19:58:53
