Overview

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.

Full Product Details

Author:   Philipp Blanchard ,  Dimitri Volchenkov
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Volume:   10
Dimensions:   Width: 15.50cm , Height: 2.00cm , Length: 23.50cm
Weight:   0.582kg
ISBN:  

9783642195914

ISBN 10:   3642195911
Pages:   262
Publication Date:   27 May 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Awaiting stock  
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Table of Contents

Reviews

Author Information

Philippe Blanchard is a mathematical physicist of international stature. He has edited/authored a number of books for Springer and is member of various editorial boards (e.g. Fundamental Theories of Physics)

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions