Maximum hitting time for random walks on graphs (Q3970909): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.3240010303 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968695868 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to covering problems for random walks on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expected hitting times for a random walk on a connected graph / rank | |||
Normal rank | |||
Latest revision as of 08:51, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum hitting time for random walks on graphs |
scientific article |
Statements
Maximum hitting time for random walks on graphs (English)
0 references
25 June 1992
0 references
random walk
0 references
extremal graph
0 references
