A quantitative central limit theorem for the effective conductance on the discrete torus
Antoine Gloria, James Nolen

TL;DR
This paper proves a quantitative central limit theorem for the effective conductance on a discrete torus, showing it behaves like an average of conductances with precise variance asymptotics.
Contribution
It provides the first precise asymptotic description of the variance of the effective conductance in a random conductance model on a discrete torus.
Findings
Effective conductance follows a CLT as system size grows.
Variance of effective conductance is asymptotically characterized.
Conductance behaves like a spatial average with logarithmic corrections.
Abstract
We study a random conductance problem on a -dimensional discrete torus of size . The conductances are independent, identically distributed random variables uniformly bounded from above and below by positive constants. The effective conductance of the network is a random variable, depending on , and the main result is a quantitative central limit theorem for this quantity as . In terms of scalings we prove that this nonlinear nonlocal function essentially behaves as if it were a simple spatial average of the conductances (up to logarithmic corrections). The main achievement of this contribution is the precise asymptotic description of the variance of .
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
TopicsAdvanced Mathematical Modeling in Engineering · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods
