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...
| Huvudupphovsman: | |
|---|---|
| Institutionell upphovsman: | |
| Övriga upphovsmän: | |
| Materialtyp: | Electronic Resource |
| Språk: | English |
| Publicerad: |
Berlin, Heidelberg
Springer
2011.
|
| Serie: | Springer series in synergetics
|
| Ämnen: | |
| Länkar: | Available for University of the Philippines Diliman via SpringerLink. Click here to access |