Degree distribution of shortest path trees and bias of network sampling algorithms (Q2354885)

From MaRDI portal
Revision as of 13:09, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Degree distribution of shortest path trees and bias of network sampling algorithms
scientific article

    Statements

    Degree distribution of shortest path trees and bias of network sampling algorithms (English)
    0 references
    0 references
    0 references
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references