Random walks and diffusions on graphs and databases: an introduction
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
Schriftenreihe: | Springer complexity : Springer series in synergetics
|
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | XIII, 262 S. Ill., graph. Darst. 235 mm x 155 mm |
ISBN: | 3642195911 9783642195914 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV039500680 | ||
003 | DE-604 | ||
005 | 20130319 | ||
007 | t | ||
008 | 110803s2011 gw ad|| |||| 00||| eng d | ||
016 | 7 | |a 1009990799 |2 DE-101 | |
020 | |a 3642195911 |9 3-642-19591-1 | ||
020 | |a 9783642195914 |9 978-3-642-19591-4 | ||
035 | |a (OCoLC)724923499 | ||
035 | |a (DE-599)DNB1009990799 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-11 |a DE-824 | ||
082 | 0 | |a 519.282 |2 22/ger | |
082 | 0 | |a 511.5 |2 22/ger | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a 520 |2 sdnb | ||
100 | 1 | |a Blanchard, Philippe |d 1942- |e Verfasser |0 (DE-588)120744635 |4 aut | |
245 | 1 | 0 | |a Random walks and diffusions on graphs and databases |b an introduction |c Philippe Blanchard ; Dimitri Volchenkov |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
300 | |a XIII, 262 S. |b Ill., graph. Darst. |c 235 mm x 155 mm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Springer complexity : Springer series in synergetics | |
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Irrfahrtsproblem |0 (DE-588)4162442-7 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | 1 | |a Irrfahrtsproblem |0 (DE-588)4162442-7 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Volchenkov, Dimitri |e Verfasser |0 (DE-588)1018502041 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-642-19592-1 |
856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3669479&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024194017&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024194017 |
Datensatz im Suchindex
_version_ | 1809403814726336512 |
---|---|
adam_text |
IMAGE 1
CONTENTS
1 INTRODUCTION TO PERMUTATIONS, MARKOV CHAINS, AND PARTITIONS 1
1.1 PERMUTATIONS AND THEIR MATRIX REPRESENTATIONS 1
1.2 PERMUTATION ORBITS AND FIXED POINTS 3
1.3 FIXED POINTS AND THE INCLUSION-EXCLUSION PRINCIPLE 5
1.4 FINITE MARKOV CHAINS 8
1.5 BIRKHOFF-VON NEUMANN THEOREM 9
1.6 GENERATING FUNCTIONS 10
1.7 PARTITIONS 13
1.7.1 COMPOSITIONS 13
1.7.2 MULTI-SET PERMUTATIONS 14
1.7.3 WEAK PARTITIONS 15
1.7.4 INTEGER PARTITIONS 16
1.8 CONCLUDING REMARKS AND FURTHER READING 17
2 WORTH ANOTHER BINARY RELATION: GRAPHS 19
2.1 BINARY RELATIONS AND THEIR GRAPHS 19
2.2 REPRESENTATION OF GRAPHS BY MATRICES 20
2.3 ALGEBRAIC PROPERTIES OF ADJACENCY OPERATORS 23
2.4 PERRON-FROBENIUS THEORY FOR ADJ ACENCY MATRICES 24
2.5 SPECTRAL DECOMPOSITION OF ADJACENCY OPERATORS 26
2.6 ADJACENCY AND WALKS ON A GRAPH 28
2.7 PRINCIPAL INVARIANTS OF THE GRAPH ADJACENCY MATRIX 30 2.8 EULER
CHARACTERISTIC AND GENUS OF A GRAPH 33
2.9 EULER CHARACTERISTICS AND GENUS OF COMPLEX NETWORKS 35 2.10 COLORING
A GRAPH 36
2.11 SHORTEST PATHS IN A GRAPH 38
2.12 CONCLUDING REMARKS AND FURTHER READING 41
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1009990799
DIGITALISIERT DURCH
IMAGE 2
X CONTENTS
3 PERMUTATIONS SIEVED THROUGH ADJACENCY: GRAPH AUTOMORPHISMS 43
3.1 GRAPH AUTOMORPHISMS 43
3.2 NONTRIVIAL GRAPH AUTOMORPHISMS AND THE STRUCTURE OF EIGENVECTORS OF
THE ADJACENCY MATRIX 45
3.3 AUTOMORPHISM INVARIANT LINEAR FUNCTIONS OF A GRAPH 47 3.3.1
AUTOMORPHISM INVARIANT STOCHASTIC PROCESSES 48 3.3.2 AUTOMORPHISM
INVARIANT HARMONIC FUNCTIONS 49 3.4 RELATIONS BETWEEN EIGENVALUES OF
AUTOMORPHISM
INVARIANT LINEAR FUNCTIONS 51
3.5 SUMMARY 54
4 EXPLORING UNDIRECTED GRAPHS BY RANDOM WALKS 55
4. 1 GRAPHS AS DISCRETE TIME DYNAMICAL SYSTEMS 56
4.2 GENERATING FUNCTIONS OF THE TRANSITION PROBABILITIES 57 4.3
CAYLEY-HAMILTON'S THEOREM FOR RANDOM WALKS 58
4.4 STATIONARY DISTRIBUTION AND RECURRENCE TIME OF RANDOM WALKS. 59 4.5
ENTROPY OF RANDOM WALKS DEFINED ON A GRAPH 61
4.6 HYPERBOLIC EMBEDDINGS OF GRAPHS BY TRANSITION EIGENVECTORS . 64
4.7 EXPLORING THE SHAPE OF A GRAPH BY RANDOM CURRENTS 68
4.8 SUMMARY 72
5 EMBEDDING OF GRAPHS IN PROBABILISTIC EUCLIDEAN SPACE 73 5.1 METHODS OF
GENERALIZED INVERSES IN THE STUDY OF GRAPHS 73 5.2 AFFINE PROBABILISTIC
GEOMETRY OF PSEUDO-INVERSES 75
5.3 REDUCTION TO EUCLIDEAN METRIC GEOMETRY 76
5.4 PROBABILISTIC INTERPRETATION OF EUCLIDEAN GEOMETRY 77 5.5
PROBABILISTIC EMBEDDING OF SIMPLE GRAPHS 79
5.6 GROUP GENERALIZED INVERSE OF THE LAPLACE OPERATOR FOR DIRECTED
GRAPHS 81
5.7 SUMMARY 83
6 RANDOM WALKS AND ELECTRIC RESISTANCE NETWORKS 85
6.1 ELECTRIC RESISTANCE NETWORK AND ITS PROBABILISTIC INTERPRETATION .
85 6.2 DISSIPATION AND EFFECTIVE RESISTANCE IN ELECTRIC RESISTANCE
NETWORKS 87
6.3 EFFECTIVE RESISTANCE IS BOUNDED ABOVE BY THE SHORTEST PATH DISTANCE
89
6.4 KIRCHHOFFAND WIENER INDEXES OF A GRAPH 90
6.5 RELATION BETWEEN EFFECTIVE RESISTANCES AND COMMUTE TIMES 90
6.6 SUMMARY 91
IMAGE 3
CONTENTS XI
7 RANDOM WALKS AND DIFFUSIONS ON DIRECTED GRAPHS AND INTERACTING
NETWORKS 93
7.1 RANDOM WALKS ON DIRECTED GRAPHS 93
7.1.1 A TIME FORWARD RANDOM WALK 94
7.1.2 BACKWARD TIME RANDOM WALKS 94
7.1.3 STATIONARY DISTRIBUTIONS OF RANDOM WALKS ON DIRECTED GRAPHS 95
7.2 LAPLACE OPERATOR DEFINED ON APERIODIC STRONGLY CONNECTED DIRECTED
GRAPHS 96
7.2.1 BI-ORTHOGONAL DECOMPOSITION OF RANDOM WALKS DEFINED ON STRONGLY
CONNECTED DIRECTED GRAPHS 98
7.3 SPECTRAL ANALYSIS OF SELF-ADJOINT OPERATORS DEFINED ON DIRECTED
GRAPHS 101
7.4 SELF-ADJOINT OPERATORS DEFINED ON INTERACTING NETWORKS 103 7.5
SUMMARY 105
8 STRUCTURAL ANALYSIS OF NETWORKS AND DATABASES 107
8.1 STRUCTURE AND FUNCTION IN COMPLEX NETWORKS AND DATABASES 108 8.2
GRAPH CUT PROBLEMS 109
8.2.1 WEAKLY CONNECTED GRAPH COMPONENTS 110
8.2.2 GRAPH PARTITIONING OBJECTIVES AS TRACE OPTIMIZATION PROBLEMS 112
8.3 MARKOV CHAINS ESTIMATE LAND VALUE IN CITIES 116
8.3.1 SPATIAL NETWORKS OF URBAN ENVIRONMENTS 117
8.3.2 SPECTRA OF CITIES 118
8.3.3 FIRST-PASSAGE TIMES TO GHETTOS 120
8.3.4 RANDOM WALKS ESTIMATE LAND VALUE IN MANHATTAN 121 8.4 UNRAVELING
THE TANGLES OF LANGUAGE EVOLUTION 123
8.4.1 APPLYING PHYLOGENETIC METHODS TO LANGUAGE TAXONOMIES 124
8.4.2 THE DATA SET WE HAVE USED 125
8.4.3 THE RELATIONS AMONG LANGUAGES ENCODED IN THE MATRIX OF LEXICAL
DISTANCES 126
8.4.4 THE STRUCTURAL COMPONENT ANALYSIS ON LANGUAGE DATA. 128 8.4.5
PRINCIPAL STRUCTURAL COMPONENTS OF THE LEXICAL DISTANCE DATA 131
8.4.6 GEOMETRIC REPRESENTATION OF THE INDO-EUROPEAN FAMILY 132
8.4.7 IN SEARCH OF LOST TIME 135
8.4.8 EVIDENCE FOR PROTO-INDO-EUROPEANS 137
8.4.9 IN SEARCH OF POLYNESIAN ORIGINS 140
8.4.10 GEOMETRIC REPRESENTATION OF MALAGASY DIALECTS 144 8.4.11
AUSTRONESIAN LANGUAGES RIDING AN EXPRESS TRAIN 148
IMAGE 4
XII CONTENTS
8.5 MARKOV CHAIN ANALYSIS OF MUSICAL DICE GAMES 152
8.5.1 MUSICAL DICE GAME AS A MARKOV CHAIN 153
8.5.2 ENCODING OF A DISCRETE MODEL OF MUSIC (MIDI) INTO A TRANSITION
MATRIX 156
8.5.3 MUSICAL DICE GAME AS A GENERALIZED COMMUNICATION PROCESS 160
8.5.4 FIRST PASSAGE TIMES TO NOTES RESOLVE TONALITY OF MUSICAL DICE
GAMES 164
8.5.5 FIRST PASSAGE TIMES TO NOTES FEATURE A COMPOSER 167 8.6 SUMMARY
170
9 WHEN FEEDBACKS MATTER: EPIDEMICS, SYNCHRONIZATION, AND SELF-REGULATION
IN COMPLEX NETWORKS 171
9.1 SUSCEPTIBLE-INFECTED-SUSCEPTIBLE MODELS IN EPIDEMICS 172 9.1.1
DYNAMICAL EQUATION OF THE EPIDEMIC SPREADING IN SCALE FREE NETWORKS 172
9.1.2 SIMPLIFIED EQUATION FOR LOW INFECTION RATES 174 9.1.3 STATIONARY
SOLUTION OF THE EPIDEMIC EQUATION FOR LOW INFECTION RATES 175
9.1.4 DYNAMICAL SOLUTION OF THE EVOLUTION EQUATION FOR LOW INFECTION
RATES 178
9.2 EPIDEMIC SPREADING IN EVOLUTIONARY SCALE FREE NETWORKS 180 9.3
TRANSITIONS TO INTERMITTENCY AND COLLECTIVE BEHAVIOR IN RANDOMLY COUPLED
MAP NETWORKS 183
9.3.1 THE MODEL OF RANDOM NETWORKS OF COUPLED MAPS 185 9.3.2
SPATIOTEMPORAL INTERMITTENCY AND COLLECTIVE BEHAVIOR. 186 9.3.3 THE
EVOLUTION OF G(N,K) WITH K 193
9.4 THERMODYNAMICS OF RANDOM NETWORKS OF COUPLED MAPS 196
9.5 LARGE GENE EXPRESSION REGULATORY NETWORKS 202
9.5.1 A MODEL OF A LARGE GENE EXPRESSION REGULATORY NETWORKS 203
9.5.2 NUMERICAL ANALYSIS OF LARGE GENE EXPRESSION REGULATORY NETWORKS
206
9.6 MEAN FIELD APPROACH TO THE LARGE TRANSCRIPTION REGULATORY NETWORKS
213
9.7 SUMMARY 217
10 CRITICAL PHENOMENA ON LARGE GRAPHS WITH REGULAR SUBGRAPHS 219
10.1 DESCRIPTION OF THE MODEL AND THE RESULTS 221
10.2 THE REGULAR SUBGRAPHS VIEWED AS RIEMANN SURFACES 222 10.3 NONLINEAR
DIFFUSIONS THROUGH COMPLEX NETWORKS 224
IMAGE 5
CONTENTS XIII
10.4 DIFFUSION AS A GENERALIZED BROWNIAN MOTION 229
10.5 SCALING OF A SCALAR FIELD COUPLED TO A COMPLEX NETWORK 233 10.6
SUMMARY 235
REFERENCES 237
GLOSSARY OF GRAPH THEORY 258
INDEX 259 |
any_adam_object | 1 |
author | Blanchard, Philippe 1942- Volchenkov, Dimitri |
author_GND | (DE-588)120744635 (DE-588)1018502041 |
author_facet | Blanchard, Philippe 1942- Volchenkov, Dimitri |
author_role | aut aut |
author_sort | Blanchard, Philippe 1942- |
author_variant | p b pb d v dv |
building | Verbundindex |
bvnumber | BV039500680 |
classification_rvk | SK 890 |
ctrlnum | (OCoLC)724923499 (DE-599)DNB1009990799 |
dewey-full | 519.282 511.5 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics 511 - General principles of mathematics |
dewey-raw | 519.282 511.5 |
dewey-search | 519.282 511.5 |
dewey-sort | 3519.282 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik Geographie |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV039500680</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130319</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110803s2011 gw ad|| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1009990799</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642195911</subfield><subfield code="9">3-642-19591-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642195914</subfield><subfield code="9">978-3-642-19591-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)724923499</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1009990799</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-824</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.282</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">520</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Blanchard, Philippe</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120744635</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Random walks and diffusions on graphs and databases</subfield><subfield code="b">an introduction</subfield><subfield code="c">Philippe Blanchard ; Dimitri Volchenkov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 262 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Springer complexity : Springer series in synergetics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Irrfahrtsproblem</subfield><subfield code="0">(DE-588)4162442-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Irrfahrtsproblem</subfield><subfield code="0">(DE-588)4162442-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Volchenkov, Dimitri</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1018502041</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-642-19592-1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3669479&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024194017&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024194017</subfield></datafield></record></collection> |
id | DE-604.BV039500680 |
illustrated | Illustrated |
indexdate | 2024-09-06T00:19:05Z |
institution | BVB |
isbn | 3642195911 9783642195914 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024194017 |
oclc_num | 724923499 |
open_access_boolean | |
owner | DE-11 DE-824 |
owner_facet | DE-11 DE-824 |
physical | XIII, 262 S. Ill., graph. Darst. 235 mm x 155 mm |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Springer |
record_format | marc |
series2 | Springer complexity : Springer series in synergetics |
spelling | Blanchard, Philippe 1942- Verfasser (DE-588)120744635 aut Random walks and diffusions on graphs and databases an introduction Philippe Blanchard ; Dimitri Volchenkov Berlin [u.a.] Springer 2011 XIII, 262 S. Ill., graph. Darst. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Springer complexity : Springer series in synergetics Graphentheorie (DE-588)4113782-6 gnd rswk-swf Irrfahrtsproblem (DE-588)4162442-7 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Irrfahrtsproblem (DE-588)4162442-7 s DE-604 Volchenkov, Dimitri Verfasser (DE-588)1018502041 aut Erscheint auch als Online-Ausgabe 978-3-642-19592-1 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3669479&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024194017&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Blanchard, Philippe 1942- Volchenkov, Dimitri Random walks and diffusions on graphs and databases an introduction Graphentheorie (DE-588)4113782-6 gnd Irrfahrtsproblem (DE-588)4162442-7 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4162442-7 |
title | Random walks and diffusions on graphs and databases an introduction |
title_auth | Random walks and diffusions on graphs and databases an introduction |
title_exact_search | Random walks and diffusions on graphs and databases an introduction |
title_full | Random walks and diffusions on graphs and databases an introduction Philippe Blanchard ; Dimitri Volchenkov |
title_fullStr | Random walks and diffusions on graphs and databases an introduction Philippe Blanchard ; Dimitri Volchenkov |
title_full_unstemmed | Random walks and diffusions on graphs and databases an introduction Philippe Blanchard ; Dimitri Volchenkov |
title_short | Random walks and diffusions on graphs and databases |
title_sort | random walks and diffusions on graphs and databases an introduction |
title_sub | an introduction |
topic | Graphentheorie (DE-588)4113782-6 gnd Irrfahrtsproblem (DE-588)4162442-7 gnd |
topic_facet | Graphentheorie Irrfahrtsproblem |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=3669479&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024194017&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT blanchardphilippe randomwalksanddiffusionsongraphsanddatabasesanintroduction AT volchenkovdimitri randomwalksanddiffusionsongraphsanddatabasesanintroduction |