When is a scale-free graph ultra-small? (Q1685487): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59512957 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: plfit / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100954726 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.03639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: First passage percolation on random graphs with finite mean degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality for first passage percolation on sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average Distance in a Random Graph with Given Expected Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power-Law Distributions in Empirical Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple branching process: a note on convergence when the mean is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric structure of random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vulnerability of robust preferential attachment networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the uniformity and independence assumptions using the concept of fractal dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Window for Connectivity in the Configuration Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: FERROMAGNETIC FLUID AS A MODEL OF SOCIAL IMPACT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of graphs with a heavy-tailed degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs and Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in random graphs with finite variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in random graphs with finite mean and infinite variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the giant component problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of the Giant Component of a Random Graph with a Given Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the Cover: The structure of scientific collaboration networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conditionally Poissonian graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple branching process with infinite mean. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularly varying functions in the theory of simple branching processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 20:23, 14 July 2024

scientific article
Language Label Description Also known as
English
When is a scale-free graph ultra-small?
scientific article

    Statements

    When is a scale-free graph ultra-small? (English)
    0 references
    0 references
    0 references
    14 December 2017
    0 references
    random networks
    0 references
    configuration model
    0 references
    scale free
    0 references
    small world property
    0 references
    truncated power law degrees
    0 references
    typical distances
    0 references
    0 references
    0 references

    Identifiers

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