Random Walks and Diffusions on Graphs and Databases
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...
Đã lưu trong:
Những tác giả chính: | , |
---|---|
Định dạng: | Sách |
Ngôn ngữ: | English |
Được phát hành: |
Springer - Verlag
2011
|
Những chủ đề: | |
Truy cập trực tuyến: | http://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/25946 |
Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
id |
oai:scholar.dlu.edu.vn:DLU123456789-25946 |
---|---|
record_format |
dspace |
spelling |
oai:scholar.dlu.edu.vn:DLU123456789-259462012-03-03T04:33:26Z Random Walks and Diffusions on Graphs and Databases Blanchard, Philippe Volchenkov, Dimitri Tin học Database 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. 2011-09-21T08:09:13Z 2011-09-21T08:09:13Z 2011 Book 978-3-642-19591-4 978-3-642-19592-1 http://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/25946 en application/pdf Springer - Verlag |
institution |
Thư viện Trường Đại học Đà Lạt |
collection |
Thư viện số |
language |
English |
topic |
Tin học Database |
spellingShingle |
Tin học Database Blanchard, Philippe Volchenkov, Dimitri Random Walks and Diffusions on Graphs and Databases |
description |
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. |
format |
Book |
author |
Blanchard, Philippe Volchenkov, Dimitri |
author_facet |
Blanchard, Philippe Volchenkov, Dimitri |
author_sort |
Blanchard, Philippe |
title |
Random Walks and Diffusions on Graphs and Databases |
title_short |
Random Walks and Diffusions on Graphs and Databases |
title_full |
Random Walks and Diffusions on Graphs and Databases |
title_fullStr |
Random Walks and Diffusions on Graphs and Databases |
title_full_unstemmed |
Random Walks and Diffusions on Graphs and Databases |
title_sort |
random walks and diffusions on graphs and databases |
publisher |
Springer - Verlag |
publishDate |
2011 |
url |
http://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/25946 |
_version_ |
1757677008309977088 |