Related papers: Agnostically Learning Juntas from Random Walks

Using quantum algorithms, we obtain, for accuracy $\epsilon>0$ and confidence $1-\delta,0<\delta<1,$ a new sample complexity upper bound of $O((\mbox{log}(\frac{1}{\delta}))/\epsilon)$ as $\epsilon,\delta\rightarrow 0$ for a general…

We consider an irreducible finite range random walk on the $d$-dimensional integer lattice and study asymptotic behaviour of its transition function $p(n; x)$. In particular, for simple random walk our asymptotic formula is valid as long as…

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

We study random knots, which we define as a triple of random periodic functions (where a random function is a random trigonometric series, \[f(\theta) = \sum_{k=1}^\infty a_k \cos (k \theta) +b_k (\sin k \theta),\] with $a_k, b_k$ are…

The Takagi-van der Waerden functions are a well-known class of continuous but nowhere differentiable functions. In this paper, we study their weighted versions, the Takagi-van der Waerden class functions $f_{r,a}(x)$, from a probabilistic…

We study the problem of computationally efficient proper agnostic learning of multidimensional concept classes under the Gaussian distribution. In this setting, given i.i.d. labeled samples from an unknown distribution over $\mathbb{R}^d…

Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…

We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…

The worst-case Lipschitz constant of an $n$-player $k$-action $\delta$-perturbed game, $\lambda(n,k,\delta)$, is given an explicit probabilistic description. In the case of $k\geq 3$, $\lambda(n,k,\delta)$ is identified with the passage…

Given a Boolean function $f$ provided as a black-box with $n$ variables, this paper will propose a quantum algorithm for testing if a certain variable is junta or $\epsilon$-far from being junta. The proposed algorithm constructs another…

We consider two interacting random walks on $\mathbb{Z}$ such that the transition probability of one walk in one direction decreases exponentially with the number of transitions of the other walk in that direction. The joint process may…

Spatially homogeneous random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero jump probabilities at distance at most 1, with non-zero drift in the interior of the quadrant and absorbed when reaching the axes are studied. Absorption…

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…

In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now…

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

In this article we establish for the superdiffusive regime $p \in (1/2,1)$ that the fluctuations of a general step-reinforced random walk around $a_n \hat{W}$, where $(a_n)_{n \in \mathbb{N}}$ is a non-negative sequence of order $n^p$ and…

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…

We consider a random walk of $n$ steps starting at $x_0=0$ with a double exponential (Laplace) jump distribution. We compute exactly the distribution $p_{k,n}(\Delta)$ of the gap $d_{k,n}$ between the $k^{\rm th}$ and $(k+1)^{\rm th}$…