Degree distribution of shortest path trees and bias of network sampling algorithms (Q2354885)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6464838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree distribution of shortest path trees and bias of network sampling algorithms |
scientific article; zbMATH DE number 6464838 |
Statements
Degree distribution of shortest path trees and bias of network sampling algorithms (English)
0 references
27 July 2015
0 references
flows
0 references
random graph
0 references
random network
0 references
first passage percolation
0 references
hopcount
0 references
Bellman-Harris processes
0 references
stable-age distribution
0 references
bias
0 references
network algorithms
0 references
power law
0 references
mean-field model of distance
0 references
weak disorder
0 references
0 references
0 references
0 references
0.776984691619873
0 references
0.7765864133834839
0 references
0.7758982181549072
0 references
0.7432495951652527
0 references
0.7412634491920471
0 references
