Exact two-point resistance, and the simple random walk on the complete graph minus N edges
From MaRDI portal
(Redirected from Publication:1933581)
Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
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 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.
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
Cites work
- scientific article; zbMATH DE number 3829916 (Why is no real title available?)
- scientific article; zbMATH DE number 3160434 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- Combinatorics
- Integral transforms in science and engineering
- Intersection numbers on Grassmannians, and on the space of holomorphic maps from \(\mathbb{C} P^1\) into \(G_r(\mathbb{C}^n)\)
- Some remarks on multivariate Chebyshev polynomials
- The On-Line Encyclopedia of Integer Sequences
- The combinatorics of random walk with absorbing barriers
- Theory of resistor networks: the two-point resistance
Cited in
(9)- The effective resistance of the \(N\)-cycle graph with four nearest neighbors
- Resistance between two vertices of almost complete bipartite graphs
- Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix
- Two-point resistances and random walks on stellated regular graphs
- 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
- scientific article; zbMATH DE number 98308 (Why is no real title available?)
- A physics perspective on the resistance distance for graphs
- Resistance between two nodes of a ring clique network
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)