Subgraphs in preferential attachment models (Q5203960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127322518, #quickstatements; #temporary_batch_1722035971323
 
(7 intermediate revisions by 6 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RAGE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FANMOD / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101205538 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1806.10406 / 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: Asymptotic behavior and distributional limits of preferential attachment graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree sequence of a scale-free random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating simple random graphs with prescribed degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clustering coefficient of a scale-free random graph / 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: Subgraphs in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree sequences and spectra of scale-free random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for Equivalence of Network Distribution Using Subgraph Counts / rank
 
Normal rank
Property / cites work
 
Property / cites work: General results on preferential attachment and clustering coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local clustering coefficients in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of vertex degrees in a scale‐free random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs and Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal subgraph structures in scale-free configuration models / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127322518 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:30, 27 July 2024

scientific article; zbMATH DE number 7141451
Language Label Description Also known as
English
Subgraphs in preferential attachment models
scientific article; zbMATH DE number 7141451

    Statements

    Subgraphs in preferential attachment models (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2019
    0 references
    0 references
    preferential attachment
    0 references
    subgraph
    0 references
    triangle
    0 references
    clustering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references