Length of optimal path in random networks with strong disorder (Q1412920): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shlomo Havlin / rank
Normal rank
 
Property / author
 
Property / author: H. Eugene Stanley / rank
Normal rank
 
Property / author
 
Property / author: Shlomo Havlin / rank
 
Normal rank
Property / author
 
Property / author: H. Eugene Stanley / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q111628966 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.physa.2003.08.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085650304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank

Latest revision as of 12:59, 6 June 2024

scientific article
Language Label Description Also known as
English
Length of optimal path in random networks with strong disorder
scientific article

    Statements

    Length of optimal path in random networks with strong disorder (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2003
    0 references
    0 references
    random weights
    0 references
    random graphs
    0 references
    scale-free networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references