Search results for "Random walk"
showing 10 items of 132 documents
Random Walks on Weighted Graphs of Groups
2019
Let X be a locally finite simplicial tree without terminal vertices, and let X = ∣X∣1 be its geometric realisation. Let Γ be a nonelementary discrete subgroup of Aut(X).
Order-disorder phase transition in random-walk networks
2004
In this paper we study in detail the behavior of random-walk networks (RWN's). These networks are a generalization of the well-known random Boolean networks (RBN's), a classical approach to the study of the genome. RWN's are also discrete networks, but their response is defined by small variations in the state of each gene, thus being a more realistic representation of the genome and a natural bridge between discrete and continuous models. RWN's show a clear transition between order and disorder. Here we explicitly deduce the formula of the critical line for the annealed model and compute numerically the transition points for quenched and annealed models. We show that RBN's and the annealed…
Markov Chains and Electrical Networks
2020
There is a natural connection between electrical networks and so called reversible Markov chains. An example for such a chain is the symmetric graph random walk which, in each step, jumps to a randomly chosen graph neighbor at equal probability. This connection is studied here in some detail. As an application, we prove the statement that if such a graph random walk is recurrent, then it is recurrent also on each subgraph. (Although this statement is rather plausible, it is hard to show by different means.) In particular, the graph random walk on a percolation cluster of the planar integer lattice is recurrent.
Dynamics of two competing species in the presence of Lévy noise sources
2010
We consider a Lotka-Volterra system of two competing species subject to multiplicative alpha-stable Lévy noise. The interaction parameter between the species is a random process which obeys a stochastic differential equation with a generalized bistable potential in the presence both of a periodic driving term and an additive alpha-stable Lévy noise. We study the species dynamics, which is characterized by two different regimes, exclusion of one species and coexistence of both. We find quasi-periodic oscillations and stochastic resonance phenomenon in the dynamics of the competing species, analysing the role of the Lévy noise sources.
A random-walk benchmark for single-electron circuits
2021
Mesoscopic integrated circuits aim for precise control over elementary quantum systems. However, as fidelities improve, the increasingly rare errors and component crosstalk pose a challenge for validating error models and quantifying accuracy of circuit performance. Here we propose and implement a circuit-level benchmark that models fidelity as a random walk of an error syndrome, detected by an accumulating probe. Additionally, contributions of correlated noise, induced environmentally or by memory, are revealed as limits of achievable fidelity by statistical consistency analysis of the full distribution of error counts. Applying this methodology to a high-fidelity implementation of on-dema…
A novel strategy for solving the stochastic point location problem using a hierarchical searching scheme
2014
Stochastic point location (SPL) deals with the problem of a learning mechanism (LM) determining the optimal point on the line when the only input it receives are stochastic signals about the direction in which it should move. One can differentiate the SPL from the traditional class of optimization problems by the fact that the former considers the case where the directional information, for example, as inferred from an Oracle (which possibly computes the derivatives), suffices to achieve the optimization-without actually explicitly computing any derivatives. The SPL can be described in terms of a LM (algorithm) attempting to locate a point on a line. The LM interacts with a random environme…
$(BV,L^p)$-decomposition, $p=1,2$, of Functions in Metric Random Walk Spaces
2019
In this paper we study the $(BV,L^p)$-decomposition, $p=1,2$, of functions in metric random walk spaces, a general workspace that includes weighted graphs and nonlocal models used in image processing. We obtain the Euler-Lagrange equations of the corresponding variational problems and their gradient flows. In the case $p=1$ we also study the associated geometric problem and the thresholding parameters.
A Random Walk Through Fractal Dimensions. VonB. H. Kaye. VCH Verlagsgesellschaft, Weinheim/VCH Publishers, New York 1989. XXV, 421 S., geb. DM 138.00…
1991
Exceptional Quantum Walk Search on the Cycle
2016
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk's random sampling yields an arbitrary speedup in query complexity over the classical random walk's hitting time. In this context, however, the mixing time to prepare the initial uniform state…
Quantum Random Walks – New Method for Designing Quantum Algorithms
2008
Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on "glued trees" graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications.