Exact two-point resistance, and the simple random walk on the complete graph minus N edges

DOI10.1016/J.AOP.2012.09.002zbMATH Open1257.82094arXiv1206.1519OpenAlexW4247834841MaRDI QIDQ1933581FDOQ1933581

Authors: Noureddine Chair 

Publication date: 24 January 2013

Published in: Annals of Physics (Search for Journal in Brave)

Abstract: An analytical approach is developed to obtain the exact expressions for the two-point resistance, and the total effective resistance of the complete graph minus $N$ edges of the opposite vertices. These expressions are written in terms of certain numbers that we introduced which we call the Bejaia and the Pisa numbers, these numbers are the natural generalizations of the bisected Fibonacci and Lucas numbers. The correspondence between random walks and the resistor networks is then used to obtain the exact expressions for the the first passage and mean first passage times on this graph.

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

Recommendations

• scientific article; zbMATH DE number 98308
• Two-point resistances and random walks on stellated regular graphs
• Resistance networks, random walks, and network theorems
• A collection of results concerning electric resistance and simple random walk on distance-regular graphs
• Random walks and electrical resistances in products of graphs
• Some two-point resistances of the Sierpinski gasket network
• On the probabilistic representation of the free effective resistance of infinite graphs
• Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
• Two particles' repelling random walks on the complete graph

zbMATH Keywords

random walkselectrical networksexact two-point resistancegeneralized bisected Fibonacci numberstotal effective resistance

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integral transforms in science and engineering
• Title not available (Why is that?)
• Theory of resistor networks: the two-point resistance
• Some remarks on multivariate Chebyshev polynomials
• The combinatorics of random walk with absorbing barriers
• Intersection numbers on Grassmannians, and on the space of holomorphic maps from \(\mathbb{C} P^1\) into \(G_r(\mathbb{C}^n)\)
• Combinatorics

Cited In (9)

• Resistance between two vertices of almost complete bipartite graphs
• Two-point resistances and random walks on stellated regular graphs
• A physics perspective on the resistance distance for graphs
• Resistance between two nodes of a ring clique network
• The effective resistance of the \(N\)-cycle graph with four nearest neighbors
• Title not available (Why is that?)
• Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory
• On the probabilistic representation of the free effective resistance of infinite graphs
• Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix

Uses Software

• OEIS

This page was built for publication: Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges

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