Om denne e-bog
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.
Om forfatteren
Philippe Blanchard is a mathematical physicist of international stature. He has edited/authored a number of books for Springer and is member of various editorial boards (e.g. Fundamental Theories of Physics)
Bedøm denne e-bog
Fortæl os, hvad du mener.
Oplysninger om læsning
Smartphones og tablets
Installer appen Google Play Bøger til Android og iPad/iPhone. Den synkroniserer automatisk med din konto og giver dig mulighed for at læse online eller offline, uanset hvor du er.
Bærbare og stationære computere
Du kan høre lydbøger, du har købt i Google Play via browseren på din computer.
e-læsere og andre enheder
Hvis du vil læse på e-ink-enheder som f.eks. Kobo-e-læsere, skal du downloade en fil og overføre den til din enhed. Følg den detaljerede vejledning i Hjælp for at overføre filerne til understøttede e-læsere.
