First-Return Statistics in Henyey-Greenstein Scattering: Colored Motzkin Polynomials and the Cauchy Kernel

TL;DR

This paper develops a mathematical framework for analyzing photon return statistics in three-dimensional Henyey-Greenstein scattering, introducing a Boundary Truncation Factor modeled by a Cauchy kernel, validated by Monte Carlo simulations.

Contribution

It extends one-dimensional first-passage probability models to three dimensions with a new Boundary Truncation Factor, enabling efficient analysis of anisotropic photon transport.

Findings

Cauchy kernel accurately models the Boundary Truncation Factor for moderate anisotropy.

The framework achieves 1-2% accuracy in reproducing Monte Carlo results.

Extension to oblique incidence maintains independence of Motzkin counting machinery.

Abstract

We study first-return statistics for photons undergoing three-dimensional Henyey-Greenstein scattering in a semi-infinite medium. In previous work, we showed that one-dimensional first-passage probabilities can be expanded using Catalan and Motzkin generating functions. Extending this framework to three dimensions requires introducing a Boundary Truncation Factor (BTF), which accounts for the restricted angular phase space imposed by the boundary. Extensive Monte Carlo simulations are used to determine the BTF empirically as a function of scattering order and anisotropy. For moderate anisotropy, the BTF is accurately described by a Cauchy kernel, with parameters depending only on the Henyey-Greenstein asymmetry factor. This closed-form expression reproduces Monte Carlo results with 1-2% accuracy over a broad range of scattering orders. At higher anisotropy, systematic deviations from the Cauchy form are observed. These deviations can be reduced using a one-parameter generalized kernel. We further extend the framework to oblique incidence by replacing the normal-incidence return probability with a Legendre-series formulation. The BTF parameters and Motzkin counting machinery remain independent of the incidence angle, so only the anchor point of the algorithm changes. The resulting framework provides a computationally efficient mapping from three-dimensional anisotropic transport at arbitrary incidence to one-dimensional combinatorial first-passage theory.