Extending P\'olya's random walker beyond probability I. Complex weights

Martin Klazar; Richard Horsk\'y

REVIEW 2 major objections 4 minor 31 references

Extending P\'olya's random walker beyond probability I. Complex weights

T0 review · 2 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Pólya's recurrence theorem is not a probabilistic fact: the same limits hold when edges carry arbitrary complex weights, with the answer read off from the generating function of closed walks.

desk verdict Genuinely useful combinatorial framework and effective d=2 bounds, but the complex v-recurrence theorems carry an unproved Bh(1)≠0 step that the current hypotheses don't support. read the letter →

arxiv 2505.12170 v2 pith:WD5TWIZF submitted 2025-05-17 math.PR math.COmath.HO

Martin Klazar , Richard Horský This is my paper · ORCID

classification math.PRmath.COmath.HO MSC 60G5060J1005A1530B10

keywords Pólya'srandomwalkrecurrencetoavertexcomplexweightslightweightconvexgeneratingfunctionssemi-formalsymbolicmethodonZ^d

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks which part of Pólya's classic walker result is genuinely probabilistic. In a combinatorial model that counts length-$n$ walks on $\mathbb{Z}^d$, it first turns the recurrence theorems into exact formulas: for $d\ge 3$ the limiting proportion of walks returning to the origin is $1-1/B(1)$, where $B(x)$ is the generating function of closed walks, and visits to a vertex $v$ give $\sqrt{1-B_0(1)/B(1)}$. The main step then passes to a model $\mathrm{W}_{\mathbb{C}}$ in which every edge of a countable graph carries an arbitrary complex weight, subject only to lightness: at each length $n$, the total weight of all length-$n$ walks converges absolutely. For convex light weights (each vertex's outgoing weights sum to $1$), the recurrence limit is still $1-1/B_h(1)$, and for nonnegative weights with $B_h(1)=\infty$ it is $1$. The upshot is that recurrence is a property of the walk-counting structure itself, not of the axioms of probability.

What carries the argument

The machinery is the model $\mathrm{W}_{\mathbb{C}}$ of light weights $h\colon \mathbb{N}^2\to\mathbb{C}$ (for each $n$, the total weight of all length-$n$ walks converges absolutely), together with a semi-formal approach to generating functions that extends the symbolic method from finite to countable sets. The argument runs on two combinatorial identities, $A_h(x)=C_h(x)D_h(x)$ and $B_h(x)=1/(1-C_h(x))$, where $B_h$ counts closed walks and $C_h$ counts closed walks whose interior avoids the start. For convex weights, $D_h(x)=1/(1-x)$, and Abel's theorem turns the formal identities into boundary-value formulas such as $\lim_n a^h_n=1-1/B_h(1)$.

What would settle it

Take the one-dimensional birth-death chain on positive integers with complex step weights $p=0.75+0.1i$ to the right and $q=0.25-0.1i$ to the left, so $p+q=1$; set the start vertex's only outgoing weight to $1$. This weight is convex and light. Compute the weights $a^h_n$ of length-$n$ walks that revisit the start by dynamic programming for $n$ up to $10^5$. Theorem 5.18 predicts $a^h_n\to 1-1/B_h(1)=q/p\approx 0.310-0.175i$; if the computed sequence converges to any other value or fails to converge, the central claim is refuted.

Watch

Extended reading notes

Core claim

The central discovery is that the recurrence of Pólya's walker is a formal-power-series identity that survives arbitrary complex edge weights. In the complex-weighted model, the weight $a^h_n$ of length-$n$ walks that revisit their starting point satisfies the same combinatorial decompositions as the classical counts: $A_h(x)=C_h(x)D_h(x)$ and $B_h(x)=1/(1-C_h(x))$, with $B_h$ the generating function of closed walks. A semi-formal extension of the symbolic method to countable sets, justified by absolute convergence and Abel's theorem, converts these identities into evaluated limits. Convexity—each vertex's outgoing weights sum to $1$—makes $D_h(x)=1/(1-x)$ and yields $\lim_n a^h_n=1-1/B_h(1)$ whenever $B_h(1)$ exists; for nonnegative $h$ with $B_h(1)=\infty$ the limit is $1$. For visits to a vertex $v\neq 1$, the same machinery locates the limit among the two square roots of $1-B_{0,h}(1)/B_h(1)$, with $B_{0,h}$ the closed-walk generating function avoiding $v$.

Load-bearing premise

The formulas require the total complex weight of all closed walks to be a well-defined finite or infinite sum; with arbitrary complex weights this sum can diverge or depend on how the walks are ordered, and the paper's conclusions then fall back to weaker statements.

Editorial extensions

If this is right

For the classical lattice walker, the strengthened formulas give explicit limits in $d\ge 3$: the return proportion tends to $1-1/B(1)$, and the visit proportion for a vertex $v$ tends to $\sqrt{1-B_0(1)/B(1)}$.
In two dimensions the return theorem becomes effective: for all sufficiently large $N$, the deficit from the limit $1$ is sandwiched between $(0.9\log N)^{-1}$ and $(0.1\log N)^{-1}$.
The combinatorial and Markov-chain models record the same probabilities: $\Pr(\bigcup_{n\ge1} X_n=v)=\lim_n(2d)^{-n}|W_d(v,n)|$.
Any convex complex weight with finite $B_h(1)$ yields a well-defined recurrence limit $1-1/B_h(1)$; nonnegative convex weights with infinite $B_h(1)$ are recurrent with limit $1$.
The $v$-recurrence limit for general complex weights is only determined up to sign, as one of two square roots, a genuinely new ambiguity that cannot appear in the probabilistic setting.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Because the limits are boundary values of generating functions, one can tune complex weights to interpolate between recurrent and transient behavior: a finite $B_h(1)$ acts as a transience parameter, and signed weights allow cancellations with no probabilistic counterpart.
The two-valued square root in the $v$-recurrence theorem suggests an underlying phase or topological index in the complex weights; selecting the correct root will likely require extra hypotheses such as nonnegativity or a fixed argument, beyond the paper's present assumptions.
The semi-formal approach to generating functions may transfer to other countable combinatorial classes (trees, lattice configurations, self-avoiding walks) wherever absolute convergence lets finite product rules be replaced by countable ones.
A direct numerical check on a biased birth-death chain with complex step weights would test the formula: with step weights $p$ (right) and $q=1-p$ (left), the predicted limit is $q/p$ whenever $|q/p|<1$, which can be compared with dynamic-programming computation of $a^h_n$.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: worth refereeing. The reader's conditional verdict is about right, and the stress-test note lands. This is not a takedown: the combinatorial reformulation of Pólya is clean, and the effective two-dimensional bounds in Section 4 are a genuine plus. The complex-weight model in Section 5 is a plausible extension, and the 0-recurrence theorems (5.17, 5.18) are proven under explicit existence assumptions. The generating-function decompositions in Propositions 5.8 and 5.20 are correct in spirit; the SFA label is softer than a formal method, but the specific bijections are visible.

The soft spot is Theorem 5.21(2) and Theorem 5.22(2). Both divide by Bh(1) and claim Bh(1)≠0 by citing the proof of part 1 of Theorem 5.17. That proof uses Corollary 5.15, which needs both U(1) and V(1) to exist for the identity V=1−1/U. Here U=Bh and V=Ch. Neither 5.21 nor 5.22 assumes Ch(1) exists, so the citation does not do the work. It is possible that convexity plus v-transitivity rules out Bh(1)=0 by a different argument, but the paper doesn't give one. Since the formal relation Bh=B0,h+C0,h^2Bh would only force B0,h(1)=0 when Bh(1)=0, that outcome is not contradicted by anything in the hypotheses. This is a real gap, not a cosmetic one. The 0-recurrence theorems are unaffected because 5.18(1) explicitly assumes Ch(1) exists.

Minor things: Proposition 5.20 is sketched at the high level of SFA rather than proven; I think it can be formalized with the same weight-preserving bijections, but as written it is less than a full proof. The promised follow-up papers are fine to cite but shouldn't be load-bearing. The citation pattern is otherwise unremarkable, and there are no fitted constants or circular steps.

For whom: people interested in combinatorial proofs of Pólya recurrence and in how far the generating-function machinery goes when probabilities are replaced by complex weights will get value from this. I would send it to a serious referee. A good referee will ask for a repair of 5.21/5.22 — either add Ch(1) as a hypothesis or prove Bh(1)≠0 directly. If that cannot be done, the v-recurrence extension should be downgraded to a conjecture or restricted. The rest of the paper can likely be published after modest revision.

Referee Report

2 major / 4 minor

Summary. The paper develops a combinatorial model of Pólya's random walker on Z^d, counting walks rather than assigning probabilities, and then extends the classical recurrence theorems to a model W_C in which edges carry complex weights. After proving the classical 0- and v-recurrence theorems in generating-function form (Theorems 3.9 and 3.11) and giving an effective version for d=2 in Section 4, the paper introduces in Section 5 the notions of light, convex, and v-transitive weights on the complete graph on N. The main results are Theorem 5.18, which states that for a convex light complex weight with Bh(1) and Ch(1) existing one has lim_n h(W_rec(n)) = 1 - 1/Bh(1), and Theorems 5.21 and 5.22, which give set-valued or square-root formulas for v-recurrence under analogous existence assumptions. The proofs rely on a semi-formal approach to generating functions using absolute convergence, grouping of series, and Abel's theorem.

Significance. If the results hold, the paper offers an original combinatorial framing of Pólya recurrence and a genuinely non-probabilistic generalization to complex weights. The 0-recurrence extension appears sound, and the effective bounds of Section 4 are a concrete contribution. The paper is also careful to state the conditional nature of the complex-weight results. However, the v-recurrence theorems 5.21 and 5.22 are not established as stated: their proofs use an argument for Bh(1) ≠ 0 that requires an existence assumption — Ch(1) — not present in the theorem statements. This gap is load-bearing because the square-root formula and the limits in those theorems require division by Bh(1). The overall framework and the 0-recurrence results are nevertheless defensible, so the issue is repairable within the manuscript's scope.

major comments (2)

[Theorems 5.21(2) and 5.22(2), with proofs] The proofs of Theorems 5.21(2) and 5.22(2) both assert that Bh(1) ≠ 0 and divide by Bh(1). In each case the proof refers to the proof of Theorem 5.17: Theorem 5.22 says 'part 2 of Theorem 5.17', which is presumably a typo for 'part 1'. The proof of Theorem 5.17(1) obtains Bh(1) ≠ 0 from Corollary 5.15, and Corollary 5.15 requires both U(1) = Bh(1) and V(1) = Ch(1) to exist. Theorem 5.21(2) assumes only Dh(1), C0,h(1), B0,h(1), Bh(1) and A0,h(1) exist, and Theorem 5.22(2) assumes only Bh(1), B0,h(1) and C0,h(1) exist; neither assumes Ch(1). The cited argument is therefore not applicable. Moreover, if Bh(1) = 0, the identity in Proposition 5.20(2) gives only B0,h(1) = 0, which is not contradictory for complex weights. The conclusion Bh(1) ≠ 0, and hence the square-root formula and the resulting limit statements, are unproven. The authors should either add Ch(1) to the hypotheses (the sufficient condition D|h|(1) < +∞ already guarantees it) or supply a direct proof of Bh(1) ≠ 0 from the stated hypotheses.
[Proposition 5.20] Proposition 5.20 is proved at a deliberately low level of detail, with the proof saying that it argues 'on the high level of SFA'. This proposition supplies the three generating-function identities on which Theorems 5.21 and 5.22 depend after taking boundary values. Given that the rest of Section 5 proves the analogous identities in Proposition 5.8 with full details, please expand the proof of Proposition 5.20 to the same level, or at least state explicitly which applications of Propositions 5.2, 5.4 and 5.5 are used in each decomposition. As written, the reader cannot fully verify the formal identities for general complex weights.

minor comments (4)

[Proof of Theorem 5.22(2)] The proof refers to 'part 2 of Theorem 5.17' when deriving Bh(1) ≠ 0; it should refer to 'part 1 of Theorem 5.17'.
[Abstract and introduction preview] The abstract and the preview on page 6 state that Theorems 5.21 and 5.22 extend Theorem 3.11 to W_C. In light of the missing Ch(1) hypothesis, it would be prudent to phrase this claim conditionally on the additional hypothesis or on an independent proof of Bh(1) ≠ 0.
[Section 4] Corollary 4.6 asserts an effective constant N0 without giving its value. Since Propositions 4.3 and 4.5 give explicit numerical bounds, it would be useful to state, at least in principle, how N0 is computed, or to include the resulting explicit constant.
[Definitions 5.11 and 5.6] The notation U(R) is used for both the nonnegative series evaluation in Definition 3.2 and the complex evaluation in Definition 5.11; the two definitions allow different values (+∞ only in the former). A sentence noting the intended meaning at each use would reduce ambiguity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: limits are genuine relations between independent walk-weight generating functions.

full rationale

The derivation chain is self-contained: A_h, B_h, C_h, and D_h are independent walk-weight totals, and the limits in Theorems 5.18 and 5.22 are obtained as algebraic relations between these generating functions (Propositions 5.8 and 5.10, Corollaries 5.14–5.16), not by fitting any constant or by importing an author-specific uniqueness theorem. The only self-references are to planned companion papers [13]–[15], none of which supplies a load-bearing premise; the semi-formal method is used heuristically and the bijections and convergence facts are proved in place. Pólya's theorem is cited only as the classical counterpart, and the d-dimensional results are re-derived in Section 3. I find no circular step. Separately, the proof of Theorems 5.21(2) and 5.22(2) has a real support gap: the claim B_h(1) ≠ 0 is referred to the proof of Theorem 5.17(1), whose Corollary 5.15 application needs C_h(1) to exist, a hypothesis not assumed in those theorems; this is an omitted-hypothesis and omitted-proof issue, not a circular reduction, so it does not raise the circularity score.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no fitted parameters. The main domain assumptions are lightness, convexity, and v-transitivity, plus conditional existence of boundary sums. The only methodological novelty, SFA, is not fully formalized and is deferred to a companion paper.

assumptions (5)

domain assumption Lightness of weight h: for every n, the total weight of length-n walks converges absolutely.
Definition 1.4; needed for the sums h(W(n)) to be well-defined for complex weights.
domain assumption Convexity of h: for every vertex u, sum_{v≠u} h({u,v}) = 1.
Proposition 5.10; used to derive Dh(x)=1/(1-x), an essential step in Theorem 5.18.
domain assumption v-transitivity of h: a bijection f of N with f(1)=v preserves edge weights.
Proposition 5.20; used to relate walks starting at 1 and v in the v-recurrence theorems.
domain assumption Existence of boundary sums such as Bh(1), Ch(1), and B0,h(1) as assumed in the theorems.
Theorems 5.17, 5.18, 5.21, and 5.22 are conditional on these sums existing; for complex weights they may fail.
standard math Standard analytic facts: Abel's theorem, Stirling's formula, and properties of absolutely convergent series.
Used throughout Sections 4 and 5.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Extending P\'olya's random walker beyond probability I. Complex weights." pith.science (2026). https://pith.science/paper/WD5TWIZF

@misc{pith2026250512170,
  author       = {Pith},
  title        = {Pith review of: Extending P\'olya's random walker beyond probability I. Complex weights},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WD5TWIZF}},
  note         = {Machine review of arXiv:2505.12170}
}

abstract

Working in combinatorial model $\mathrm{W_{co}}(d)$, $d=1,2,\dots$, of P\'olya's random walker in $\mathbb{Z}^d$, we prove two theorems on recurrence to a vertex. We obtain an effective version of the first theorem if $d=2$. Using a semi-formal approach to generating functions, we extend both theorems beyond probability to a more general model $\mathrm{W_{\mathbb{C}}}$ with complex weights. We relate models $\mathrm{W_{co}}(d)$ to standard models $\mathrm{W_{Ma}}(d)$ based on Markov chains. The follow-up article will treat non-Archimedean models $\mathrm{W_{fo}}(k)$ in which weights are formal power series in $\mathbb{C}[[x_1,x_2,\dots,x_k]]$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 29 canonical work pages

[1]

N. H. Abel, Untersuchungen ¨ uber die Reihe: 1 + m 1x + m·(m−1) 1·2 · x2 + m·(m−1)·(m−2) 1·2·3 ·x3 +... ... u. s. w. Journal f¨ ur die reine und angewandte Mathematik 1 (1826), 311–339

work page
[2]

M. H. Albert, Ch. Bean, A. Claesson, ´E. Nadeau, J. Pantone and H. Ulfars- son, Combinatorial Exploration: An algorithmic framework for enumera- tion, ArXiv:2202.07715v3, 2024, 99 pp

arXiv 2024
[3]

Alexanderson, The Random Walks of George P´ olya, The Mathematical Association of America, Washington, DC 2000

G. Alexanderson, The Random Walks of George P´ olya, The Mathematical Association of America, Washington, DC 2000

work page 2000
[4]

Beck, Recurrence of inhomogeneous random walks, Period

J. Beck, Recurrence of inhomogeneous random walks, Period. Math. Hung 74 (2017), 137–196

work page 2017
[5]

E. A. Bender and L. B. Richmond, Correlated random walks, Annals Prob. 12 (1984), 274–278

work page 1984
[6]

Billingsley, Probability and Measure

P. Billingsley, Probability and Measure. Third Edition, John Wiley & Sons, New York 1995

work page 1995
[7]

Comtet, Advanced Combinatorics

L. Comtet, Advanced Combinatorics. The Art of Finite and Infinite Expan- sions, D. Reidel, Dordrecht, Holland 1974

work page 1974
[8]

Feller, An Introduction to Probability Theory and Its Applications

W. Feller, An Introduction to Probability Theory and Its Applications. Vol- ume I. Third Edition, John Wiley & Sons, New York 1968

work page 1968

Show all 31 references

[9]

Flajolet and R

P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge Univer- sity Press, Cambridge, UK 2009

2009
[10]

F. G. Foster and I. J. Good, On a generalization of Polya’s random-walk theorem, Qart. J. Math. Oxford 4 (1953), 120–126

1953
[11]

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, J. Wiley & Sons, New York 1983

1983
[12]

Grimmet and D

G. Grimmet and D. Welsh, Probability. An Introduction. Second Edition, Oxford University Press, Oxford, UK 2014

2014
[13]

Klazar, A combinatorial model of discrete random walks, in preparation

M. Klazar, A combinatorial model of discrete random walks, in preparation
[14]

Klazar, Semi-formal symbolic method in enumerative combinatorics, in preparation

M. Klazar, Semi-formal symbolic method in enumerative combinatorics, in preparation
[15]

Klazar and R

M. Klazar and R. Horsk´ y, Extending P´ olya’s random walker beyond prob- ability II. Non-Archimedean weights, in preparation
[16]

Kochetkov, An easy proof of Polya’s theorem on random walks, arXiv:1803.00811v1, 2018, 3 pp

Y. Kochetkov, An easy proof of Polya’s theorem on random walks, arXiv:1803.00811v1, 2018, 3 pp. 33

2018 arXiv
[17]

Kolmogoroff, Grundbegriffe der Wahrscheinlichkeitsrechnung , Verlag von Julius Springer, Berlin 1933

A. Kolmogoroff, Grundbegriffe der Wahrscheinlichkeitsrechnung , Verlag von Julius Springer, Berlin 1933

1933
[18]

Lange, Polya’s random walks theorem revisited, Amer

K. Lange, Polya’s random walks theorem revisited, Amer. Math. Monthly 122 (2015), 1005–1007

2015
[19]

G. F. Lawler, Intersections of Random Walks , Birkh¨ auser, Boston 1991

1991
[20]

D. A. Levin and Y. Peres, P´ olya’s theorem on random walks via P´ olya’s urn, Amer. Math. Monthly 117 (2010), 220–231

2010
[21]

Novak, P´ olya’s random walk theorem,Amer

J. Novak, P´ olya’s random walk theorem,Amer. Math. Monthly 121 (2014), 711–716

2014
[22]

Polya, ¨Uber eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Strassennetz, Math

G. Polya, ¨Uber eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Strassennetz, Math. Annalen 84 (1921), 149–160

1921
[23]

Polya, Sur la promenade au hasard dans un r´ eseau de rues, Actualit´ es Sci

G. Polya, Sur la promenade au hasard dans un r´ eseau de rues, Actualit´ es Sci. Ind. 734 (1938), 25–44

1938
[24]

R´ enyi, Teorie pravdˇ epodobnosti, Academia, Praha 1972 [Probability Theory, translation of the German edition in 1962, translator not men- tioned]

A. R´ enyi, Teorie pravdˇ epodobnosti, Academia, Praha 1972 [Probability Theory, translation of the German edition in 1962, translator not men- tioned]

1972
[25]

R´ ev´ esz,Random Walk in Random and Nonrandom Environments, World Scientific Publishing Co., Inc., Teaneck, NJ, 1990

P. R´ ev´ esz,Random Walk in Random and Nonrandom Environments, World Scientific Publishing Co., Inc., Teaneck, NJ, 1990

1990
[26]

Robbins, A remark on Stirling’s formula, Amer

H. Robbins, A remark on Stirling’s formula, Amer. Math. Monthly 6 (1955), 26–29

1955
[27]

wikipedia.org/wiki/Symbolic_method_(combinatorics)

Symbolic method (combinatorics), Wikipedia article, https://en. wikipedia.org/wiki/Symbolic_method_(combinatorics)
[28]

Tenenbaum, Introduction to Analytic and Probabilistic Number Theory

G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory. Third Edition, AMS, Providence, RI 2015

2015
[29]

Winstein, P´ olya’s Theorem on Random Walks, slides, 2021, available at https://vilas.us/mathnotes/osutalks/ReadingClassics_ PolyasTheorem.pdf

V. Winstein, P´ olya’s Theorem on Random Walks, slides, 2021, available at https://vilas.us/mathnotes/osutalks/ReadingClassics_ PolyasTheorem.pdf

2021
[30]

Woess, Random Walks on Infinite Graphs and Groups , Cambridge Uni- versity Press, Cambridge, UK 2000

W. Woess, Random Walks on Infinite Graphs and Groups , Cambridge Uni- versity Press, Cambridge, UK 2000

2000
[31]

Woess, Denumerable Markov chains , European Mathematical Society (EMS), Z¨ urich 2009 34

W. Woess, Denumerable Markov chains , European Mathematical Society (EMS), Z¨ urich 2009 34

2009

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

N. H. Abel, Untersuchungen ¨ uber die Reihe: 1 + m 1x + m·(m−1) 1·2 · x2 + m·(m−1)·(m−2) 1·2·3 ·x3 +... ... u. s. w. Journal f¨ ur die reine und angewandte Mathematik 1 (1826), 311–339

work page

[2] [2]

M. H. Albert, Ch. Bean, A. Claesson, ´E. Nadeau, J. Pantone and H. Ulfars- son, Combinatorial Exploration: An algorithmic framework for enumera- tion, ArXiv:2202.07715v3, 2024, 99 pp

arXiv 2024

[3] [3]

Alexanderson, The Random Walks of George P´ olya, The Mathematical Association of America, Washington, DC 2000

G. Alexanderson, The Random Walks of George P´ olya, The Mathematical Association of America, Washington, DC 2000

work page 2000

[4] [4]

Beck, Recurrence of inhomogeneous random walks, Period

J. Beck, Recurrence of inhomogeneous random walks, Period. Math. Hung 74 (2017), 137–196

work page 2017

[5] [5]

E. A. Bender and L. B. Richmond, Correlated random walks, Annals Prob. 12 (1984), 274–278

work page 1984

[6] [6]

Billingsley, Probability and Measure

P. Billingsley, Probability and Measure. Third Edition, John Wiley & Sons, New York 1995

work page 1995

[7] [7]

Comtet, Advanced Combinatorics

L. Comtet, Advanced Combinatorics. The Art of Finite and Infinite Expan- sions, D. Reidel, Dordrecht, Holland 1974

work page 1974

[8] [8]

Feller, An Introduction to Probability Theory and Its Applications

W. Feller, An Introduction to Probability Theory and Its Applications. Vol- ume I. Third Edition, John Wiley & Sons, New York 1968

work page 1968