Related papers: Linearly Bounded Liars, Adaptive Covering Codes, a…

We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…

Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

We examine the sets of late points of a symmetric random walk on $Z^2$ projected onto the torus $Z^2_K$, culminating in a limit theorem for the cover time of the toral random walk. This extends the work done for the simple random walk in…

Test-time computation has become a primary driver of progress in large language model (LLM) reasoning, but it is increasingly bottlenecked by expensive verification. In many reasoning systems, a large fraction of verifier calls are spent on…

We present bounds on the maximal gain of adaptive and randomized algorithms over non-adaptive, deterministic ones for approximating linear operators on convex sets. If the sets are additionally symmetric, then our results are optimal. For…

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

We investigate random walks on the general linear group constrained within a specific domain, with a focus on their asymptotic behavior. In a previous work [38], we constructed the associated harmonic measure, a key element in formulating…

Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput. (2006)) show a…

We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead…

Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…

We consider a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory called the elephant random walk (ERW). We prove a strong invariance principle for the ERW. More specifically, we prove that, under a suitable…

Nonlinear, adaptive, or otherwise complex control techniques are increasingly relied upon to ensure the safety of systems operating in uncertain environments. However, the nonlinearity of the resulting closed-loop system complicates…

In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…

We model stochastic choice as environment-dependent switching among a small library of deterministic decision rules. A Random Rule Model generates menu-level choice probabilities via named, interpretable rules weighted by observable menu…

We derive a self-duality relation for a one-dimensional model of branching and annihilating random walkers with an even number of offsprings. With the duality relation and by deriving exact results in some limiting cases involving fast…

This paper studies the problem of differentially private empirical risk minimization (DP-ERM) for binary linear classification. We obtain an efficient $(\varepsilon,\delta)$-DP algorithm with an empirical zero-one risk bound of…

We introduce an analytically treatable spin decoherence model for quantum walk on a line that yields the exact position probability distribution of an unbiased classical random walk at all-time scales. This spin decoherence model depicts a…

The dynamics of nonlinear flip-flop quantum walk with amplitude-dependent phase shifts with pertubing potential barrier is investigated. Through the adjustment between uniform local perturbations and a Kerrlike nonlinearity of the medium we…

Promising results have been reported in quantifying microstructural parameters (free diffusivity, cell size, and membrane permeability) in head and neck cancers (HNCs) using time-dependent diffusion MRI fitted to Random Walk with Barrier…