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...
| Main Authors: | , |
|---|---|
| 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 |
Table of Contents:
- 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