相关论文: Goldbug Variations

In this note, we design a discrete random walk on the real line which takes steps $0, \pm 1$ (and one with steps in $\{\pm 1, 2\}$) where at least $96\%$ of the signs are $\pm 1$ in expectation, and which has $\mathcal{N}(0,1)$ as a…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

In this note, we use a toy problem of detecting cycles of length two in a tent map to highlight some curious phenomena in the behavior of discrete dynamical systems. This work presents no new results or proofs, only computer experiments and…

Analytic solution is given in the steady state limit for the system of Master equations describing a random walk on one-dimensional periodic lattices with arbitrary hopping rates containing one mobile, directional impurity (defect bond).…

The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly connected directed graph (digraph) and give a formula for the…

We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…

In this work we consider open quantum random walks on the non-negative integers. By considering orthogonal matrix polynomials we are able to describe transition probability expressions for classes of walks via a matrix version of the…

Dzhaparidze and Spreij [5] showed that the quadratic variation of a semimartingale can be approximated using a randomized periodogram. We show that the same approximation is valid for a special class of continuous stochastic processes. This…

This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a functions of its summands as their number tends to infinity. The conditioning event is of moderate or…

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

We study the characteristic function and moments of the integer-valued random variable $\lfloor X+\alpha\rfloor$, where $X$ is a continuous random variables. The results can be regarded as exact versions of Sheppard's correction. Rounded…

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

Fitting complicated models to large datasets is a bottleneck of many analyses. We present GooFit, a library and tool for constructing arbitrarily-complex probability density functions (PDFs) to be evaluated on nVidia GPUs or on multicore…

Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…

We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…

The problem of studying rare events is central to many areas of computer simulations. In a recent paper [Kang, P., et al., Nat. Comput. Sci. 4, 451-460, 2024], we have shown that a powerful way of solving this problem passes through the…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

Calculations of excited states in Green's function formalism often invoke the diagonal approximation, in which the quasiparticle states are taken from a mean-field calculation. Here, we extend the stochastic approaches applied in the…

In the spirit of "multi-culturalism", we use four kinds of computations: simulation, numeric, symbolic, and "conceptual" to explore some "games of pure chance" inspired by children board games like "Snakes and Ladders" (aka as "Chutes and…

For one-dimensional random Schr\"odinger operators, the integrated density of states is known to be given in terms of the (averaged) rotation number of the Pr\"ufer phase dynamics. This paper develops a controlled perturbation theory for…