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
Tabla de Contenidos:
  • Introduction to Permutations, Markov Chains, and Partitions
  • Worth Another Binary Relation: Graphs
  • Permutations Sieved Through Adjacency: Garph Autormorphisms
  • Exploring Undirected Graphs by Random Walks
  • Embedding of Graphs in Probabilistic Euclidean Space
  • Random Walks and Electric Resistance Networks
  • Random Walks and Diffusions on Directed Graphs and Interacting Networks
  • Structural Analysis of Networks and Databases
  • When Feedbacks Matter: Epidemics, Synchronization, and Self-Regulation in Complex Networks
  • Critical Phenomena on Large Graphs With Regular Subgraphs
  • Glossary of Graph Theory.

Ejemplares similares