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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Blanchard, Philippe (Συγγραφέας), Volchenkov, Dimitri (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Σειρά:Springer Series in Synergetics, 10
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03361nam a22005295i 4500
001 978-3-642-19592-1
003 DE-He213
005 20151204142057.0
007 cr nn 008mamaa
008 110525s2011 gw | s |||| 0|eng d
020 |a 9783642195921  |9 978-3-642-19592-1 
024 7 |a 10.1007/978-3-642-19592-1  |2 doi 
040 |d GrThAP 
050 4 |a QC1-QC999 
072 7 |a PHU  |2 bicssc 
072 7 |a PBKD  |2 bicssc 
072 7 |a SCI064000  |2 bisacsh 
082 0 4 |a 621  |2 23 
100 1 |a Blanchard, Philippe.  |e author. 
245 1 0 |a Random Walks and Diffusions on Graphs and Databases  |h [electronic resource] :  |b An Introduction /  |c by Philippe Blanchard, Dimitri Volchenkov. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XIV, 262 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer Series in Synergetics,  |x 0172-7389 ;  |v 10 
505 0 |a 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. 
520 |a 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. 
650 0 |a Physics. 
650 0 |a Data structures (Computer science). 
650 0 |a Manifolds (Mathematics). 
650 0 |a Complex manifolds. 
650 0 |a Complexity, Computational. 
650 1 4 |a Physics. 
650 2 4 |a Complex Networks. 
650 2 4 |a Manifolds and Cell Complexes (incl. Diff.Topology). 
650 2 4 |a Data Structures, Cryptology and Information Theory. 
650 2 4 |a Complexity. 
700 1 |a Volchenkov, Dimitri.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642195914 
830 0 |a Springer Series in Synergetics,  |x 0172-7389 ;  |v 10 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-19592-1  |z Full Text via HEAL-Link 
912 |a ZDB-2-PHA 
950 |a Physics and Astronomy (Springer-11651)