Probabilistic methods of bypassing the maze using stones and a random number sensor

E. G. Kondakova; A. Ya. Kanel-Belov

doi:10.22405/2226-8383-2018-20-3-296-315

Home/Archive/arXiv

arXiv · 1912.04701

Probabilistic methods of bypassing the maze using stones and a random number sensor

E. G. Kondakova·A. Ya. Kanel-Belov

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, some open questions that are posed in Ajans' dissertation continue to be addressed: a robot bypass with a generator of random bits of integer spaces in the presence of a stone and a subspace of flags. This work is devoted to bypassing the maze with a finite state machine with a random bit generator. This task is part of the rapidly evolving theme of bypassing the maze by various finite state machines. or their teams, which is closely related to problems from the theory of computational complexity and probability theory. In this paper, it is shown at what dimensions a robot with a random bit generator and a stone can bypass integer space with a subspace of flags. In this paper, we will study the behavior of a finite state machine with a random bit generator on integer spaces. In particular, it was proved that the robot bypasses $ \ zs ^ 2 $ and cannot bypass $ \ zs ^ 3 $; a robot with a stone bypasses $ \ zs ^ 4 $ and cannot bypass $ \ zs ^ 5 $; a robot with a stone and a flag bypasses $ \ zs ^ 6 $ and cannot bypass $ \ zs ^ 7 $; a robot with a stone and a plane of flags bypasses $ \ zs ^ 8 $ and cannot bypass $ \ zs ^ 9 $.

Explore related subjects

cs.DS math.PR

Keep this discovery

BibTeX RIS

E. G. Kondakova, A. Ya. Kanel-Belov. 2019-11-24. Probabilistic methods of bypassing the maze using stones and a random number sensor. https://doi.org/10.22405/2226-8383-2018-20-3-296-315

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗