Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity

DOI10.1063/1.3077145MaRDI QIDQ3650446zbMATH OpenOpenAlexFDO

Authors M. A. Jafarizadeh, R. Sufiani, Saber Jafarizadeh

Publication date 14 December 2009

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

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

zbMATH Keywords

algebrarandom processestransforms

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Analytic circuit theory (94C05)

Abstract: Recently in cite{jss1}, the authors have given a method for calculation of the effective resistance (resistance distance) on distance-regular networks, where the calculation was based on stratification introduced in cite{js} and Stieltjes transform of the spectral distribution (Stieltjes function) associated with the network. Also, in Ref. cite{jss1} it has been shown that the resistance distances between a node $alpha$ and all nodes $$ belonging to the same stratum with respect to the $alpha$ ($$, $$ belonging to the $i$-th stratum with respect to the $alpha$) are the same. In this work, an algorithm for recursive calculation of the resistance distances in an arbitrary distance-regular resistor network is provided, where the derivation of the algorithm is based on the Bose-Mesner algebra, stratification of the network, spectral techniques and Christoffel-Darboux identity. It is shown that the effective resistance on a distance-regular network is an strictly increasing function of the shortest path distance defined on the network. In the other words, the two-point resistance $$ is strictly larger than $$. The link between the resistance distance and random walks on distance-regular networks is discussed, where the average commute time (CT) and its square root (called Euclidean commute time (ECT)) as a distance are related to the effective resistance. Finally, for some important examples of finite distance- regular networks, the resistance distances are calculated. {�f Keywords: resistance distance, association scheme, stratification, distance-regular networks, Christoffel-Darboux identity} {�f PACs Index: 01.55.+b, 02.10.Yn}

Recommendations

• Calculating two-point resistances in distance-regular resistor networks
• Evaluation of effective resistances in pseudo-distance-regular resistor networks
• Calculating effective resistances on underlying networks of association schemes
• Resistance distances on networks
• Potential Theory on Distance-Regular Graphs

Cites work

• Calculating two-point resistances in distance-regular resistor networks
• Graph cyclicity, excess conductance, and resistance deficit
• Graphs cospectral with distance-regular graphs
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 48301 (Why is no real title available?)
• scientific article; zbMATH DE number 3605240 (Why is no real title available?)
• Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
• Investigation of continuous-time quantum walk via modules of Bose–Mesner and Terwilliger algebras
• Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
• INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM
• Lattice Green's Function. Introduction
• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms

Cited in

(17)

• Exact evaluation of the resistance in an infinite face-centered cubic network
• Effective resistance is more than distance: Laplacians, simplices and the Schur complement
• On the resistance diameter of the Cartesian and lexicographic product of paths
• Two-point resistances in a family of self-similar \((x, y)\)-flower networks
• Two-point resistances in the generalized phenylenes
• Resistances between two nodes of a path network
• A recursion formula for resistance distances and its applications
• Resistance distances and the Kirchhoff index in double graphs
• Resistance distances and Kirchhoff index of graphs with an involution
• Entanglement entropy in the spinless free fermion model and its application to the graph isomorphism problem
• Two-point resistances and random walks on stellated regular graphs
• Two-point resistances in sailboat fractal networks
• Calculating two-point resistances in distance-regular resistor networks
• Calculating effective resistances on underlying networks of association schemes
• Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix
• Resistance distance in generalized core-satellite graphs
• Evaluation of effective resistances in pseudo-distance-regular resistor networks

This page was built for publication: Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity

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