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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Blanchard, Philipp (Autor), Volchenkov, Dimitri (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:Springer Series in Synergetics, 10
Temas:
Graph theory.
Manifolds (Mathematics).
Data structures (Computer science).
Information theory.
Dynamics.
Nonlinear theories.
Graph Theory.
Manifolds and Cell Complexes.
Data Structures and Information Theory.
Applied Dynamical Systems.
Acceso en línea:Texto Completo
Descripción
Sumario: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.
Descripción Física:XIV, 262 p. online resource.
ISBN:9783642195921
ISSN:2198-333X ;

Ejemplares similares