Cargando…
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...
Autores principales: | Blanchard, Philippe, Volchenkov, Dimitri |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2011
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-642-19592-1 http://cds.cern.ch/record/1383381 |
Ejemplares similares
-
Infinite Ergodic Walks in Finite Connected Undirected Graphs †
por: Volchenkov, Dimitri
Publicado: (2021) -
Mathematical Analysis of Urban Spatial Networks
por: Blanchard, Philippe, et al.
Publicado: (2009) -
Survival under uncertainty: an introduction to probability models of social structure and evolution
por: Volchenkov, Dimitri
Publicado: (2016) -
Signed random walk diffusion for effective representation learning in signed graphs
por: Jung, Jinhong, et al.
Publicado: (2022) -
Groups, graphs and random walks
por: Ceccherini-Silberstein, Tullio, et al.
Publicado: (2017)