Markov chain Monte Carlo exact inference for analysing social networks data

McDonald, John W., Smith, Peter W.F. and Forster, Jonathan J. (2007) Markov chain Monte Carlo exact inference for analysing social networks data Social Networks, 29, (1), pp. 127-136. (doi:10.1016/j.socnet.2006.04.003).


Full text not available from this repository.


A test of reciprocity is often performed by analysts of social network data. This test corresponds to testing whether a parameter in an exponential family model for the adjacency matrix is zero. The uniformly most powerful unbiased test compares the observed number of mutual relations in the social network to its exact conditional distribution. As this distribution is typically only known to a constant of proportionality, Metropolis-Hastings algorithms have been proposed for generating from this distribution in order to perform Monte Carlo exact inference. Statistics based on the triad census are often used to test for the presence of group structure in a network. We show how one of the proposed Metropolis-Hastings algorithms can be modified to generate from the conditional distribution of the triad census given the in-degrees, the out-degrees and the number of mutual dyads. We compare the results of this algorithm with those obtained by using various approximations.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.socnet.2006.04.003
ISSNs: 0378-8733 (print)
Keywords: adjacency matrices, exact conditional test, markov chain monte carlo, metropolis–hastings algorithm, reciprocity, triad census
ePrint ID: 13985
Date :
Date Event
5 January 2005Submitted
5 January 2007Published
Date Deposited: 05 Jan 2005
Last Modified: 16 Apr 2017 23:48
Further Information:Google Scholar

Actions (login required)

View Item View Item