Random Walks and Diffusions on Graphs and Databases An Introduction

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...

Full description

Main Authors: Blanchard, Philipp, Volchenkov, Dimitri (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2011, 2011
Edition:1st ed. 2011
Series:Springer Series in Synergetics
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Summary: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
Physical Description:XIV, 262 p online resource
ISBN:9783642195921