Inferring tree structure with hidden traps from first-passage times

Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the root or leaves. By analyzing first-passage properties, we show that the first two first-passage-time factorial moments (FPTFMs) uniquely determine the tree structure. However, if the random walker experiences waiting phases-due to sticky branch walls or presence of traps-then this identification becomes nontrivial. We demonstrate that the generating function of the first-passage-time (FPT) distribution decomposes into contributions from the waiting-time distribution and the random walk without waiting, leading to a nonlinear system of equations relating the factorial moments of the waiting-time distribution and the FPTFMs of random walks with and without waiting. For geometrically distributed waiting times, additional moment measurements do not suffice, but unique determination of the structure is achieved by varying initial conditions or fitting the Fourier transform of the FPT distribution to measured data. The latter method remains effective also for power-law waiting-time distributions, where higher-order FPTFMs are undefined. These results provide a framework for reconstructing treelike networks from FPT data, with applications in biological transport and spatial networks.