Stepwise Alternating Direction Implicit Method of the Three Dimensional Convective-Diffusion Equation
Article Sidebar
Main Article Content
Abstract
A stepwise alternating direction implicit method of the three dimensional convective-diffusion equation is considered in this paper. We constructed an implicit difference scheme and analyzes it's truncation error, convergence and stabilities. The theoretical and numerical analysis shows that the implicit difference scheme is unconditional stable. Then the Greedy Algorithm is proposed to solve the numerical solution on x,y and z axis separately by using implicit difference scheme and the numerical solution is convergent theoretically, however with no physical meaning.
The Stepwise Alternating Direction Implicit Method (SADIM) is proposed, which uses the implicit difference scheme in this paper. Using Sauls scheme to pretreat the initial-boundary condition before iterating, thus eliminate the numerical oscillation caused by discontinuous initial boundary conditions. This SADIM is at least six ordered convergent, and is one of high ordered numerical methods for three dimensional problem. Our implicit difference scheme is more ideal than the standard Galerkin centered on finite difference scheme, quicker than SOR iteration method. The convergence of our implicit scheme is better than finite element method, characteristic line method, and mesh-less method. Our method eliminates the numerical oscillation caused by the convection dominant, resists the dispersion effectively and addresses dissipation caused by diffusion dominant.The implicit difference scheme has good theoretical and practical value.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Licensing and protecting the author rights is the central aim and core of the publishing business. Peertechz dedicates itself in making it easier for people to share and build upon the work of others while maintaining consistency with the rules of copyright. Peertechz licensing terms are formulated to facilitate reuse of the manuscripts published in journals to take maximum advantage of Open Access publication and for the purpose of disseminating knowledge.
We support 'libre' open access, which defines Open Access in true terms as free of charge online access along with usage rights. The usage rights are granted through the use of specific Creative Commons license.
Peertechz accomplice with- [CC BY 4.0]
Explanation
'CC' stands for Creative Commons license. 'BY' symbolizes that users have provided attribution to the creator that the published manuscripts can be used or shared. This license allows for redistribution, commercial and non-commercial, as long as it is passed along unchanged and in whole, with credit to the author.
Please take in notification that Creative Commons user licenses are non-revocable. We recommend authors to check if their funding body requires a specific license.
With this license, the authors are allowed that after publishing with Peertechz, they can share their research by posting a free draft copy of their article to any repository or website.
'CC BY' license observance:
|
License Name |
Permission to read and download |
Permission to display in a repository |
Permission to translate |
Commercial uses of manuscript |
|
CC BY 4.0 |
Yes |
Yes |
Yes |
Yes |
The authors please note that Creative Commons license is focused on making creative works available for discovery and reuse. Creative Commons licenses provide an alternative to standard copyrights, allowing authors to specify ways that their works can be used without having to grant permission for each individual request. Others who want to reserve all of their rights under copyright law should not use CC licenses.
Abe Y. Effective resistances for supercritical percolation clusters in boxes. Ann Inst H Poincaré Probab Stat. 2015;51(3):935-946. Available from: http://www.numdam.org/item/AIHPB_2015__51_3_935_0/
A dékon E. Transient random walks in random environment on a Galton-Watson tree. Prob Theory Relat Fields. 2008;142(3-4):525-559. Available from: https://doi.org/10.1007/s00440-007-0114-x
A dékon E. Speed of the biased random walk on a Galton-Watson tree. Prob Theory Relat Fields. 2014;159:597-617. Available from: https://doi.org/10.48550/arXiv.1111.4313
Aizenman M, Barsky DJ. Sharpness of the phase transition in percolation models. Comm Math Phys. 1987;108:489-526. Available from: https://math.bme.hu/~balint/oktatas/perkolacio/percolation_papers/aizenman_barsky.pdf
Aizenman M, Kesten H, Newman CM. Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation. Comm Math Phys. 1987;111:505-531. Available from: https://link.springer.com/article/10.1007/BF01219071
Alexander S, Orbach R. Density of states on fractals: “fractons”. J Physique (Paris) Lett. 1982;43:625-631. Available from: http://dx.doi.org/10.1051/jphyslet:019820043017062500
Ambegoakar V, Halperin BI, Langer JS. Hopping conductivity in disordered systems. Phys Rev B. 1971;4:2612-2620. Available from: https://journals.aps.org/prb/abstract/10.1103/PhysRevB.4.2612
Andres S, Barlow MT, Deuschel JD, Hambly BM. Invariance principle for the random conductance model. Prob Theory Relat Fields. 2013;156:535-580. Available from: https://doi.org/10.1007/s00440-012-0435-2
Andriopoulos G. Invariance principle for random walks in random environment on trees. arXiv. 2018;1812.10197v1 Available from: https://doi.org/10.48550/arXiv.1812.10197
Arous GB, Hu YY, Olla S, Zeitouni O. Einstein relation for biased random walk on Galton-Watson trees. Ann Inst H Poincaré Probab Statist. 2013;49(3):698-721. Available from: http://www.numdam.org/item/AIHPB_2013__49_3_698_0/
Arous GB, Fribergh A. Biased random walks on random graphs. In: Probability and statistical physics in St. Petersburg. 2016;91:99-153. Available from: https://doi.org/10.48550/arXiv.1406.5076
Arous GB, Fribergh A, Gantert N, Hammond A. Biased random walks on Galton-Watson trees with leaves. Ann Probab. 2015;40(1):280-338. Available from: https://doi.org/10.48550/arXiv.0711.3686
Baldazzi V, Bradde S, Cocco S, Marinari E, Manasson R. Inference of DNA sequences from mechanical unzipping: an ideal-case study. Phys Rev Lett. 2006;96:038101. Available from: https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.96.128102
Baldazzi V, Bradde S, Cocco S, Marinari E, Manasson R. Inferring DNA sequences from mechanical unzipping data: the large-bandwidth case. Phys Rev E. 2007;75:061913.
Barlow MT. Random walks on supercritical percolation clusters. Ann Probab. 2004;32(4):3024-3084. Available from: http://dx.doi.org/10.1214/009117904000000748
Barlow MT, Deuschel JD. Invariance principle for the random conductance model with unbounded conductances. Ann Probab. 2010;38(1):234-276. Available from: https://doi.org/10.1214/09-AOP481
Bazaes R. Localization for random walks in random environment in dimension two and higher. arXiv. 2019;1911.06430v1 Available from: https://www.mat.uc.cl/archivos/dip/topics-in-large-deviations-and-localization-forrandom-walks-in-random-environment.pdf
Bena m M, Tarrès P. Dynamics of vertex-reinforced random walks. Ann Probab. 2011;39(6):2178-2223. Available from: https://doi.org/10.1214/10-AOP609
Benjamini I, Schramm O. Percolation beyond $mathbb{Z}^d$: many questions and a few answers. Electron Comm Probab. 1996;1(8):71-82. Available from: https://eudml.org/doc/119473
Benjamini I, Gurevich OG, Schramm O. Cutpoints and resistance of random walk paths. Ann Probab. 2011;39(3):1122-1136. Available from: https://doi.org/10.1214/10-AOP569
Benjamini I, Kozma G, Schapira B. A balanced excited random walk. C R Acad Sci Paris, Ser I. 2011;349(7-8):459-462. Available from: https://arxiv.org/abs/1009.0741
Benjamini I, Lyons R, Peres Y, Schramm O. Uniform spanning forests. Ann Probab. 2001;29(1):1-65. Available from: https://rdlyons.pages.iu.edu/pdf/usf.pdf
Berger N, Biskup M. Quenched invariance principle for simple random walk on percolation clusters. Prob Theory Relat Fields. 2007;137(1-2):83-120. Available from: https://doi.org/10.1007/s00440-006-0498-z
Berretti A, Sokal AD. New Monte Carlo method for the self-avoiding walk. J Stat Phys. 1985;40(3):483-531. Available from: https://link.springer.com/article/10.1007/BF01017183
Biskup M, Prescott TM. Functional CLT for random walk among bounded conductances. Electron J Probab. 2007;12(49):1323-1348. Available from: https://doi.org/10.48550/arXiv.math/0701248
Biskup M. Recent progress on the random conductance model. Probab Surv. 2011;8:294-373. Available from: https://doi.org/10.1214/11-PS190
Biskup M, Rodriguez PF. Limit theory for random walks in degenerate time-dependent random environments. Journal of Functional Analysis. 274:985-1046. Available from: https://doi.org/10.1016/j.jfa.2017.12.002
Borodin A. Determinantal point processes. arXiv. 2009;0911.1153v1. Available from: https://doi.org/10.48550/arXiv.0911.1153
Bowditch A. A quenched central limit theorem for biased random walks on supercritical Galton-Watson trees. J Appl Probab. 2018;55(2):610-626. Available from: http://dx.doi.org/10.1017/jpr.2018.38
Broadbent SR, Hammersley JM. Percolation processes. I. Crystals and mazes. Proc Cambridge Philos Soc. 1957;53:629-641. Available from: https://www.scirp.org/reference/referencespapers?referenceid=1846943
Burgess D. Reinforced random walk. Prob Theory Relat Fields. 1990;84(2):203-229. Available from: https://link.springer.com/article/10.1007/BF01197845
Burton RM, Keane MR. Density and uniqueness in percolation. Comm Math Phys. 1989;121:501-505. Available from: https://link.springer.com/article/10.1007/BF01217735
Chernov AA. Replication of a multicomponent chain by the "lightning" mechanism. Biophysics. 1967;12(2):336-341.
Collevecchio A, Kious D, Sidoravicius V. The branching-ruin number and the critical parameter of once-reinforced random walk on trees. arXiv. 2017;1710.00567v3. Available from: https://doi.org/10.48550/arXiv.1710.00567
Comets F, Menshikov M, Popov S. Lyapunov functions for random walks and strings in random environment. Ann Probab. 1998;26(4):1433-1445. Available from: https://projecteuclid.org/journals/annals-of-probability/volume-26/issue-4/Lyapunov-functions-for-random-walks-and-strings-in-randomenvironment/10.1214/aop/1022855869.full
Croydon DA. An introduction to the trapping experienced by biased random walk on the trace of biased random walk. arXiv. 2020;2003.06950. Available from: https://doi.org/10.48550/arXiv.2003.06950
Damron M, Hason J, Sosoe P. On the chemical distance in critical percolation. Electron J Probab. 2017;22(75):1-43. Available from: https://projecteuclid.org/journals/electronic-journal-of-probability/volume-22/issue-none/On-the-chemical-distance-in-critical-percolation/10.1214/17-EJP88.full
Deijfen M, Hiescher T, Lopes F. Competing frogs on $mathbb{Z}^d. arXiv. 2019;1902.01849. Available from: https://arxiv.org/pdf/1902.01849
Dembo A, Zeitouni O. Large deviations techniques and applications. 2nd ed. Springer; 1998.
Duminil-Copin H. Sixty years of percolation. arXiv. 2017;1712.04651 Available from: https://doi.org/10.48550/arXiv.1712.04651
Duminil-Copin H. Introduction to Bernoulli percolation. arXiv. 2018. Available from: https://www.ihes.fr/~duminil/publi/2017percolation.pdf
Duminil-Copin H, Goswami S, Raoufi A, Severo F, Yadin A. Existence of phase transition for percolation using the Gaussian Free Field. arXiv. 2018;1806.07733.
Durrett R. Probability theory and examples. 4th ed. Cambridge University Press; 2010.
Enriquez N, Sabot C. Edge oriented reinforced random walks and RWRE. C R Acad Sci Paris, Ser I. 2002;335:941-946. Available from: https://comptes-rendus.academie-sciences.fr/mathematique/item/10.1016/S1631-073X(02)02580-3.pdf
Ethier EN, Kurtz TG. Markov processes: characterization and convergence. John Wiley; 2005.
Faggionato A, Mimun HA. Left-right crossings in the Miller-Abrahams random resistor network on a Poisson point process. arXiv. 2019;1912.07482v1. Available from: https://doi.org/10.48550/arXiv.1912.07482
Faraud G. A central limit theorem for random walk in random environment on marked Galton-Watson trees. Electron J Probab. 2011;16:174-215. Available from: https://doi.org/10.48550/arXiv.0812.1948
Franceschetti M, Dousse O, Tse DNC, Thiran P. Closing the gap in the capacity of wireless networks via percolation theory. IEEE Trans Inform Theory. 2007;53(3):1009-1018. Available from: http://dx.doi.org/10.1109/TIT.2006.890791
Freudenthal H. Über die Enden diskreter Räume und Gruppen. Comment Math Helv. 1945;17:1-38. Available from: https://eudml.org/doc/138845
Furstenberg H, Kesten H. Products of random matrices. Ann Math Statist. 1960;31:457-469.
Gandolfi A, Keane MS, Newman CM. Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses. Prob Theory Relat Fields. 1992;92(4):511-527. Available from: https://link.springer.com/article/10.1007/BF01274266
Grimmett GR, Marstrand JM. The supercritical phase of percolation is well behaved. Proc R Soc Lond A. 1990;430:439-457. Available from: https://doi.org/10.1098/rspa.1990.0100
Grimmett GR, Kesten H, Zhang Y. Random walk on the infinite cluster of the percolation model. Prob Theory Relat Fields. 1993;96:33-44. Available from: https://scite.ai/reports/random-walk-on-the-infinite-lg1jKM
Grimmett GR. Percolation. 2nd ed. Springer; 1999.
Grimmett GR. Criticality, universality and isoradiality. arXiv. 2014;1404.2831. Available from: https://doi.org/10.48550/arXiv.1404.2831
Gromov M. Groups of polynomial growth and expanding maps. Inst. Hautes Études Sci. Publ. Math. 1981;53:53-73. Available from: http://www.numdam.org/article/PMIHES_1981__53__53_0.pdf
Häggström O, Pemantle R. First passage percolation and a model for competing spatial growth. J. Appl. Probab. 1998;35:683-692. Available from: https://doi.org/10.48550/arXiv.math/9701226
Häggström O, Peres Y, Schonmann R. Percolation on transitive graphs as a coalescent process: relentless merging followed by simultaneous uniqueness. Progr. Probab. 1999;44:69-90. Available from: http://dx.doi.org/10.1007/978-1-4612-2168-5_4
Häggström O, Pemantle R. Absence of mutual unbounded growth for almost all parameter values in the two-type Richardson model. Stoc. Proc. Appl. 2000;20:207-222. Available from: https://core.ac.uk/download/pdf/82664453.pdf
Hara T, Slade G. Mean-field critical behaviour for percolation in high dimensions. Comm. Math. Phys. 1990;128:333-391. Available from: http://dx.doi.org/10.1007/BF02108785
Harris TE. A lower bound for the critical probability in a certain percolation process. Proc. Cambridge Philos. Soc. 1960;56:13-20. Available from: https://ui.adsabs.harvard.edu/link_gateway/1960PCPS...56...13H/doi:10.1017/S0305004100034241
Heathcote CR, Seneta E, Vere-Jones D. A refinement of two theorems in the theory of branching processes. Theory Probab. Appl. 1967;12:297-301. Available from: https://doi.org/10.1137/1112033
Heydenreich M, van der Hofstad R. Progress in high-dimensional percolation and random graphs. Lecture notes for the CRM-PIMS Summer School in Probability. Preprint. MR:2654679;2016.
van der Hofstad R, Járai AA. The incipient infinite cluster for high-dimensional unoriented percolation. J. Stat. Phys. 2004;114:625-663. Available from: https://link.springer.com/article/10.1023/B:JOSS.0000012505.39213.6a
Holmes M, Salisbury TS. Random walks in degenerate random environments. Canad. J. Math. 2014;66(5):1050-1077. Available from: https://doi.org/10.48550/arXiv.1105.5105
Holmes M, Salisbury TS. Conditions for ballisticity and invariance principle for random walk in non-elliptic random environment. Electron. J. Probab. 2017;22(81):1-18. Available from: https://projecteuclid.org/journals/electronic-journal-of-probability/volume-22/issue-none/Conditions-for-ballisticity-and-invariance-principle-for-random-walk-in/10.1214/17-EJP107.full
Holmes M, Salisbury TS. Phase transitions for degenerate random environments. arXiv. 1911.03037v1 [math.PR]; 2019.
Hu Y, Shi Z. The limits of Sinai's simple random walk in random environment. Ann. Probab. 1998;24(4):1477-1521. Available from: https://projecteuclid.org/journals/annals-of-probability/volume-26/issue-4/The-limits-of-Sinais-simple-random-walk-in-random-environment/10.1214/aop/1022855871.full
Hu YY, Shi Z. The most visited sites of biased random walks on trees. Electron. J. Probab. 2015;20(62):1-14. Available from: https://projecteuclid.org/journals/electronic-journal-of-probability/volume-20/issue-none/The-most-visited-sites-of-biased-random-walks-on-trees/10.1214/EJP.v20-4051.full
Huguet JM, Forns N, Ritort F. Statistical properties of metastable intermediates in DNA unzipping. Phys. Rev. Lett. 2009;103(24):248106. Available from: https://doi.org/10.1103/PhysRevLett.103.248106
Huss W, Levine L, Huss ES. Interpolating between random walk and rotor walk. Random Struct. Algorithms. 2018;52:263-282. Available from: https://doi.org/10.48550/arXiv.1603.04107
Hutchcroft T. Non-uniqueness and mean-field criticality for percolation on nonunimodular transitive graphs. arXiv. 1711.02590v2 [math.PR]; 2017. Available from: https://doi.org/10.48550/arXiv.1711.02590
James N, Peres Y. Cutpoints and exchangeable events for random walks. Theory Probab. Appl. 1996;41:666-667.
Jikov VS, Kozlov SV, Oleinik OE. Homogenization of differential operators and integral functionals. Springer;1994. Available from: https://link.springer.com/book/10.1007/978-3-642-84659-5
Jones GL. On the Markov chain central limit theorem. Probab. Surv. 2004;1:299-320. Available from: https://projecteuclid.org/journals/probability-surveys/volume-1/issue-none/On-the-Markov-chain-central-limit-theorem/10.1214/154957804100000051.full
Kaimanovich VA, Vershik AM. Special invited paper: random walks on discrete groups: boundary and entropy. Ann. Probab. 1983;11(3):457-490. Available from: https://projecteuclid.org/journals/annals-of-probability/volume-11/issue-3/Random-Walks-on-Discrete-Groups-Boundary-and-Entropy/10.1214/aop/1176993497.full
Kesten H. The critical probability of bond percolation on the square lattice equals 1/2. Comm. Math. Phys. 1980;74:41-59. Available from: https://link-springer-com-443.webvpn.synu.edu.cn/article/10.1007/BF01197577
Kesten H. Percolation theory for mathematicians. Springer;1982.
Kesten H. Subdiffusive behavior of random walks on a random cluster. Ann. Inst. H. Poincaré Probab. Statist. 1986;22:425-487. Available from: http://www.numdam.org/item/AIHPB_1986__22_4_425_0.pdf
Key ES. Recurrence and transience criteria for random walk in a random environment. Ann. Probab. 1984;12(2):529-560. Available from: https://www.jstor.org/stable/2243486
Koch S, Shundrovsky A, Jantzen BC, Wang MD. Probing Protein-DNA interactions by unzipping a single DNA double helix. Biophysical J. 2002;83(2):1098-1105. Available from: https://doi.org/10.1016/s0006-3495(02)75233-8
Kozlov MV. Random walk in one dimensional random medium. Theory Probab. Appl. 1973;18:387-388.
Kozlov MV. The method of averaging and walks in inhomogeneous environments. Russ. Math. Surv. 1985;40:73-145. Available from: https://iopscience.iop.org/article/10.1070/RM1985v040n02ABEH003558/meta
Künnemann R. The diffusion limit for reversible jump processes on Z d Z d with ergodic random bond conductivities. Comm. Math. Phys. 1983;90(1):27-68. Available from: https://ui.adsabs.harvard.edu/abs/1983CMaPh..90...27K/abstract
Lalley SP. The weak/strong survival transition on trees and nonamenable graphs. Proceedings of the International Congress of Mathematicians. III;2006:637-647. Available from: https://www.stat.uchicago.edu/~lalley/Papers/icm.pdf
Lamperti J. Criterion for recurrence or transience of stochastic process. J. Math. Anal. Appl. 1960;1:314-330. Available from https://core.ac.uk/download/pdf/82006275.pdf
Lawler GF. Weak convergence of a random walk in a random environment. Commun. Math. Phys. 1982;87:81-87. Available from: https://link.springer.com/article/10.1007/BF01211057
Lawler GF, Sokal AD. Bounds on the spectral gap for Markov chains and Markov processes: a generalization of Cheeger's inequality. Trans. Amer. Math. Soc. 1988;309(2):557-580. Available from: https://www.ams.org/journals/tran/1988-309-02/S0002-9947-1988-0930082-9/
Liu Y, Sidoravicius V, Wang L, Xiang K. The invariance principle and the large deviation for the biased random walk on Zd. Journal of Applied Probability. 2020;57:295-313. Available from: https://www.jstor.org/stable/48656207
Lyons T. A simple criterion for transience of a reversible Markov chain. Ann. Probab. 1983;11(2):393-402. Available from: https://typeset.io/pdf/a-simple-criterion-for-transience-of-a-reversible-markov-24hxdwyo64.pdf
Lyons R. Random walks and percolation on trees. Ann. Probab. 1990;18(3):931-958. Available from: https://rdlyons.pages.iu.edu/pdf/rwpt.pdf
Lyons R. Random walk, capacity and percolation on trees. Ann. Probab. 1992;20:2043-2088. Available from: https://www.jstor.org/stable/2244740
Lyons R, Pemantle R. Random walk in random environment and first-passage percolation on trees. Ann. Probab. 1992;20(1):125-136. Available from: https://www.jstor.org/stable/2244549
Lyons R. Random walks and the growth of groups. C. R. Acad. Sci. Paris, Ser. I. 1995;320(11):1361-1366. Available from: https://www.semanticscholar.org/paper/Random-walks-and-the-growth-of-groups-Lyons/39f22261f7dd340cf7d97af31f1016a832ac0e68
Lyons R, Pemantle R, Peres Y. Biased random walks on Galton-Watson trees. Prob. Theory Relat. Fields. 1996;106(2):249-264. Available from: https://rdlyons.pages.iu.edu/pdf/biased7.pdf
Lyons R, Pemantle R, Peres Y. Random walks on the lamplighter group. Ann. Probab. 1996;24(4):1993-2006. Available from: https://rdlyons.pages.iu.edu/pdf/G1.pdf
Lyons R, Schramm O. Indistinguishability of percolation clusters. Ann. Probab. 1999;27(4):1809-1836. Available from: https://doi.org/10.48550/arXiv.math/9811170
Lyons R, Peres Y. Probability on trees and networks. Cambridge University Press; 2017. Available from: https://dl.acm.org/doi/10.5555/3086816
De Masi A, Ferrari PA, Goldstein S, Wick WD. An invariance principle for reversible Markov processes - Applications to random motions in random environments. J. Stat. Phys. 1989;55:787-855. Available from: https://people.disim.univaq.it/~demasi/DFGW.pdf
Mathieu P, Piatnitski A. Quenched invariance principles for random walks on percolation clusters. Proc. R. Soc. A. 2007;463:2287-2307. Available from: https://doi.org/10.48550/arXiv.math/0505672
Mathieu P. Quenched invariance principles for random walks with random conductances. J. Stat. Phys. 2008;130(5):1025-1046. Available from: https://doi.org/10.1007/s10955-007-9465-z
Menshikov MV. Coincidence of critical points in percolation problems. Dokl. Akad. Nauk SSSR. 1986;288(6):1308-1311. Available from: https://math.bme.hu/~balint/oktatas/perkolacio/percolation_papers/menshikov.pdf
Menshikov M, Popov S, Wade A. Non-homogeneous random walks. Lyapunov function methods for near-critical stochastic systems. Cambridge University Press; 2015.
Merlevède F, Peligrad M, Utev S. Recent advances in invariance principles for stationary sequences. Probab. Surv. 2006;3:1-36. Available from: https://doi.org/10.1214/154957806100000202
Miller A, Abrahams E. Impurity conduction at low concentrations. Phys. Rev. 1960;120:745-755. Available from: https://journals.aps.org/pr/abstract/10.1103/PhysRev.120.745
Muchnik R, Pak I. Percolation on Grigorchuk groups. Commun. Algebra. 2001;29:661-671.
Müller S. A criterion for transience of multidimensional branching random walk in random environment. Electron. J. Probab. 2008;13(41):1189-1202. Available from: https://doi.org/10.48550/arXiv.0705.1874
Newman CM, Schulman LS. Infinite clusters in percolation models. J. Stat. Phys. 1981;26(3):613-628. Available from: https://link.springer.com/article/10.1007/BF01011437
Pemantle R, Peres Y. Critical random walk in random environment on trees. Ann. Probab. 1995;23(1):105-140. Available from: https://www.jstor.org/stable/2244782
Pollak M, Ortuño M, Frydman A. The electron glass, 1st edition. Cambridge University Press; 2013. Available from: https://www.cambridge.org/core/books/electron-glass/A4C865A305F76094AAFF9FD08D64267F
Randall D. Counting in lattices: combinatorial problems for statistical mechanics. PhD thesis, University of California;1994. Available from: https://www.proquest.com/openview/255b01530cc72ab63db8e7dc8c91083d/1?pq-origsite=gscholar&cbl=18750&diss=y
Richardson D. Random growth in a tessellation. Proc. Cambridge Philos. Soc. 1973;74:515-528. Available from: https://ui.adsabs.harvard.edu/link_gateway/1973PCPS...74..515R/doi:10.1017/S0305004100077288
Robert F, van der Hofstad R. Mean-field behavior for nearest-neighbor percolation in d > 10. Electron. J. Probab. 2017;22:1-65. Available from: https://projecteuclid.org/journals/electronic-journal-of-probability/volume-22/issue-none/Mean-field-behavior-for-nearest-neighbor-percolation-in-d10/10.1214/17-EJP56.full
Sabot C. Ballistic random walks in random environment at low disorder. Ann. Probab. 2004;32(4):2996-3023. Available from: https://projecteuclid.org/journals/annals-of-probability/volume-32/issue-4/Ballistic-random-walks-in-random-environment-at-low-disorder/10.1214/009117904000000739.full
Sabot C, Tournier L. Random walk in Dirichlet environment: an overview. Ann. Fac. Sci. Toulouse Math. (6). 2017;26(2):463-509. Available from: https://afst.centre-mersenne.org/item/AFST_2017_6_26_2_463_0/
Sandrić N. Recurrence and transience property for a class of Markov chains. Bernoulli. 2013;19(5B):2167-2199. Available from: https://projecteuclid.org/journals/bernoulli/volume-19/issue-5B/Recurrence-and-transience-property-for-a-class-of-Markov-chains/10.3150/12-BEJ448.full
Sandrić N. Recurrence and transience criteria for two cases of stable-like Markov chains. J. Theoret. Probab. 2014;27(3):754-788. Available from: https://link.springer.com/article/10.1007/s10959-012-0445-0
Shi Z, Sidoravicius V, Song H, Wang L, Xiang K. On spectral radius of biased random walks on infinite graphs. arXiv. 1805.01611 [math.PR]; 2018. Available from: https://arxiv.org/pdf/1805.01611
Shi Z, Sidoravicius V, Song H, Wang L, Xiang K. Uniform spanning forests associated with biased random walks on Euclidean lattices. arXiv. 1805.01615 [math.PR]; 2018. Available from: https://arxiv.org/abs/1805.01615
Sidoravicius V, Sznitman AS. Quenched invariance principles for walks on clusters of percolation or among random conductances. Prob. Theory Relat. Fields. 2004;129(2):219-244. Available from: https://link.springer.com/article/10.1007/s00440-004-0336-0
Sinai Ya G. The limit behavior of a one-dimensional random walk in a random environment. Teor. Veroyatn. Primen. 1982;27(2):247-258. Available from: https://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=tvp&paperid=2342&option_lang=eng
Sinclair AJ, Jerrum MR. Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 1989;82:93-133. Available from: https://doi.org/10.1016/0890-5401(89)90067-9
Soardi PM. Potential theory on infinite networks. Springer; 1994.
Solomon F. Random walks in a random environment. Ann. Probab. 1975;3(1):1-31. Available from: https://projecteuclid.org/journals/annals-of-probability/volume-3/issue-1/Random-Walks-in-a-Random-Environment/10.1214/aop/1176996444.full
Song H, Xiang K. Cutpoints for random walk on quasi-transitive graphs. Acta Math. Sin., Chinese Series. 2017;6:947-954. https://doi.org/10.48550/arXiv.1712.02543
Sznitman AS. Topics in random walks in random environment. School and Conference on Probability Theory;2004:203-266. https://www.osti.gov/etdeweb/servlets/purl/20945057
Sznitman AS, Zerner M. A law of large numbers for random walks in random environment. Ann. Probab. 1999;27(4):1851-1869. https://projecteuclid.org/journals/annals-of-probability/volume-27/issue-4/A-Law-of-Large-Numbers-for-Random-Walks-in-Random/10.1214/aop/1022874818.full
Tang P. Heavy Bernoulli-percolation clusters are indistinguishable. The Annals of Probability. 2018;47:4077-4115. https://www.jstor.org/stable/26867243
Tarrès P. Vertex-reinforced random walk on Z d Z d eventually gets stuck on five points. Ann. Probab. 2004;32(3B):2650-2701. https://projecteuclid.org/journals/annals-of-probability/volume-32/issue-3B/Vertex-reinforced-random-walk-on-%e2%84%a4-eventually-gets-stuck-on/10.1214/009117907000000694.full
Wall CTC. Poincaré complexes: I. Ann. Math. 1967;86(2):213-245. https://www.jstor.org/stable/1970688
Woess W. Random walks on infinite graphs and groups. Cambridge University Press;2000.
Zeitounni O. Random walks in random environment. Lectures on probability theory and statistics. Springer; 2006;1837:189-312.