Random walks and diffusions on graphs and databases. An introduction.
From MaRDI portal
Publication:633358
DOI10.1007/978-3-642-19592-1zbMath1242.05250OpenAlexW2491288911MaRDI QIDQ633358
Dimitri Volchenkov, Philippe Blanchard
Publication date: 31 March 2011
Published in: Springer Series in Synergetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19592-1
Applications of graph theory (05C90) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Random walks on graphs (05C81)
Related Items
A measure of dissimilarity between diffusive processes on networks, Dynamic graph models and their properties, Markov stochasticity coordinates, Relations between connected and self-avoiding hikes in labelled complete digraphs, Non-D-finite excursions in the quarter plane, Random walks and diffusion on networks, Hyperspherical embedding of graphs and networks in communicability spaces, Unnamed Item, Control of limit states in absorbing resource networks, Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs, Ideal flow of Markov Chain, Resource allocation among attractor vertices in asymmetric regular resource networks, Resource network with limited capacity of attractor vertices, Random walks with long-range steps generated by functions of Laplacian matrices, Random walks on networks with preferential cumulative damage: generation of bias and aging
Uses Software
