Asymptotic normality of triad counts in random digraphs
From MaRDI portal
Publication:3834866
DOI10.1080/15326348908807104zbMath0678.62026OpenAlexW2006287036MaRDI QIDQ3834866
Publication date: 1989
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326348908807104
asymptotic normalitytournamentsinduced subgraphsrandom digraphincomplete U-statisticsreliability of communication networksinconsistency in tournamentssimultaneous distribution of the triad counts
Asymptotic distribution theory in statistics (62E20) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Communication, information (94A99)
Related Items
Asymptotic distributions in random graphs with applications to social networks ⋮ Hamilton cycles in a random tournament ⋮ The asymptotic distributions of generalized U-statistics with applications to random graphs