Transitivity in stochastic graphs and digraphs (Q3889081): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: DISCUSSION PAPER: RECENT PROGRESS IN STAGRAPHICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Competition Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey sampling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating a graph from triad counts / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE METHOD OF PAIRED COMPARISONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the method of paired comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random directed graph distributions and the triad census in social networks† / rank
 
Normal rank

Latest revision as of 09:30, 13 June 2024

scientific article
Language Label Description Also known as
English
Transitivity in stochastic graphs and digraphs
scientific article

    Statements

    Transitivity in stochastic graphs and digraphs (English)
    0 references
    0 references
    1980
    0 references
    stochastic graph models
    0 references
    transitivity
    0 references
    random network
    0 references
    induced subgraphs
    0 references
    structure inference
    0 references
    transitivity index
    0 references
    asymmetric digraph
    0 references

    Identifiers