Pages that link to "Item:Q4161142"

The following pages link to Random directed graph distributions and the triad census in social networks† (Q4161142):

Displaying 13 items.

• An efficient MCMC algorithm to sample binary matrices with fixed marginals (Q998842) (← links)
• Asymptotic normality of graph statistics (Q1116572) (← links)
• Enumeration and simulation methods for 0-1 matrices with given marginals (Q1205742) (← links)
• Statistical evaluation of algebraic constraints for social networks (Q1599169) (← links)
• Complex networks: structure and dynamics (Q2406857) (← links)
• A tutorial on methods for the modeling and analysis of social network data (Q2637081) (← links)
• Dynamics of random graphs with bounded degrees (Q3301221) (← links)
• Parties and networks: Stochastic models for relationship networks (Q3320184) (← links)
• Transitivity and the path census in sociometry (Q3678547) (← links)
• Transitivity in stochastic graphs and digraphs (Q3889081) (← links)
• Asymptotic distributions in random graphs with applications to social networks (Q3989499) (← links)
• Estimating a graph from triad counts (Q4194326) (← links)
• Statistical inference for continuous‐time Markov processes with block structure based on discrete‐time network data (Q6067691) (← links)