A Random-Walk-Based Dynamic Tree Evolution Algorithm with Exponential Speed of Convergence to Optimality on Regular Networks

Author(s):  
Keqin Li
2004 ◽  
Vol 56 (5) ◽  
pp. 963-982 ◽  
Author(s):  
Satoshi Ishiwata

AbstractWe prove an estimate for the speed of convergence of the transition probability for a symmetric random walk on a nilpotent covering graph. To obtain this estimate, we give a complete proof of the Gaussian bound for the gradient of the Markov kernel.


Open Physics ◽  
2003 ◽  
Vol 1 (4) ◽  
Author(s):  
Jozef Košík

AbstractWe present an overview of two models of quantum random walk. In the first model, the discrete quantum random walk, we present the explicit solution for the recurring amplitude of the quantum random walk on a one-dimensional lattice. We also introduce a new method of solving the problem of random walk in the most general case and use it to derive the hitting amplitude for quantum random walk on the hypercube. The second is a special model based on a local interaction between neighboring spin-1/2 particles on a one-dimensional lattice. We present explicit results for the relevant quantities and obtain an upper bound on the speed of convergence to limiting probability distribution.


1998 ◽  
Vol 50 (1-2) ◽  
pp. 144-156 ◽  
Author(s):  
Hong Shen ◽  
K. Li ◽  
Y. Pan ◽  
G.H. Young ◽  
S.Q. Zheng

Author(s):  
Joseph Rudnick ◽  
George Gaspari
Keyword(s):  

1990 ◽  
Vol 51 (C1) ◽  
pp. C1-67-C1-69
Author(s):  
P. ARGYRAKIS ◽  
E. G. DONI ◽  
TH. SARIKOUDIS ◽  
A. HAIRIE ◽  
G. L. BLERIS
Keyword(s):  

2011 ◽  
Vol 181 (12) ◽  
pp. 1284 ◽  
Author(s):  
Andrei K. Geim
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document