Calculating two-point resistances in distance-regular resistor networks
M. A. Jafarizadeh, R. Sufiani, S. Jafarizadeh

TL;DR
This paper presents an algorithm for calculating two-point resistances in distance-regular resistor networks using stratification and spectral distribution, providing explicit formulas and bounds for various network types.
Contribution
It introduces a novel algorithm based on stratification and spectral methods to compute resistances in distance-regular networks, including explicit formulas and bounds.
Findings
Resistances between a node and all nodes in the same stratum are equal.
Analytical formulas for two-point resistances are derived in terms of network parameters.
Bounds for resistances in strongly regular networks are established.
Abstract
An algorithm for the calculation of the resistance between two arbitrary nodes in an arbitrary distance-regular resistor network is provided, where the calculation is based on stratification introduced in \cite{js} and Stieltjes transform of the spectral distribution (Stieltjes function) associated with the network. It is shown that the resistances between a node and all nodes belonging to the same stratum with respect to the (, belonging to the -th stratum with respect to the ) are the same. Also, the analytical formulas for two-point resistances are given in terms of the the size of the network and corresponding intersection numbers. In particular, the two-point resistances in a strongly regular network are given in terms of the its parameters (). Moreover, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and properties of polymers · Semiconductor materials and interfaces
