Related papers: Discrepancy and Fisher information
Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…
Differential privacy is a mathematical concept that provides an information-theoretic security guarantee. While differential privacy has emerged as a de facto standard for guaranteeing privacy in data sharing, the known mechanisms to…
An algorithm of searching a zero of an unknown undimensional function is considered, measured at a point x with some error. The step sizes are random positive values and are calculated according to the rule: if two consecutive iterations…
We conjecture the expected value of random walks with anti-correlated steps to be exactly 1. We support this conjecture with 2 plausibility arguments and experimental data. The experimental analysis includes the computation of the expected…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
The Fisher information matrix summarizes the amount of information in a set of data relative to the quantities of interest. There are many applications of the information matrix in statistical modeling, system identification and parameter…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We analyze the differences between the horizontal and the vertical component of the simple random walk on the 2-dimensional comb. In particular we evaluate by combinatorial methods the asymptotic behaviour of the expected value of the…
A quantum measurement is Fisher symmetric if it provides uniform and maximal information on all parameters that characterize the quantum state of interest. Using (complex projective) 2-designs, we construct measurements on a pair of…
The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed up spatial search on a variety of graphs,…
Standard random projection techniques typically operate as a black box, mapping high-dimensional structures directly to a lower-dimensional space where the target dimension must be specified a \textit{priori}. To address scenarios where the…
We study the shrinking Pearson random walk in two dimensions and greater, in which the direction of the Nth is random and its length equals lambda^{N-1}, with lambda<1. As lambda increases past a critical value lambda_c, the endpoint…
We present a systematic analytical approach to the trapping of a random walk by a finite density rho of diffusing traps in arbitrary dimension d. We confirm the phenomenologically predicted e^{-c_d rho t^{d/2}} time decay of the survival…
Entanglement is the key quantum resource for improving measurement sensitivity beyond classical limits. However, the production of entanglement in mesoscopic atomic systems has been limited to squeezed states, described by Gaussian…
We consider a model of space-continuous one-dimensional random walk with simple correlation between the steps: the probability that two consecutive steps have same sign is $q$ with $0\leq q\leq 1$. The parameter $q$ allows thus to control…
In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we…
We study memory based random walk models to understand diffusive motion in crowded heterogeneous environment. The models considered are non-Markovian as the current move of the random walk models is determined by randomly selecting a move…
In Robbins' problem of minimizing the expected rank, a finite sequence of $n$ independent, identically distributed random variables are observed sequentially and the objective is to stop at such a time that the expected rank of the selected…
A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…