Related papers: Diffusive behavior of a greedy traveling salesman
Continuous time random walk models with decoupled waiting time density are studied. When the spatial one jump probability density belongs to the Levy distribution type and the total time transition is exponential a generalized…
The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent…
Consider a collection of weighted subsets of a ground set N. Given a query subset Q of N, how fast can one (1) find the weighted sum over all subsets of Q, and (2) sample a subset of Q proportionally to the weights? We present a tree-based…
A major problem in data augmentation is to ensure that the generated new samples cover the search space. This is a challenging problem and requires exploration for data augmentation policies to ensure their effectiveness in covering the…
A Levy walk is a non-Markovian stochastic process in which the elementary steps of the walker consist of motion with constant speed in randomly chosen directions and for a random period of time. The time of flight is chosen from a…
Optimal random foraging strategy has gained increasing concentrations. It is shown that L\'evy flight is more efficient compared with the Brownian motion when the targets are sparse. However, standard L\'evy flight generally cannot be…
Anomalous dynamics in which local perturbations spread faster than diffusion are ubiquitously observed in the long-time behavior of a wide variety of systems. Here, the manner by which such systems evolve towards their asymptotic…
We consider a broad class of Continuous Time Random Walks with large fluctuations effects in space and time distributions: a random walk with trapping, describing subdiffusion in disordered and glassy materials, and a L\'evy walk process,…
In natural foraging, many organisms seem to perform two different types of motile search: directed search (taxis) and random search. The former is observed when the environment provides cues to guide motion towards a target. The latter…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
Sequential learning problems are common in several fields of research and practical applications. Examples include dynamic pricing and assortment, design of auctions and incentives and permeate a large number of sequential treatment…
Pairwise comparison labels are more informative and less variable than class labels, but generating them poses a challenge: their number grows quadratically in the dataset size. We study a natural experimental design objective, namely,…
We address the problem of random search for a target in an environment with space-dependent diffusion coefficient $D(x)$. From a general form of the diffusion differential operator that includes It\^o, Stratonovich, and…
The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…
This paper focuses on the development of novel greedy techniques for distributed learning under sparsity constraints. Greedy techniques have widely been used in centralized systems due to their low computational requirements and at the same…
L\'evy walks represent a class of stochastic models (space-time coupled continuous time random walks) with applications ranging from the laser cooling to the description of animal motion. The initial model was intended for the description…
We investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of…
We study a one-dimensional random walk with memory. The behavior of the walker is modified with respect to the simple symmetric random walk (SSRW) only when he is at the maximum distance ever reached from his starting point (home). In this…
Scale-free foraging patterns are widespread among animals. These may be the outcome of an optimal searching strategy to find scarce randomly distributed resources, but a less explored alternative is that this behaviour may result from the…
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly…