000			03256nam a22004935i 4500
001			u375884
003			SIRSI
005			20160812084345.0
007			cr nn 008mamaa
008			110525s2011 gw | s |||| 0|eng d
020			_a9783642195921 _9978-3-642-19592-1
040			_cMX-MeUAM
050		4	_aQC1-QC999
082	0	4	_a621 _223
100	1		_aBlanchard, Philippe. _eauthor.
245	1	0	_aRandom Walks and Diffusions on Graphs and Databases _h[recurso electrónico] : _bAn Introduction / _cby Philippe Blanchard, Dimitri Volchenkov.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2011.
300			_aXIV, 262 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSpringer Series in Synergetics, _x0172-7389 ; _v10
505	0		_aIntroduction 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			_aMost 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	_aPhysics.
650		0	_aData structures (Computer science).
650		0	_aCell aggregation _xMathematics.
650		0	_aEngineering.
650	1	4	_aPhysics.
650	2	4	_aComplex Networks.
650	2	4	_aManifolds and Cell Complexes (incl. Diff.Topology).
650	2	4	_aData Structures, Cryptology and Information Theory.
650	2	4	_aComplexity.
700	1		_aVolchenkov, Dimitri. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642195914
830		0	_aSpringer Series in Synergetics, _x0172-7389 ; _v10
856	4	0	_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-19592-1
596			_a19
942			_cLIBRO_ELEC
999			_c203764 _d203764