First return times on sparse random graphs
Sign Up to like & getrecommendations! Published in 2024 at "Journal of Physics A: Mathematical and Theoretical"
DOI: 10.1088/1751-8121/adb084
Abstract: We consider random walks in the form of nearest-neighbor hopping on Erdős–Rényi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field… read more here.
Keywords: return times; times sparse; first return; random graphs ... See more keywords
Predictions of first passage times in sparse discrete fracture networks using graph-based reductions.
Sign Up to like & getrecommendations! Published in 2017 at "Physical Review E"
DOI: 10.1103/physreve.96.013304
Abstract: We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and… read more here.
Keywords: fracture networks; graph based; times sparse; first passage ... See more keywords