{"paper":{"title":"Conservative and semiconservative random walks: recurrence and transience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Vyacheslav M. Abramov","submitted_at":"2016-01-11T01:32:19Z","abstract_excerpt":"In the present paper we define conservative and semiconservative random walks in $\\mathbb{Z}^d$ and study different families of random walks. The family of symmetric random walks is one of the families of conservative random walks, and simple (P\\'olya) random walks are their representatives. The classification of random walks given in the present paper enables us to provide a new approach to random walks in $\\mathbb{Z}^d$ by reduction to birth-and-death processes. We construct nontrivial examples of recurrent random walks in $\\mathbb{Z}^d$ for any $d\\geq3$ and transient random walks in $\\mathb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02297","kind":"arxiv","version":10},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}