# Electrical resistance of expander graphs

Let $G$ be a $d$-regular expander graph. What is the electrical resistance of $G$? Is it a constant independent of the number of nodes $n$ once $d$ is large enough? If not, can we give matching upper and lower bounds in terms of $n,d$?

• How does electrical resistance end up in graph theory? – Raphael Jul 7 '13 at 17:53
• Electrical resistance is a property of the graph. Roughly speaking, it measures its connectivity. It is also connected to hitting and commute times, hence the random walks tag. – maartje Jul 7 '13 at 17:57
• Have you tried generating some examples and plotting the resistance as a function of $n,d$ for several different types of expander graphs? You might want to edit your question to include what you've tried so far. – D.W. Jul 7 '13 at 22:16
• Please define your terms. What is the definition of electrical resistance of an edge/node/subgraph/graph? What is an expander graph? And what does it mean for an an expander graph to be d-regular? – Wandering Logic Jul 7 '13 at 23:16
• here is a cool new simons institute article on the basic theory around this subject, some of it very advanced/deep Network Solutions by Klarreich, its all about the graph Laplacian – vzn Jul 10 '13 at 19:10

Next time you ask a question you should try to google it first. I googled "electrical resistance expander graph" and the very first result was a paper stating that $d$-regular graphs have resistance $\Theta(1/d)$.