--- title: Correlated Classical Random Walk Analysis url: https://www.emergentmind.com/topics/correlated-classical-random-walk type: topic --- # Correlated Classical Random Walk Analysis A correlated classical random walk is a random-walk model in which successive displacements are not independent. In the standard one-dimensional discrete-time formulation, each step has fixed length \(\delta x\), occurs after fixed time \(\delta t\), and has sign \(\nu_n\in\{-1,+1\}\), but the probability that two consecutive steps have the same sign is \(q\neq 1/2\). This one-step memory produces persistence for \(q>1/2\), anti-persistence for \(q<1/2\), and the ordinary uncorrelated walk at \(q=1/2\). The topic has developed along several axes: exact finite-time combinatorics for displacement and return laws, scaling transformations across sampling intervals, inhomogeneous ensembles, first-passage and record statistics, graph- and operator-theoretic formulations, and systematic comparison with coined quantum walks [1207.1240] [2203.07674] [2507.23524]. ## 1. Foundational definitions and parameterizations In the discrete-time correlated walk, the position is built from step increments \[ X_n-X_{n-1}=\nu_n, \] with physical coordinates \[ x_k=k\,\delta x,\qquad t_n=n\,\delta t. \] The persistence parameter is \[ q=\Pr(\nu_{n+1}=\nu_n). \] The standard interpretation is immediate: \(q>1/2\) gives a persistent walk, \(q<1/2\) an anti-persistent walk, and \(q=1/2\) the ordinary uncorrelated random walk. In this formulation the process is a Markov chain, because the next step depends only on the immediately preceding step, not on the full history. A common misconception is that “correlated” here necessarily means non-Markovian; for the basic single-walker model that is not the case [1207.1240]. A useful exact diagnostic is the step-sign autocorrelation \[ C_{\nu\nu}(n\mid q)=\frac{\langle \nu_m\nu_{m+n}\rangle_m}{\langle \nu_m^2\rangle_m}=(2q-1)^n, \] so the discrete-time correlations decay exponentially in the lag \(n\). In the inhomogeneous-ensemble literature this same correlation structure is expressed as a velocity autocorrelation \[ C_{vv}(\Delta t)=\sigma_v^2 e^{-\Delta t/\tau},\qquad \tau=\frac{\delta t}{2(1-q)}, \] where \(\tau\) sets the crossover from short-time ballistic behavior to long-time diffusive behavior [1207.1240] [1207.2242]. An equivalent one-step-memory parameterization specifies the next move conditional on the previous direction. If the previous step was to the left, then \[ P(\text{move left})=p,\qquad P(\text{move right})=1-p. \] If the previous step was to the right, then \[ P(\text{move left})=1-q,\qquad P(\text{move right})=q. \] This is encoded by the transition matrix \[ A=\begin{bmatrix} a & b\\ c & d \end{bmatrix},\qquad a,b,c,d\in[0,1],\qquad a+c=b+d=1, \] with \(0n\). With physical units, \[ p(\Delta x,\Delta t\mid q,\delta x,\delta t)=P\!\left(k=\frac{\Delta x}{\delta x},\,n=\frac{\Delta t}{\delta t}\mid q\right)/(2\delta x), \] and interpolation is used off the lattice. The central point is that \(q\neq 1/2\) changes the full displacement law, not merely the variance [1207.1240]. The mean squared displacement also has a closed form: \[ \overline{\Delta k^2}(n\mid q)=\frac{nq}{1-q}\left\{1-\frac{(2q-1)\left[1-(2q-1)^n\right]}{2nq(1-q)}\right\}, \] and in physical units \[ \overline{\Delta x^2}(\Delta t\mid q,\delta x,\delta t)=\overline{\Delta k^2}(n=\Delta t/\delta t\mid q)\,\delta x^2. \] At long times the walk is diffusive, but the diffusion constant is \(q\)-dependent [1207.1240]. A separate exact observable is the return probability on \(\mathbb{Z}\). If \(\Xi_n^{(CRW)}(l,m)\) denotes the sum of all paths with \(l\) left steps and \(m\) right steps, then for an initial state \(\hat\varphi\in\mathbb{R}^2\) with \(\|\hat\varphi\|_1=1\), \[ P(S_n^{(CRW)}=x)=\|\Xi_n^{(CRW)}(l,m)\hat{\varphi}\|_1,\qquad n=l+m,\quad x=-l+m. \] Returning to the origin requires \(l=m\), so the return probability is nonzero only at even times. The path-counting method yields a closed form in terms of Legendre polynomials. With \[ \Delta_{\pm}=ad\pm bc,\qquad k_{\pm}=ac\,\hat{\varphi}_1+bd\,\hat{\varphi}_2\pm ad, \] the paper gives \(r_{2n}^{(CRW)}(0)\) explicitly as a Legendre-polynomial combination in \(P_{n-1}\) and \(P_n\). When \(a=d\), the return probability does not depend on the initial state. In the ordinary-random-walk limit \(\Delta_-=0\), one obtains \[ r_{2n}^{(RW)}(0)=(pq)^n\binom{2n}{n}, \] and for the symmetric case \(p=q=1/2\), \[ r_{2n}^{(RW)}(0)=2^{-2n}\binom{2n}{n}. \] The generating function is elementary, involving a square root rather than elliptic integrals [2203.07674]. These exact laws show that nearest-neighbor correlation is not a perturbative refinement of the simple random walk but a distinct combinatorial object. The displacement law, return law, and second moment all retain closed-form structure, yet differ qualitatively from the binomial/Gaussian profile of the uncorrelated case. ## 3. Scaling, coarse graining, and heterogeneous ensembles A central scaling result states that a correlated discrete-time random walk with parameters \[ [\delta t,\delta x,q] \] can be mapped to a walk with finer sampling interval \[ \delta t'=\frac{\delta t}{s} \] while preserving long-time displacement statistics. Matching the step autocorrelation under time rescaling gives \[ q' = q'(q,s)=\frac{1}{2}\left(1\pm |2q-1|^{1/s}\right), \] with \(+\) for \(q>1/2\) and \(-\) for \(q<1/2\). Matching the asymptotic mean squared displacement then requires \[ \delta x'=\delta x\,g(q,s),\qquad g(q,s)=\sqrt{\frac{q(1-q)}{q'(1-q')}\,\frac{1}{s}}. \] The full transformation is therefore \[ [\delta t,\delta x,q]\longrightarrow \left[\frac{\delta t}{s},\,\delta x\,g(q,s),\,q'(q,s)\right]. \] A common misunderstanding is that autocorrelation matching alone is sufficient; the construction explicitly shows that rescaling \(\delta x\) is also necessary. The equivalence is a long-time one, not a step-by-step microscopic identity [1207.1240]. The same logic extends to inhomogeneous ensembles in which each walker \(j\) has its own persistence \(q_j\), and possibly its own step length \(\delta x_j\). For a distribution \(P(q)\), \[ \left\langle P(k,n)\right\rangle_q=\int_0^1 dq\,P(q)\,P(k,n\mid q), \] and \[ \left\langle \overline{\Delta x^2}(n\mid q)\right\rangle_q=\int_0^1 dq\,P(q)\,\overline{\Delta x^2}(n\mid q). \] Although each constituent walker remains a simple Markovian correlated random walker, the ensemble can display markedly different statistics: the averaged displacement density can become leptokurtic, and the mean squared displacement can increase approximately like a fractional power law with lag time. This is an explicit instance in which complex ensemble-level behavior does not require a single non-Markovian microscopic walker [1207.2242]. For the special case of a uniform distribution \(P(q)=1\) on \([0,1]\), the averaged step autocorrelation becomes \[ C_{\nu\nu}(n)=\int_0^1 (2q-1)^n\,dq=\frac{\frac12(1+(-1)^n)}{n+1}=\frac{E_n}{n+1}, \] where \(E_n=1\) for even \(n\) and \(E_n=0\) for odd \(n\). The corresponding exact ensemble MSD is \[ \left\langle \overline{\Delta x^2}(n\mid q)\right\rangle_{P(q)=1} = \epsilon+(n+1)\left[\Psi\!\left(\frac{n+3-\epsilon}{2}\right)-\Psi\!\left(\frac{3}{2}\right)\right], \] with \(\epsilon=0\) for even \(n\) and \(\epsilon=1\) for odd \(n\). The reported growth is approximately a fractional power law with an effective exponent around \(1.3\) over a broad range of lag times, but the paper stresses that this is a broad crossover generated by a superposition of correlation times, not a true asymptotic power law from a scale-free process [1207.2242]. The ensemble framework is also applied to temporally fluctuating parameters \((q_j(t),\delta x_j(t))\), provided they remain approximately constant over windows \(T\gg\Delta t\). This suggests a bridge between heterogeneous populations and nonstationary single-particle trajectories without changing the effective lag-time statistics [1207.2242]. ## 4. First-passage structure, survival, and record statistics In a space-continuous one-dimensional variant, the walk is defined by \[ x_{n+1}=x_n+\sigma_n\eta_n, \] where \(\eta_n>0\) are i.i.d. with continuous density \(p(\eta)\), while the signs satisfy \[ \sigma_n= \begin{cases} \sigma_{n-1}, & \text{with probability } q,\\ -\sigma_{n-1}, & \text{with probability } 1-q. \end{cases} \] The persistence parameter is again \(q\). Under the continuity assumption on \(p(\eta)\), the survival probability \[ S_n^+(x=0;q) \] is independent of the jump distribution for any finite \(n\), a universality traced to the Sparre-Andersen theorem. The exact formula is \[ S_n^+(0;q)=\frac{2^{-2n}(1-q)}{\phantom{|} {2n\choose n} \;{}_2F_1\!\left(-\frac12,-n;\frac12-n;2q-1\right), \qquad n\ge1, \] with generating function \[ \tilde S^+(0;s;q)=\sum_{n=0}^\infty S_n^+(0;q)s^n = \frac{1}{1-q}\left[\sqrt{\frac{1-s(2q-1)}{1-s}}-q\right]. \] For fixed \(q<1\), \[ S_n^+(0;q)\simeq \sqrt{\frac{2}{\pi n(1-q)}}\qquad (n\to\infty). \] In the scaling regime \(n\to\infty\), \(q\to1\), \(y=n(1-q)=O(1)\), the model converges to the run-and-tumble particle, and the survival probability becomes \[ \mathcal S(y)=e^{-y}\bigl[I_0(y)+I_1(y)\bigr]. \] The same framework yields the exact distribution of the time \(n_{\max}\) at which the maximum is reached, \[ P_{k,n}^{\max}(q)= \begin{cases} \dfrac12\,S_n^+(0;q), & k=0,n,\\[1ex] \dfrac{1-q}{2}\,S_k^+(0;q)\,S_{n-k}^+(0;q), & 00. \] The exact variance is \[ \Delta_S^2=\frac{S(N+S)}{N+1}, \] so \(\Delta_S^2\sim S^2/(N+1)\), indicating super-diffusion. The step-step correlations do not decay: \[ \sigma_S\sigma_R=\frac{N}{N+1},\qquad S>R. \] Moreover, \[ \frac{\Delta_S}{S}\to Y,\qquad S\to\infty, \] where the limiting speed has density \[ p_Y(y;N)=\frac{\Gamma(N)}{2^{\,N-1}\Gamma(N/2)^2}(1-y^2)^{\frac{N}{2}-1},\qquad -1\le y\le 1. \] This walk is transient, record counts grow linearly rather than diffusively, and the limiting record distribution \[ P_\infty(M)=\frac{\Gamma(N)}{\Gamma(N/2)^2}\int_0^1 \frac{z^{M-2}(1-z)}{(1+z)^N}\,dz \] is nonzero for fixed \(M\). The contrast with the diffusive sign-persistence model is conceptually important: “correlated random walk” is not a single universality class, but a family of memory mechanisms with distinct asymptotic consequences [1905.13013]. ## 5. Spectral, graph, and finite-domain formulations Correlated classical random walks admit natural operator formulations on graphs. One construction starts from the Grover matrix \(U\) of the Grover walk on a connected graph \(G\) and defines a classical walk on the arc set \(D(G)\) by \[ P_{ef}=|U_{ef}|^2. \] The resulting process is a classical Markov chain on arcs, not vertices, so the next transition depends on the incoming direction. Its transition matrix can be written as \(P=J_0R\), and the characteristic polynomial \(\det(I_{2m}-uP)\) is obtained באמצעות a determinant formula for the generalized weighted zeta function. Explicit spectral formulas are then derived for connected \(d\)-regular graphs and connected semiregular bipartite graphs. For \(d=4\), the nontrivial correlation disappears: each nonzero transition probability becomes \(1/4\), the walk becomes essentially the simple random walk on arcs, and the Grover matrix is a Hadamard matrix [2012.09619]. A related “Walk/Zeta Correspondence” treats CRW on discrete tori \(\mathbb{T}_N^d\) with an internal coin state. The walk operator is matrix-valued, \[ M_A=\sum_{j=1}^d \left(P_{2j-1}A\,\tau_j^{-1}+P_{2j}A\,\tau_j\right), \] where the coin matrix \(A\) has nonnegative entries and each column sums to \(1\). Ordinary random walks arise as the degenerate case in which all columns are identical, so the internal state no longer matters. The zeta function is defined by \[ \zeta_{A,\mathbb{T}_N^d,u}^{-1}=\det\!\left(I-uM_A\right), \] and its logarithm generates traces of powers of \(M_A\). Fourier analysis reduces the determinant to a product over momentum modes, \[ \det(I-uM_A)=\prod_{k\in K_N^d}\det\!\left(I-uM_A(k)\right), \] yielding explicit zeta formulas for three- and four-state CRW on the one-dimensional torus and four-state CRW on the two-dimensional torus. This places correlated classical walks in a spectral framework parallel to that used for quantum walks [2109.07664]. On a finite path \(P_{n+1}\), the CRW is formulated on the two-component space \[ \mathcal S_{n+1}=\mathrm{Span}\{|x\rangle\otimes|L\rangle,\ |x\rangle\otimes|R\rangle:\ x\in V_{n+1}\}, \] with time evolution operator \(U=SC\), where \(C\) is a site-dependent coin and \(S\) is a boundary-preserving shift. In the isospectral-coin case, a Jacobi matrix \(B\) captures the essential spectral data. Most eigenvalues of \(U\) are obtained from the quadratic relation \[ \mu^2-(1-\nu_2)\lambda_m\mu-\nu_2=0, \] where \(\lambda_m\) is an eigenvalue of \(B\), and there is always an additional eigenvalue \[ \mu_0=1. \] The long-time limiting distribution exists and is the stationary distribution of an associated birth-and-death chain [2310.20220]. In a continuous-space finite-domain setting, the correlated random walk system is written for right- and left-moving densities \(u(x,t)\) and \(v(x,t)\): \[ \begin{cases} u_t+S u_x=-u+v,\\[2mm] v_t-S v_x=u-v, \end{cases} \qquad x\in(-1/2,1/2), \] with absorbing boundary conditions. In variables \(p=u+v\) and \(q=u-v\), this becomes \[ p_t+S q_x=0,\qquad q_t+S p_x=-2q, \] and hence the telegraph equation \[ p_{tt}+2p_t-S^2p_{xx}=0. \] The operator has compact resolvent, the semigroup is eventually compact, and all solutions decay exponentially with optimal exponent equal to the dominant eigenvalue \(\lambda_0(S)\). The spectrum is characterized by the transcendental equations \[ \sin\nu=S\nu,\qquad \lambda=-1-\cos\nu, \] and \[ \sin\nu=-S\nu,\qquad \lambda=-1+\cos\nu. \] This formulation makes precise the persistent-motion interpretation common in biological modeling and chromatography [2501.10586]. ## 6. Comparison principles and major extensions The correlated classical random walk is the natural classical analogue of a one-dimensional coined quantum walk when both are formulated on \(\mathbb{Z}\times\{\uparrow,\downarrow\}\), with an internal direction update followed by a conditional shift. The asymptotic distinction is sharp. For the classical walk with \(\delta\in(-1,1)\), the normalized position converges weakly to a centered Gaussian with variance \[ \sigma^2=\frac{n(1+\delta)}{1-\delta}, \] so the generic classical walk remains diffusive with \[ \sigma^2\sim \frac{1+\delta}{1-\delta}\,n. \] By contrast, non-trivial coined quantum walks have non-Gaussian limiting laws on compact support and asymptotic variance \(\Theta(n^2)\). Only the extremal classical cases align with boundary quantum cases: \(\delta=1\) gives quadratic growth, while \(\delta=-1\) yields an alternating walk matching the Pauli-\(X\) boundary behavior. This comparison clarifies that classical correlation changes the diffusion constant, whereas quantum coherence changes the qualitative transport regime [2507.23524]. For systems of two correlated classical random walks on a lattice, one can decompose the pair into a walk of common movements, a walk of counter movements, and a random time change. If \(B_n\) and \(W_n\) are the two walks and \(T_n\) counts the common-direction steps, then \[ B_n=X_{T_n}+Y_{S_n},\qquad W_n=X_{T_n}-Y_{S_n},\qquad S_n=n-T_n. \] Under symmetric marginal step laws, \(X\) and \(Y\) are independent simple random walks, so the entire dependence structure is carried by the clock \(T\). The three processes \(X\), \(Y\), and \(T\) are mutually independent if and only if Condition C1 holds. This decomposition isolates correlation into a time-change mechanism rather than into nontrivial marginal step laws [1808.05442]. A continuous-time extension replaces deterministic jump times by renewal times while retaining correlated spatial increments. In correlated CTRWs, the jumps are generated by a Markov chain arising from urn-scheme models, while the waiting times are independent and lie in the domain of attraction of a positively skewed \(\beta\)-stable law. The scaling limits are not Lévy processes but fractional Pearson diffusions: \[ X^{(n)}(n^{-1}N(n^{1/\beta}t))\Rightarrow X(E_t),\qquad Y^{(n)}(n^{-1}N(n^{1/\beta}t))\Rightarrow Y(E_t),\qquad Z^{(n)}(n^{-1}N(n^{1/\beta}t))\Rightarrow Z(E_t). \] This extends the notion of correlated classical random walk from nearest-neighbor persistence to decoupled CTRWs with correlated jumps and heavy-tailed waiting times [1708.07086]. Another extension connects correlated random walks to integrable discrete dynamics. In the symmetric case \(p=q\), eliminating one internal component from \[ \begin{cases} \mu_{L}^{n+1}(j)=p\,\mu_{L}^{n}(j+1)+(1-q)\,\mu_{R}^{n}(j+1),\\[2mm] \mu_{R}^{n+1}(j)=(1-p)\,\mu_{L}^{n}(j-1)+q\,\mu_{R}^{n}(j-1), \end{cases} \] yields the discrete correlated diffusion equation \[ f_{j}^{n+1}=p\bigl(f_{j-1}^{n}+f_{j+1}^{n}\bigr)-(2p-1)f_{j}^{n-1}. \] Through a generalized discrete Cole–Hopf transformation and ultradiscretization, this produces a variant of the ultradiscrete Burgers equation with a cellular-automaton interpretation as a traffic-flow model [2104.14009]. Taken together, these developments show that the correlated classical random walk is not a single model but a coherent research domain organized around a common principle: successive displacements are linked by internal state, persistence, or time-change structure. Depending on how that linkage is implemented, the resulting process may remain diffusive, exhibit effective coarse-grained anomalous scaling, converge to run-and-tumble dynamics, acquire exact spectral descriptions on graphs, or serve as a classical foil for quantum transport. Source: https://www.emergentmind.com/topics/correlated-classical-random-walk