相关论文: Mean number of visits to sites in Levy flights

We study airplane boarding in the limit of large number of passengers using geometric optics in a Lorentzian metric. The airplane boarding problem is naturally embedded in a 1+1 dimensional space-time with a flat Lorentzian metric. The…

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…

A L\'evy random medium, in a given space, is a random point process where the distances between points, a.k.a. targets, are long-tailed. Random walks visiting the targets of a L\'evy random medium have been used to model many (physical,…

We consider a discrete-time random walk on a line starting at $x_0\geq 0$ where a cost is incurred at each jump. We obtain an exact analytical formula for the distribution of the total cost of a trajectory until the process crosses the…

We discuss surveillance with multiple unmanned aerial vehicles (UAV) that minimize idleness (the time between consecutive visits of sensing locations) and constrain latency (the time between capturing data at a sensing location and its…

A straightforward analytical scheme is proposed for computing the long-time, asymptotic mean velocity and dispersivity (effective diffusivity) of a particle undergoing a discrete biased random walk on a periodic lattice amongst an array of…

We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

What is the analogue of L\'evy processes for random surfaces? Motivated by scaling limits of random planar maps in random geometry, we introduce and study L\'evy looptrees and L\'evy maps. They are defined using excursions of general L\'evy…

In this paper, we derive explicit formulas for the surface averaged first exit time of a discrete random walk on a finite lattice. We consider a wide class of random walks and lattices, including random walks in a non-trivial potential…

We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…

For a L\'evy process $X$ on a finite time interval consider the probability that it exceeds some fixed threshold $x>0$ while staying below $x$ at the points of a regular grid. We establish exact asymptotic behavior of this probability as…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial…

The modeling of risk situations that occur in a space-time framework can be done using max-stable random fields on lattices. Although the summary coefficients for the spatial and temporal behaviour do not characterize the finite-dimensional…

The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…

We examine isotropic and anisotropic random walks which begin on the surface of linear ($N$), square ($N \times N$), or cubic ($N \times N \times N$) lattices and end upon encountering the surface again. The mean length of walks is equal to…

For a one-dimensional L\'{e}vy process, we derive an explicit formula for the probability of first hitting a specified point among a fixed finite set. Moreover, using this formula, we obtain an explicit expression for each entry of the…

In the first part of this paper, we obtain symmetric formulae for the probabilities that a plane convex body hits exactly 1, 2, 3, 4, 5 or 6 triangles of a lattice of congruent triangles in the plane. Furthermore, a very simple formula for…

We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…