The degree analysis of an inhomogeneous growing network with two types of vertices (Q1724044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / 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: The phase transition in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and cycles in dynamical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuity of the percolation threshold in randomly grown graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions in dynamical random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical behavior in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampled-Data Synchronization Control of Dynamical Networks With Stochastic Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5489870 / rank
 
Normal rank

Latest revision as of 05:52, 18 July 2024

scientific article
Language Label Description Also known as
English
The degree analysis of an inhomogeneous growing network with two types of vertices
scientific article

    Statements

    The degree analysis of an inhomogeneous growing network with two types of vertices (English)
    0 references
    14 February 2019
    0 references
    Summary: We consider an inhomogeneous growing network with two types of vertices. The degree sequences of two different types of vertices are investigated, respectively. We not only prove that the asymptotical degree distribution of type \(s\) for this process is power law with exponent \(2 + \left(\left(1 + \delta\right) q_s + \beta \left(1 - q_s\right)\right) / \alpha q_s\), but also give the strong law of large numbers for degree sequences of two different types of vertices by using a different method instead of Azuma's inequality. Then we determine asymptotically the joint probability distribution of degree for pairs of adjacent vertices with the same type and with different types, respectively.
    0 references
    growing random graphs
    0 references
    inhomogeneous random graph
    0 references
    0 references

    Identifiers

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