scholarly journals Random walks and the effective resistance sum rules

2010 ◽  
Vol 158 (15) ◽  
pp. 1691-1700 ◽  
Author(s):  
Haiyan Chen
1993 ◽  
Vol 2 (3) ◽  
pp. 243-255 ◽  
Author(s):  
Norman L. Biggs

A graph may be regarded as an electrical network in which each edge has unit resistance. We obtain explicit formulae for the effective resistance of the network when a current enters at one vertex and leaves at another in the distance-regular case. A well-known link with random walks motivates a conjecture about the maximum effective resistance. Arguments are given that point to the truth of the conjecture for all known distance-regular graphs.


Fractals ◽  
2020 ◽  
Vol 28 (02) ◽  
pp. 2050027
Author(s):  
JIALI ZHU ◽  
LI TIAN ◽  
JIAQI FAN ◽  
LIFENG XI

The two-point resistance of fractal network has been studied extensively by mathematicians and physicists. In this paper, for a class of self-similar networks named sailboat networks, we obtain a recursive algorithm for computing resistance between any two nodes, using elimination principle, substitution principle and local sum rules on effective resistance.


1988 ◽  
Vol 102 ◽  
pp. 343-347
Author(s):  
M. Klapisch

AbstractA formal expansion of the CRM in powers of a small parameter is presented. The terms of the expansion are products of matrices. Inverses are interpreted as effects of cascades.It will be shown that this allows for the separation of the different contributions to the populations, thus providing a natural classification scheme for processes involving atoms in plasmas. Sum rules can be formulated, allowing the population of the levels, in some simple cases, to be related in a transparent way to the quantum numbers.


Author(s):  
Mikhail Menshikov ◽  
Serguei Popov ◽  
Andrew Wade
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document