Author:
Zhang Yi,Boley Daniel,Harwell John,Gini Maria
Publisher
Springer Nature Switzerland
Reference26 articles.
1. Alon, N., Avin, C., Kouckỳ, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(4), 481–502 (2011)
2. Barlow, M.T., Peres, Y., Sousi, P.: Collisions of random walks. Ann. l’IHP Probab. Stat. 48(4), 922–946 (2012)
3. Besenczi, R., Bátfai, N., Jeszenszky, P., Major, R., Monori, F., Ispány, M.: Large-scale simulation of traffic flow using Markov model. PLOS One 16(2) (2021)
4. Boley, D.: On fast computation of directed graph Laplacian pseudo-inverse. Linear Algebra Appl. 623, 128–148 (2021)
5. Boley, D., Ranjan, G., Zhang, Z.L.: Commute times for a directed graph using an asymmetric Laplacian. Linear Algebra Appl. 435(2), 224–242 (2011)