Mean commute time for random walks on hierarchical scale-free networks (Q4905090)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mean commute time for random walks on hierarchical scale-free networks |
scientific article; zbMATH DE number 6136452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mean commute time for random walks on hierarchical scale-free networks |
scientific article; zbMATH DE number 6136452 |
Statements
Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks (English)
0 references
15 February 2013
0 references
networks with scale-free topologies
0 references
mean effective resistance
0 references
random-walk issues
0 references
two-parameter scale-free networks
0 references
small world phenomenon
0 references
pseudofractal properties
0 references
mean commute times
0 references
flowers
0 references
Erdos-Renyi random graphs
0 references
0.7427049875259399
0 references
0.7286994457244873
0 references
0.7230273485183716
0 references
0.7165833711624146
0 references
