The effective resistance of the N-cycle graph with four nearest neighbors

DOI10.1007/S10955-014-0916-ZMaRDI QIDQ2016572zbMATHOpenAlexFDO

Authors Noureddine Chair

Publication date 20 June 2014

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.5628

zbMATH Keywords

Kirchhoff indexeffective resistancesimple random walkfirst and mean first passage timeresistor electrical network

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Analytic circuit theory (94C05)

Abstract: The exact expression for the effective resistance between any two vertices of the $N$-cycle graph with four nearest neighbors $C_N(1,2)$, is given. It turns out that this expression is written in terms of the effective resistance of the $N$-cycle graph $C_N$, the square of the Fibonacci numbers, and the bisected Fibonacci numbers. As a consequence closed form formulas for the total effective resistance, the first passage time (FPT), and the mean first passage time (MFPT) for the simple random walk on the the $N$-cycle graph with four nearest neighbors are obtained. Finally, a closed form formula for the effective resistance of $C_N(1,2)$ with all first neighbors removed is obtained.

Recommendations

• Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
• Effective graph resistance
• scientific article; zbMATH DE number 98308
• Kirchhoff indexes of a network
• Random walks and the effective resistance sum rules

Cites work

• scientific article; zbMATH DE number 3829916 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 48688 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3061533 (Why is no real title available?)
• Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
• Integral transforms in science and engineering
• Random walks and the effective resistance of networks
• The electrical resistance of a graph captures its commute and cover times
• Theory of resistor networks: the two-point resistance

Cited in

(4)

• On the average hitting times of the squares of cycles
• Two-point resistances and random walks on stellated regular graphs
• On the average hitting times of \(\operatorname{Cay} (\mathbb{Z}_N, \{+1, +2\})\)
• A physics perspective on the resistance distance for graphs

This page was built for publication: The effective resistance of the \(N\)-cycle graph with four nearest neighbors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016572)