Let each step have length , and let be the number of right steps among independent steps. Then has a binomial distribution and the physical displacement is . Therefore , and the position probability mass is
This is zero unless is an integer, , and is even. The parity condition matters because the walk alternates between the two sublattices. If distance is measured in lattice spacings, replace by .
Normalization follows from the binomial theorem. Its first two moments provide useful checks:
These are exact discrete-time statements; a smooth continuum probability density requires coarse-graining over the lattice and its parity oscillation.
The one-step master equation for the biased random walk is
Expand in a Taylor series and retain the first time derivative and the first two space derivatives. Since and ,
Thus the usual continuum truncation gives the requested Fokker-Planck equation,
The diffusion coefficient has units , while has units of velocity. The physical drift velocity is , because the standard advection term is . A rightward bias therefore means , , and .
The approximation must be stated carefully. The truncation is a controlled diffusion limit of a weakly biased random walk when , , and , keeping and finite. It is also the spatial diffusion approximation for a continuous-time jump process with exponentially distributed waiting times of mean .
If the original fixed-step-time walk has a finite bias, its exact variance from (a) instead gives the diffusion coefficient of the Gaussian envelope about the drifting mean:
One obtains the same correction by retaining in the time expansion and using the leading advection equation to replace by . The result is . In particular, a deterministic one-way walk has zero variance, as this expression requires. Thus is the usual intended first-time-derivative approximation, not an exact variance-growth coefficient at arbitrary bias. The later continuum estimates use that convention, with the fixed-time alternative identified where relevant.
For this radial random walk on a regular tree, the drawing is an infinite regular tree of degree , not a planar lattice with closed loops. The radial coordinate is the number of edges in the unique path to the root. A non-root vertex has one neighbour inward and neighbours outward, so equal probabilities for its edges give
Let be radial distance measured in edge units. For , probability arriving in shell comes from shell by an outward step or from shell by an inward step:
This has precisely the same bulk master equation as the one-dimensional biased random walk, with
The outward bias is geometric: beyond the first shell, the number of vertices is , so there are more outward than inward choices even though no edge direction is dynamically preferred. is the probability summed over an entire shell, not the probability at one specified vertex; no additional shell-size factor belongs in the boxed recurrence.
The equality concerns the evolution equation away from the root, not equality to the unrestricted full-line binomial distribution at all positions. The root imposes a different boundary rule.
At the root all neighbours are in shell one, so the probability of leaving the root for that shell is one. Conversely, a walker anywhere in shell one chooses its unique rootward edge with probability . The two boundary recurrences are therefore
Together with and , these equations determine the distribution. In particular and , which check the special root coefficient. For the original indexing, replace by and by on the right-hand sides. Summing these equations and the bulk recurrence conserves .
Farther than a few edge lengths from the root, replace the radial coordinate by a physical coordinate and smooth the master equation. It has the same constant-coefficient Fokker-Planck equation as in (b). Under the conventional first-time-derivative truncation,
The radial drift is outward. For the tree is the infinite line, its radial distance is an unbiased reflected walk, and .
The root cannot absorb probability or allow negative radial distance. Write the equation as a continuity equation, using the Fokker-Planck probability current
The appropriate continuum boundary condition is reflecting, or zero flux:
It is not generally : that simpler condition is correct only when . With the finite-bias fixed-step Gaussian convention from (b), use instead; the drift sign and zero-current boundary condition are unchanged. A continuum boundary condition represents the microscopic root region after coarse-graining, rather than reproducing each discrete root probability at individual step times.
For the infinite system with outward drift, total probability remains one, but probability at a fixed distance from the root eventually decreases as the walker moves away. The question concerns this local decay, not a loss of total probability.
The independent dimensions of the continuum coefficients are and . The drift-diffusion decay time and its associated length are, up to numerical factors:
Equivalently, equating the drift distance to the diffusive width of order gives this crossover scale. Rescaling and removes the dimensional coefficients from the equation.
With the conventional coefficients used in the requested continuum derivation,
where the last expression suppresses the numerical factor as requested. The elementary drifted Gaussian distribution on the full line has
At fixed , its exponential decay factor is , so an exponential e-folding time would conventionally be called , consistent with the same dimensional scale. The reflecting half-line changes the spatial form and algebraic prefactor. The substitution gives , displaying the same exponential scale for outward drift.
For , and no finite drift-induced exponential decay time exists: the probability near the root decays only algebraically. For the finite-bias, deterministic-step Gaussian envelope discussed in (b), the corresponding dimensional expression is instead . These continuum estimates are not exact return-probability decay rates for the lattice walk at arbitrary ; in particular, a diffusion approximation need not describe far-tail return events accurately at strong bias.

Articles by others on the same topic (0)

There are currently no matching articles.