THE LAPLACIAN RANDOM WALK

1986 ◽  
pp. 87-92 ◽  
Author(s):  
J.W. LYKLEMA ◽  
Carl EVERTSZ
1986 ◽  
Vol 2 (2) ◽  
pp. 77-82 ◽  
Author(s):  
J. W Lyklema ◽  
C Evertsz ◽  
L Pietronero

2019 ◽  
Vol 48 (5) ◽  
pp. 11-16
Author(s):  
Nicolas Wicker ◽  
Canh Hao Nguyen ◽  
Hiroshi Mamitsuka

A graph random walk is presented. It is derived from the p-Laplacian similarly tothe derivation of the canonical random walk from the Laplacian. This variant enables quicker exploration while still sticking to the connection constraints given by the graph. A potential application is shown for video games.


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