Markov chain methods for analyzing urban networks
From MaRDI portal
Publication:960151
DOI10.1007/s10955-008-9591-2zbMath1151.82357arXiv0710.3566OpenAlexW2080277297MaRDI QIDQ960151
Publication date: 16 December 2008
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.3566
Traffic problems in operations research (90B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (3)
On the clique number of noisy random geometric graphs ⋮ Second-order consensus protocols based on transformed \(d\)-path Laplacians ⋮ Epidemic local final size in a metapopulation network as indicator of geographical priority for control strategies in SIR type diseases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- On the hidden beauty of the proper orthogonal decomposition
- Spatiotemporal analysis of complex signals: Theory and applications
- A refinement of Wigner's semicircle law in a neighborhood of the spectrum edge for random symmetric matrices
- Spatio-temporal symmetries and bifurcations via bi-orthogonal decompositions
- Laplacians and the Cheeger inequality for directed graphs
- Networks in life: Scaling properties and eigenvalue spectra
- On the concentration of eigenvalues of random symmetric matrices
- Interlacing for weighted graphs using the normalized Laplacian
- About the cover: Euler and Königsberg's Bridges: A historical view
- Centrality in networks of urban streets
- Intelligibility and first passage times in complex urban networks
- Spectra of random graphs with given expected degrees
- Über ein Paradoxon aus der Verkehrsplanung
- On Wigner's semicircle law for the eigenvalues of random matrices
This page was built for publication: Markov chain methods for analyzing urban networks
