Generalized diffusion and random search processes

We consider a one-dimensional Brownian search in the presence of trapping. The diffusion equation of the particle is represented by a memory kernel that enters the general waiting time probability density function. We find the general form of the first arrival time density, search reliability and efficiency and analyze several special cases of the memory kernel. We also analyze the Lévy search in the presence of trapping in cases of single and multiple targets, as well as combined Lévy–Brownian search strategies in case of a single target. The presented results are general and could be of interest for further investigation of different optimal search strategies, as well as in the animal foraging or spreading of contamination particles in the environment.


Introduction
Searching problems are ubiquitous in the natural world. They occur on many fields. In our daily life, searching for a lost key is a representative search problem [1]. In order to produce a chemical reaction, transcription factor proteins search for a specific binding spot on a DNA chain in biology [2,3]. In addition, the behaviors of animals foraging are a branch of the search problem [4,5]. Mathematically, computer algorithms searching for minima in a complex search space [6] are classified as a search problem. Brownian motion with Gaussian distributed jump length was considered as an optimal search strategy until Shlesinger and Klafter suggested that Lévy flight is more efficient when searching for sparse targets in 1986 [7]. The typical characteristic of one-and two-dimensional Brownian search lies in oversampling, which frequently arrives at the previously visited point. The Brownian search strategy is sufficient when we have a non-destructive search scenario where the target does not get depleted from being visited by the searcher, but in the case of destructive foraging, where the target becomes undetectable after visiting it once, this strategy becomes inefficient [5,[7][8][9]. This oversampling behavior can be avoided by Lévy flight search and in cases of destructive foraging it becomes the optimal search strategy since the scale free of jump length [10,11], where the distribution of jump length satisfies power-law distribution, i.e. λ(x) ∼ 1/|x| 1+β with 0 < β < 2 [12][13][14].
We focus on the search problems in the discipline of movement ecology [4,15], where the movement patterns of animals are saltatory, occupied with long excursions. One of the classical examples is albatross birds searching for food [16,17]. Within this movement ecology the Lévy flight hypothesis is formulated: it states that the scale-free search strategies called Lévy flight search minimise the search time [5,8,16] and is the optimal search strategy under a broad set of conditions, such as target resource distribution (sparse/abundant resources), target revisitability (destructive/non-destructive targets) and prey targeting [18]. For albatross birds searching for sparse food, it is a good choice to search with power-law distributed jump length. It is discovered that there are a large number of animals searching with such scale-free strategies. For instance, deer and goats [19,20], bees [21] as well as marine predators [22,23]. Though there are some questions [17,24,25] about the Lévy flight search strategies of albatross birds, in [26] it implies that the searching strategies of individual albatross birds are indeed Lévy flights.
In order to verify whether the searcher can locate the target or not, search reliability is defined. However, it cannot be used to judge a search strategy since it does not provide any information about the efficiency of a search strategy. Correspondingly, search efficiency is defined, which is used to choose the optimal search strategies and is a crucial quantity in search problem [27]. Based on the space-fractional Fokker-Planck equation as well as search reliability and search efficiency, [28] compares the Brownian search with the Lévy flight search, it found that the search efficiency depends on the initial searcher-target distance, Brownian search is a good choice when the initial searcher-target distance is smaller than some critical value, otherwise Lévy flight optimizes the search process. [28] also discusses the problem of searching for multiple targets. Moreover, the search efficiencies are compared in [29] in the presence of an external drift. It shows that Brownian searcher is always the most efficient for short initial separation or when the target is in the downhill case for larger initial separation, whereas Lévy flight turns out to be efficient search strategy when the target is in the uphill case. In addition, due to the complex biological reality, the search reliability and search efficiency of combined Lévy-Brownian motion are discussed in [30].
Beginning with the Montroll-Weiss equation [31,32], which is derived in the frame of continuous time random walk (CTRW) model, in [33] a generalized diffusion equation in modified or Riemann-Liouville form is obtained, which generalizes the time fractional diffusion equation [14,34]. In this paper we aim to study the search process based on the generalized diffusion equation for different memory kernels. The aim of introducing such search problems is manifold. Apart from the application in animal foraging, the considered models could be of interest for analysis of the propagation of contamination particles in the environment. The CTRW model [14,36,37] was applied, for example, to infiltration of anomalously diffusing particles from one material to another through a biased interface [38], and recently in the long-term prediction of 137 Cs concentration in the lakes after the Fukushima Daiichi Nuclear Power Plant accident [39], where the contamination particle ( 137 Cs) follows a long-tailed waiting time between jumps. Additionally to the ground and underground water pollution, such CTRW models could apply to model propagation of sandstorm particles, including pathogens or microbes carried by the sandstorm [40][41][42]. The sandstorm particles fly over a long distance before they arrive at the particular area and stay around for some time while the next flight takes place. The long flight of sandstorm particles may be interrupted by long waiting times. By studying the first passage and/or arrival time distribution of the contamination particle to the particular point of interest, one can map the area affected by the contamination particles at some given time.
This paper is organized as follows. In section 2, we introduce the Brownian search model with trapping in terms of the generalized diffusion equation, calculate the search reliability and search efficiency for different memory kernels. In section 3, we turn to discuss the Lévy flight search with trapping in the presence of one target. Finally, we conclude the paper with some discussions in section 4. In the appendices, we give the properties of Mittag-Leffler and Fox H-functions, as well as general results for Lévy flight search with trapping in the presence of multiple targets and combined Lévy flight search in the presence of a single target.

Brownian search with trapping
We consider one dimensional search with trapping, which is given by the following generalized diffusion equation with a δ-sink of a strength ℘ fa (t) where the initial condition meets P(x, t = 0) = δ(x − x 0 ). Here, D is a diffusion coefficient and η(t) represents the memory kernel, satisfying lim s→0 1 η(s) = 0 and 1 η(s) is a complete Bernstein function [33,[43][44][45]. In this equation, δ-sink means that the random searcher positioned at x = x 0 at the beginning, will be removed when it arrives for the first time at x = X, i.e. P(x = X, t) = 0. Thus, ℘ fa (t) represents the first arrival time density (FATD) [46,47].
Here we note that in the absence of a sink, equation (1) is reduced to the generalized diffusion equation [33,43,48] describing the anomalous diffusive process. This equation can be obtained from the CTRW model [37] with a memory-dependent waiting time probability density function (PDF) ψ(t), which in Laplace space is given byψ(s) = 1/(1 + τ ηη −1 (s)), and jump length PDF λ(x) with finite variance, which in Fourier space isλ(k) ∼ 1 − σ 2 2 k 2 . The generalized diffusion coefficient in equation (2) Integrating equation (1) with respect to x from −∞ to ∞, we get the expression of FATD, which reads It is the negative time derivative of the survival probability S(t) = ∞ −∞ P (x, t) dx. Two important quantities characterising the diffusion process respectively are search reliability and search efficiency. The search reliability quantifies the extent to which the search process can locate the trap, which is accounted as the cumulative arrival probability [47] If the search reliability equals one, P = 1, the searcher will find the target with the probability 1. With the aid of Laplace transform 7 the search reliability can be simplified as where℘ fa (s) is the Laplace image of ℘ fa (t). The search reliability may be relevant for choosing the search strategy. A large value of search reliability corresponds to a high success probability to which the searcher can locate the target. It can be smaller than unity for example for Brownian search with drift, which pushes the particle in the opposite direction from the target location [47]. The search efficiency can be defined in different ways either as a ratio of the visited number of targets and the number of steps or as a ratio of the visited number of targets and the distance travelled. The first definition can be applied when a searcher moves with jumps, while the second definition applies for example to Brownian motion search and finite-velocity Lévy walks search [28][29][30]. We focus on searching for a single or a finite number of targets with saltatory motion in this paper. In our continuous time model, we argued that the search efficiency can be described as a ratio of the visited number of targets and the time of the process with a proper averaging. Naturally, it relates to the mean first arrival time, t = , in two ways, as E = 1/ t , or as the averaged inverse search time [47] This definition of efficiency (6) was used for Brownian motion with drift [47], symmetric Lévy flight search with drift [47], for combined Lévy-Brownian and Lévy-Lévy search [28][29][30] of single and multiple targets, as well as asymmetric Lévy flight search [49], and in all cases such an approach gives reasonable results. Moreover, t diverges in some 7 The Laplace transform is defined asf(s) = L{f(t)}(s) = situations since if we consider, for example, Brownian search, then some of the particles will go in the opposite direction of the target and will never reach it, which by averaging will lead to infinite mean time to reach the target [50]. Also, t is diverging when an external bias initially pushes the Lévy flight searcher towards the target [29]. In this case, due to the presence of leapovers a Lévy flight searcher may miss the target [29]. Furthermore, the efficiency of a given search strategy could be also analyzed in terms of calculation of the most probable value of the first arrival time, which can be obtained by finding the first derivative with respect to time t of the FATD. Thus, finding the most probable value of the first arrival time may require numerical calculations. In this paper, we calculate the most probable value of the first arrival time for some cases of the memory kernel analytically and for some numerically. However, detailed analysis and comparison between different definitions of the efficiency require further extensive numerical study and we leave this problem for some future work.
Here, we utilize (6) as a definition of search efficiency. A search strategy is optimal when the search efficiency of the corresponding diffusion process is maximal. Using the properties of Laplace transform wheref(u) is the Laplace image of f(t). The search efficiency (6) can be written in the following form [47] Thus, both the search reliability and the search efficiency are related to the Laplace image of FATD, i.e.℘ fa (s). In the following, we aim to derive the expression of℘ fa (s). By Laplace and Fourier transformation 8 of equation (1), we find from there we havẽ The inverse Fourier transform 9 of equation (10) yieldŝ From the conditionP (x = X, s) = 0 for the FATD we obtain 8 The Fourier transform is defined asf 9 The inverse Fourier transform is defined as By substitution of FATD in equation (11), for theP (x, s) we find This result can be obtained if one uses the subordination approach, such as in [51].
In addition, combined with (5) we find that the search reliability equals P =℘ fa (s = 0) = 1 since the memory kernel satisfies lim s→0 1 η(s) = 0, which means the searcher will always arrive at the target eventually. We calculate the search efficiency based on (12), which is expressed by Next, we will calculate the search efficiency for some representative memory kernels η(t).
Here we note that for the case without sink, we find the solution of equation (2) in the form (x 0 = 0) From here, one can find the corresponding mean squared displacement (MSD) [33], i.e.

Brownian search
The standard case of Brownian search is obtained for η(t) = 1, i.e.η(s) = 1/s. In this situation, the waiting time PDF behaves as Poisson distribution ψ(t) = L −1 1 1+τ s = 1 τ e −t/τ and MSD in the absence of a sink has a linear dependence on time x 2 (t) = 2Dt. The FATD then becomeŝ i.e.
which is the Lévy-Smirnov distribution with power-law decay t −3/2 in the long time limit [46], see figure 1. This result coincides with the first passage time density [50] since the particle does not perform the jump-like motion and the first passage time will be the same as the first arrival/hitting time. The reliability equals one, P = 1, while the efficiency is [47] We note that the mean time of the Brownian particle to hit the target, t = ∞ 0 t ℘ fa (t) dt, diverges [50] since some particles can move in the wrong direction and never hit the target. By taking the first derivative with respect to time t of the FATD, we figure out the most probable value of the first arrival time t * , which behaves as t * = (X−x 0 ) 2 6D . Thus, if we define the efficiency as the reciprocal of the most probable value of first arrival time t * , we find E * = 1 t * = 6D (X−x 0 ) 2 . Moreover, for a fixed initial searcher-target distance, increasing diffusivity of the searcher can improve the search efficiency.
For the FATD in the Laplace space we yield where H m,n p,q (z) is the Fox H-function (A.5). The above equals sign holds by using relation (A. 16). Taking the inverse Laplace transform (A.11) for the FATD gives with 0 < α < 1. This is the case of anomalous diffusive search with waiting time PDF, which scales as ψ(t) ∼ t −1−α . Graphical representation of the FATD (21) is given in figure 2, showing its long time behavior of form ℘ fa (t) ∼ t −α/2−1 . We note that the FATD has the same behavior as the first passage time density (see equation (54) in [35]), since the particle does not perform jump-like motion and thus the FATD and the first passage time density coincides. The reliability equals one, while the efficiency is We note that the case α = 1/2 can be related to the Brownian backbone search on a twodimensional comb [56], where the efficiency behaves as E ∼ 1 |X−x 0 | 4 , while for α = 1/4 to the Brownian backbone search on a three-dimensional comb with E ∼ 1 |X−x 0 | 8 [57]. The result of one dimension Brownian search is recovered when α = 1. Since the MSD of the searcher in the absence of a sink has a power law dependence on time, we call it a subdiffusive search. We also note that from the definition t = − ∂℘ fa (s) ∂s s=0 and equation (20), one finds that the mean time the particle to hit the target diverges, since some of the particles move in the wrong direction and never hit the target. The left panel of figure 3 shows the efficiency as a function of the initial searcher-target distance |X − x 0 | for fixed exponent α. For close initial searcher-target distance |X − x 0 |, subdiffusion search with small exponent α is the best search strategy. However, with increasing |X − x 0 |, subdiffusive search with larger exponents α becomes more efficient, thus for large initial searcher-target distance the Brownian search is the most efficient search strategy. This behavior is consistent with our intuition since for short initial separation, Brownian search may start the search in the opposite direction of the target, while the subdiffusive search due to the waiting time in the traps reduces the probability that searcher moves away from the target in the wrong direction in a short time of the search. For longer initial searcher-target distances, the Brownian search is more efficient since with subdiffusive search the particle moves slower due to the waiting time in the traps. In addition to initial searcher-trap distance |X -x 0 |, the search efficiency has a close relation with α. As [29] does, we also introduce the relative efficiency to discuss the dependence of search efficiency on α for fixed |X -x 0 |. The relative efficiency is defined as where E(α opt ) stands for the maximum efficiency for this initial separation and the corresponding value of power-law memory kernel exponent is α opt . Obviously, E rel = 1 if α = α opt . As shown in the right panel of figure 3, for close initial separation the functional form of E rel is non-monotonic. It drops with increasing α until it reaches the minimum, and then grows with α. However for the longer initial distance between the searcher and target |X -x 0 |, the functional form of E rel is monotonic. The search efficiency attains the maximum when α = 1, which implies the Brownian search is the most efficient among subdiffusive search for longer initial distance between the searcher and the target.
The efficiency as the reciprocal of the most probable value of first arrival time for the case of power-law memory kernel cannot be obtained analytically and requires numerical calculations. In figure 4, we give a comparison between the calculated efficiency (22) and the reciprocal of the most probable value of first arrival time.

Exponential memory kernel
We consider the exponential memory kernel η(t) = e −rt , i.e.η(s) = 1 s+r . Without the sink term, we recover the Brownian motion with exponential resetting to the initial position of the searcher (see for example [58]), which can be rewritten in the form [59] or in the renewal form [60] Here, P(x, t) is the PDF for r = 0. We note that due to the resetting mechanism, the condition lim s→0 from which, by inverse Laplace transform, we find the exponentially truncated Lévy-Smirnov distribution shown in figure 5. The reliability then becomes P = e − √ r D |X−x 0 | , which equals unity only for r = 0. Therefore, the resetting mechanism which brings the particle back to the initial position decreases the cumulative arrival probability for the particles to reach the target. For the efficiency, we find This result reduces to the efficiency (19) of Brownian search if r = 0. For a fixed initial distance between the searcher and the target, the search efficiency decreases with increasing reset rate r. Significantly different from the Brownian search strategy, when the memory kernel behaves as an exponential distribution, we conclude that the mean . This is due to the resetting mechanism which prevents the particles from moving in the wrong direction and never finding the target. Here, we note that in terms of the most probable value of first arrival time, for efficiency we find

Truncated power-law memory kernel
For the truncated (or tempered) power-law memory kernel η(t) = e −rt t α−1 Γ(α) , 0 < α < 1, r > 0, i.e.η(s) = (s + r) −α , in the absence of sink, we recover the subdiffusive search process with exponential resetting to the initial position. The corresponding diffusion equation for the PDF P r (x, t) can be written in renewal form (25) through the PDF P(x, t) in the absence of resetting mechanism (r = 0) [61], as well as in the form of the tempered fractional Fokker-Planck equation [62,63] For the FATD in Laplace space, we havê which by inverse Laplace transform becomes The FATD in the long time limit is of exponentially truncated power-law form ℘ fa (t) ∼ t −α/2−1 e −rt , which can be seen in figure 6.  The reliability equals P = e − r α/2 √ D |X−x 0 | , which equals unity again only for r = 0 since the resetting decreases the cumulative arrival probability for the particles to reach the target. For the efficiency we find where Γ(a, z) =  smaller exponents α and r is more efficient. Furthermore, the mean time for the particle to hit the target becomes finite as well, i.e. t = α|X−x 0 | √ 4Dr 2−α e − √ r α D |X−x 0 | , since the resetting prevents the particle from moving far away from the target in the wrong direction.
In figure 8 as in the case of power-law memory kernel, we give a comparison between the efficiency calculated with (32) and the efficiency given with the reciprocal of the most probable value of first arrival time for the truncated power-law memory kernel. Here again as it is with the power-law memory kernel, the first arrival time cannot be obtained analytically and the time is calculated using numerical methods.

Lévy search with trapping
We may also consider the first arrival process of Lévy flight search in the presence of the target located in position X. The particle will be removed from the location X once it arrives for the first time. The corresponding Fokker-Planck equation contains a δ-sink term with strength ℘ fa (t), where ∂ β ∂|x| β is the Riesz fractional derivative of order 0 < β 2. It is defined as a pseudodifferential operator with the Fourier symbol |k| β , i.e. [64] In the following discussion, we only consider 1 < β 2 since the search reliability equals zero for one-dimension Lévy flight search without a bias, which is explained in [29,46]. In addition, D β represents the generalized diffusion coefficient [14]. For β = 2, it corresponds to a Brownian search with trapping. Integrating both sides of (33) over x from −∞ to ∞, the same formula for the FATD is obtained as the one given by equation (3). Equation (33) without a sink gives the generalized, nonlocal in space and time, diffusion equation This equation can be obtained from CTRW with the same waiting time PDF as we consider before, and jump length PDF with infinite variance, i.e.λ(k) ∼ 1 − σ β 2 |k| β , 0 < β < 2, giving the generalized diffusion coefficient D β = σ β /[2τ η ]. Therefore, equation (35) combines Lévy flights (represented by the Riesz space fractional derivative) with subdiffusive dynamics (represented by the memory kernel).
By Fourier-Laplace transformation we have from which we find where we use relation (A.17). From the condition P(x = X, s) = 0, by inverse Fourier transform of equation (37), for the FATD we find It can be simplified aŝ where we used equation (A.7), or where we used equation We note that in the absence of a sink the solution of equation (35) in Laplace space is given by (x 0 = 0) From here one can calculate the q th moment for 0 < q < β 2, which reads Therefore, the second moment, i.e. MSD (q = 2) diverges, and thus one defines fractional moments |x(t)| q to characterize the transport, from which as MSD one uses |x(t)| q 2/q . For β = 2 and q = 2 we recover the MSD given by equation (16).

Lévy flight search
The typical case of Lévy flight search is derived when η(t) = 1, i.e.η(s) = 1/s. In the absence of a sink, from (42) for the q th moment one finds |x(t)| q ∼ t q/β and thus |x(t)| q 2/q ∼ t 2/β . This is the case of superdiffusion (2/β > 1), which is characteristic for Lévy flights [14]. The FATD reads ℘ fa (s) = sin(π/β)H 2,1 2,3 The inverse Laplace transformation yields Using the asymptotic expression of H-function in [65], for the long-time limit we havê from where it follows that ℘ fa (t) ∼ t −2+1/β in the long time limit [46]; see figure 9. The searcher will always find the target after a sufficiently long time since the search reliability is one. The search efficiency is This type of Lévy flight search was first considered and in details analyzed in [66], and then additionally investigated in [29], as well. As shown in figure 10, the efficiency of Lévy flight search is symmetric with respect to target position X. For short initial searcher-target distances, Brownian search is a more efficient process and the functional form of relative efficiency E rel is completely monotonous, see the left panel of figure 11. However, for large initial searcher-target distances, Lévy flight search with smaller power-law exponent β is dominant. This behavior is consistent with our intuition since the jump length of Lévy flight increases with decreasing power-law exponent β, leading to the searcher arrives at the target faster for large initial distances. In addition, the power-law exponent β of optimal Lévy flight search strategy shifts to left with increasing initial searcher-target distance |X -x 0 |.

Power-law memory kernel. Lévy flight search with trapping
Similarly, taking η(t) = t −α /Γ[1 − α] (η(s) = s −α ) for 0 < α < 1, we have the situation of Lévy flight search (due to the Riesz space fractional derivative in the equation) with trapping (due to the power-law memory kernel, which gives long tailed waiting time PDF between the jumps). In the absence of a sink, for the q th moment we have |x(t)| q ∼ t αq/β , i.e. |x(t)| q 2/q ∼ t 2α/β . This is the case of typical competition between long jumps, characterized by parameter β and long waiting times, characterized by parameter α, see [14]. For 2α β 1 one observes either subdiffusion, normal diffusion For s → 0 we havê ; optimal powerlaw exponent β opt as a function of the initial searcher-target distance x 0 (right) for X = 1 and D β = 1. For X = 0 see [47]. which for the long time limit yields ℘ fa ∼ t −1−α+α/β . The reliability equals one since for s → 0 from (49) we have P = 1. Moreover, for the efficiency one obtains For α = 1, we recover the efficiency of Lévy flights search (46), discussed in the previous subsection 3.1, while for β = 2 and 0 < α < 1 we recover the efficiency (22) for subdiffusive search, considered in subsection 2.2. For a fixed power-law exponent α, the power-law exponent β of maximum efficiency decreases with increasing the initial searcher-target distance, as shown in figure 12. For example for α = 1, it shifts from β ≈ 1.5 for x 0 = 10 to β ≈ 1.25 for x 0 = 100. From figure 13, we observe that for close initial searcher-target distance |X − x 0 |, the optimal power-law exponent β opt is 2, and it drops for growing initial searcher-target distance since its long jumps.

Exponential memory kernel
When the memory kernel behaves as an exponential function η(t) = e −rt , i.e.η(s) = 1 s+r , in the absence of the sink the corresponding equation describes Lévy flight with resetting [67],  In the presence of the sink, the FATD in the Laplace space becomeŝ ℘ fa (s) = sin(π/β)H 2,1 The reliability then becomes The search reliability has a close relation with the power-law exponent β and the resetting rate r, as well as the initial searcher-trap distance |X − x 0 |. For a fixed initial separation and fixed r, we view search reliability as a function of power-law exponent β. As shown in figure 14, we find the search reliability improves for growing power-law exponent β. In addition, for fixed power-law exponent β, the search reliability grows with decreasing the resetting rate r. According to the definition of the search efficiency, we get

Conclusions
We discuss the search problem from the perspective of the generalized diffusion equation.
First, we consider one-dimensional Brownian search with trapping, i.e. the MSD of jump length is finite, combined with some representative cases of the memory kernel, which enter the generalized waiting time PDF, we derive the concrete form of the FATD, search reliability and efficiency. Next, we consider a one-dimensional Lévy search with trapping, i.e. the jump length of a one-dimensional searcher is power-law distribution with 1 < β 2. We also derive the general form of the FATD, search reliability and efficiency. Finally, we generalize the above method to analyze the FATD when there are multiple targets as well as combined search strategies.
For the case of one-dimensional Brownian search with trapping, the search reliability equals one, which means the searcher will always arrive at the position of the target. For a close initial distance between the searcher and the target, the efficiency of the subdiffusion search process with small memory kernel exponent is maximal, which states the fact that the subdiffusion search process with small memory kernel exponent is the best search strategy. By the same method we find that the Brownian search outperforms for longer initial search-trap distance. In addition, for long initial separation we also find that the efficiency of subdiffusion search with large memory kernel exponent is bigger than the one with small memory kernel exponent. However, this situation changes when tempering of the memory kernel takes action, i.e. the efficiency of the subdiffusion search process with small memory kernel exponent is bigger than the one with large memory kernel exponent.
For the case of one-dimensional Lévy search with trapping, the search reliability equals one. For close initial distance between the searcher and the target, Brownian search outperforms than Lévy flight search. Combined with the above conclusion, subdiffusion search process with small memory kernel exponent is the best strategy for close initial separation. For growing initial separation, the search efficiency is maximal for Lévy flight search with smaller power-law exponent β due to its long jump. In addition, there are two optimal power-law exponents when the memory kernel of the searcher is power-law with smaller exponent α. For Lévy flight search with exponential memory kernel, the search reliability is less than one. Moreover, the search reliability improves for decreasing resetting rate r and increasing power-law exponent β, respectively. By the same method, we derive the general form of the FATD both for Lévy search in presence of multiple targets and combined Lévy searches in the presence of one target, see appendices B and C.

Appendix C. Combined search
We may also consider the problem of combined Lévy search in the presence of one target, We recover the results of search reliability in [28] if we consider a combination of two Lévy processes, which states the search reliability is 1 if both 1 < β j 2. In addition, the search reliability and efficiency for combined Lévy-Brownian search were considered in [30] by the method of numerical integration when the memory kernel behaves as η(t) = 1.