×

\( \Delta \)-functions on recurrent random walks. (English) Zbl 07729830

Summary: If a random walk on a countable infinite state space is reversible, there are known necessary and sufficient conditions for the walk to be recurrent. When the condition of reversibility is dropped, by using discrete Dirichlet solutions and balayage (concepts familiar in potential theory) one could partially retrieve some of the above results concerning the recurrence and the transience of the random walk.

MSC:

60J45 Probabilistic potential theory
60G50 Sums of independent random variables; random walks

References:

[1] McGuinness S., “Recurrent networks and a theorem of Nash-Williams”, Journal of Theoretical Probability, 4:1 (1991), 87-100 · Zbl 0722.60069 · doi:10.1007/BF01046995
[2] Anandam V., “Some potential-theoretic techniques in non-reversible Markov chains”, Rendiconti del Circolo Matematico di Palermo, 62:2 (2013), 273-284 · Zbl 1273.31010 · doi:10.1007/s12215-013-0124-8
[3] Anandam V., Harmonic functions and potentials on finite or infinite networks, Springer, Berlin, 2011 · Zbl 1239.31001 · doi:10.1007/978-3-642-21399-1
[4] Abodayeh K., Anandam V., “Potential-theoretic study of functions on an infinite network”, Hokkaido Mathematical Journal, 37:1 (2008), 59-73 · Zbl 1158.31300 · doi:10.14492/hokmj/1253539587
[5] Anandam V., Abodayeh K., “Non-locally-finite parahyperbolic networks”, Memoirs of The Graduate School of Science and Engineering, Shimane University. Series B: Mathematics, 47 (2014), 19-35 · Zbl 1298.31011
[6] Nash-Williams C.St J.A., “Random walk and electric currents in networks”, Mathematical Proceedings of the Cambridge Philosophical Society, 55:2 (1959), 181-194 · Zbl 0100.13602 · doi:10.1017/S0305004100033879
[7] Lyons T., “A simple criterion for transience of a reversible Markov chain”, The Annals of Probability, 11:2 (1983), 393-402 · Zbl 0509.60067 · doi:10.1214/aop/1176993604
[8] Woess W., “Random walks on infinite graphs and groups — a survey on selected topics”, Bulletin of the London Mathematical Society, 26:1 (1994), 1-60 · Zbl 0830.60061 · doi:10.1112/blms/26.1.1
[9] Cohen J.M., Colonna F., Singman D., “The distribution of radial eigenvalues of the Euclidean Laplacian on homogeneous isotropic trees”, Complex Analysis and its Synergies, 7:2 (2021), 21 · Zbl 1483.05020 · doi:10.1007/s40627-021-00071-2
[10] Colonna F., Tjani M., “Essential norms of weighted composition operators from reproducing kernel Hilbert spaces into weighted-type spaces”, Houston Journal of Mathematics, 42:3 (2016), 877-903 · Zbl 1360.47004
[11] Cohen J.M., Colonna F., Singman D., “A global Riesz decomposition theorem on trees without positive potentials”, Journal of the London Mathematical Society, 75:1 (2007), 1-17 · Zbl 1129.31004 · doi:10.1112/jlms/jdl001
[12] Anandam V., Damlakhi M., “Perturbed Laplace operators on finite networks”, Revue Roumaine de Mathématiques Pures et Appliquées, 61:2 (2016), 75-92 · Zbl 1399.35147
[13] Abodayeh K., Anandam V., “Schrödinger networks and their Cartesian products”, Mathematical Methods in the Applied Sciences, 44:6 (2020), 4342-4347 · Zbl 1469.31025 · doi:10.1002/mma.7034
[14] Abodayeh K., Anandam V., “Quasi-bounded supersolutions of discrete Schrödinger equations”, Applied Mathematical Sciences, 10:34 (2016), 1693-1704 · doi:10.12988/ams.2016.63111
[15] Nathiya N., Amulya Smyrna Ch., “Infinite Schrödinger networks”, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki, 31:4 (2021), 640-650 · Zbl 1483.31035 · doi:10.35634/vm210408
[16] Anandam V., “Random walks on infinite trees”, Revue Roumaine de Mathématiques Pures et Appliquées, 65:1 (2020), 75-82 · Zbl 07340511
[17] Lawler G.F., Introduction to stochastic processes, Chapman and Hall/CRC, New York, 2006 · Zbl 1105.60003 · doi:10.1201/9781315273600
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.