相关论文: Intermittent Cauchy walks enable optimal 3D search…
Most global optimization problems are nonlinear and thus difficult to solve, and they become even more challenging when uncertainties are present in objective functions and constraints. This paper provides a new two-stage hybrid search…
We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…
We investigate the nonergodicity of the generalized L\'evy walk introduced by Shlesinger et al. [Phys. Rev. Lett. 58, 1100 (1987)] with respect to the squared displacements. We present detailed analytical derivations of our previous…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We consider diffusive motion of a particle performing a random walk with L\'evy distributed jump lengths and subject to resetting mechanism bringing the walker to an initial position at uniformly distributed times. In the limit of infinite…
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very…
We study L\'evy walks in quenched disordered one-dimensional media, with scatterers spaced according to a long-tailed distribution. By analyzing the scaling relations for the random-walk probability and for the resistivity in the equivalent…
We consider a one-dimensional search process under stochastic resetting conditions. A target is located at $b\geq0$ and a searcher, starting from the origin, performs a discrete-time random walk with independent jumps drawn from a…
The paper presents a multidimensional model for nonlinear Markovian random walks that generalizes one we developed previously (Phys. Rev. E v.79, 011110, 2009) in order to describe the Levy type stochastic processes in terms of continuous…
The search for hidden targets is a fundamental problem in many areas of science, engineering, and other fields. Studies of search processes often adopt a probabilistic framework, in which a searcher randomly explores a spatial domain for a…
In search for mathematically tractable models of anomalous diffusion, we introduce a simple dynamical system consisting of a chain of coupled maps of the interval whose Lyapunov exponents vanish everywhere. The volume preserving property…
We study the asymptotic behaviour of the most likely trajectories of a planar random walk that result in large deviations of the area of their convex hull. If the Laplace transform of the increments is finite on $R^2$, such a scaled limit…
The 3D incompressible Euler equation is an important research topic in the mathematical study of fluid dynamics. Not only is the global regularity for smooth initial data an open issue, but the behaviour may also depend on the presence or…
In this paper, we study the large $n$ asymptotics of the expected maximum of an $n$-step random walk/L\'evy flight (characterized by a L\'evy index $1<\mu\leq 2$) on a line, in the presence of a constant drift $c$. For $0<\mu\leq 1$, the…
Detecting L\'evy flights of cells has been a challenging problem in experiments. The challenge lies in accessing data in spatiotemporal scales across orders of magnitude, which is necessary for reliably extracting a power-law scaling.…
This paper is concerned with a predator-prey model in $N$-dimensional spaces ($N=1, 2, 3$), given by \begin{align*}\left\{\begin{aligned} &\frac{\partial u}{\partial t}=\Delta u-\chi\nabla\cdot(u\nabla v),\\ &\frac{\partial v}{\partial…
Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape. It thus enables efficient geometry processing algorithms specifically…
In unknown non-convex environments, such as indoor and underground spaces, deploying a fleet of robots to explore the surroundings while simultaneously searching for and tracking targets of interest to maintain high-precision data…
Continuous-time quantum walks (CTQW) have shown the capability to perform efficiently the spatial search of a marked site on many kinds of graphs. However, most of such graphs are hard to realize in an experimental setting. Here we study…
Correlated random walks (CRW) have been used for a long time as a null model for animal's random search movement in two dimensions (2D). An increasing number of studies focus on animals' movement in three dimensions (3D), but the key…