Diffusion on Fractals — Efficient algorithms to compute the random walk dimension

2002 ◽  
pp. 52-67 ◽  
Author(s):  
A. Franz ◽  
S. Seeger ◽  
K.H. Hoffmann ◽  
C. Schulzky
1985 ◽  
Vol 32 (9) ◽  
pp. 6066-6066 ◽  
Author(s):  
Jayanth R. Banavar ◽  
Max Lipsicas ◽  
Jorge F. Willemsen
Keyword(s):  

2020 ◽  
Vol 34 (06) ◽  
pp. 2050031
Author(s):  
Zikai Wu ◽  
Guangyao Xu

Due to the ubiquitous occurrence of evanescence in many physical, chemical and biological scenarios, mortal random walks that incorporate evanescence explicitly have drawn more and more attention. It has been a hot topic to study mortal random walks on distinct network models. In this paper, we study mortal random walks on T fractal and a family of treelike regular fractals with a trap located at central node (i.e., innermost node). First, with self-similar setting composed of T fractal, initial position of the walker and location of trap, the total trapping probability of the mortal walker reduces to a function of walker’s single-step survival parameter [Formula: see text]. In more detail, the total trapping probability is expressed by the [Formula: see text]th iteration of map (scaling function) of [Formula: see text]. Based on the map, the analytical expression of total trapping probability’s dominant behavior, the mean time to trapping (MFPT) and temporal factor are obtained, which are related to random walk dimension. Last, we extend the analysis to a family of treelike regular fractals. On them, the total trapping probability is still expressed as the [Formula: see text]th iteration of the map scaling [Formula: see text]. Accordingly, dominant behavior of total trapping probability, MFPT and temporal factor are determined analytically. Both analytical results obtained on T fractal and more general treelike regular fractals show that the mean time to trapping and desired random walk dimension can be obtained by tuning the survival probability parameter [Formula: see text]. In summary, the work advances the understanding of mortal random walks on more general deterministic networks.


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):  

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.


Sign in / Sign up

Export Citation Format

Share Document