First hitting times of simple random walks on graphs with congestion points (Q1415070): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | First hitting times of simple random walks on graphs with congestion points |
scientific article |
Statements
First hitting times of simple random walks on graphs with congestion points (English)
0 references
3 December 2003
0 references
Consider a lollipop \(P\) (which consists of a circle with \(2n\) vertices and a line segment with \(n+1\) vertices) and a dumbbell \(Q\) (consisting of a line segment with \(n+1\) vertices and two circles each with \(2n\) vertices). Using group representations the author gives explicit formulas for the probability generating functions (pgf) of the first hitting times of simple random walks on \(P\) and \(Q\), resp. The same arguments can be modified to derive pgf on necklace graphs which consist of several circles and some lines. Random walks on such graphs can model computer networks and traffic congestion problems in terms of hitting times.
0 references
hitting times
0 references
simple random walk on graphs
0 references