An algorithm to calculate the transport exponent in strip geometries
F.Babalievski

TL;DR
This paper presents an efficient transfer-matrix algorithm for calculating the transport exponent in strip geometries, improving computational speed and matrix size reduction through preconditioning techniques.
Contribution
The paper introduces a novel transfer-matrix algorithm with preconditioning for the random resistor problem in strip geometries, enhancing computational efficiency.
Findings
Reduced matrix size due to spanning cluster extraction
Faster calculations of transport properties
Improved accuracy in transport exponent estimation
Abstract
An algorithm for solving the random resistor problem by means of the transfer-matrix approach is presented. Preconditioning by spanning clusters extraction both reduces the size of the conductivity matrix and speed up the calculations.
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.
