Related papers: Diffusive behavior of a greedy traveling salesman
We formulate a scaling theory for the long-time diffusive motion in a space occluded by a high density of moving obstacles in dimensions 1, 2 and 3. Our tracers diffuse anomalously over many decades in time, before reaching a diffusive…
We study a natural information dissemination problem for multiple mobile agents in a bounded Euclidean space. Agents are placed uniformly at random in the $d$-dimensional space $\{-n, ..., n\}^d$ at time zero, and one of the agents holds a…
Greedy algorithms are central to sparse approximation and stage-wise learning methods such as matching pursuit and boosting. It is known that the Power-Relaxed Greedy Algorithm with step sizes $m^{-\alpha}$ may fail to converge when…
The L\'evy, jumping process, defined in terms of the jumping size distribution and the waiting time distribution, is considered. The jumping rate depends on the process value. The fractional diffusion equation, which contains the variable…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
In this paper, we address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery,…
We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable…
We compute the average shape of trajectories of some one--dimensional stochastic processes x(t) in the (t,x) plane during an excursion, i.e. between two successive returns to a reference value, finding that it obeys a scaling form. For…
We consider the online transportation problem set in a metric space containing parking garages of various capacities. Cars arrive over time, and must be assigned to an unfull parking garage upon their arrival. The objective is to minimize…
Recent experiments on the propagation of light over a distance L through a random packing of spheres with a power law distribution of radii (a socalled L\'evy glass) have found that the transmission probability T \propto 1/L^{\gamma} scales…
Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly…
A random walk is performed on a disordered landscape composed of $N$ sites randomly and uniformly distributed inside a $d$-dimensional hypercube. The walker hops from one site to another with probability proportional to $\exp [- \beta…
We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary occupation probability and for the mean and global first…
We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for…
We study a class of random walk, the stored-energy-driven L\'evy flight (SEDLF), whose jump length is determined by a stored energy during a trapped state. The SEDLF is a continuous-time random walk with jump lengths being coupled with the…
We investigate active lattice walks: biased continuous time random walks which perform orientational diffusion between lattice directions in one and two spatial dimensions. We study the occupation probability of an arbitrary site on the…
Search strategies based on random walk processes with long-tailed jump length distributions (Levy walks) on the one hand and intermittent behavior switching between local search and ballistic relocation phases on the other, have been…
We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…