Universality Classes of Hitting Probabilities of Jump Processes

Quantifying the efficiency of random target search strategies is a key question of random walk theory, with applications in various fields. If many results do exist for recurrent processes, for which the probability of eventually finding a target in infinite space - so called hitting probability - is one, much less is known in the opposite case of transient processes, for which the hitting probability is strictly less than one. Here, we determine the universality classes of the large distance behavior of the hitting probability for general d-dimensional transient jump processes, which we show are parametrized by a transience exponent that is explicitly given.