Closure , connectivity and degrees : New specifications for exponential random graph ( p * ) models for directed social networks

@inproceedings{Robins2006ClosureC,
  title={Closure , connectivity and degrees : New specifications for exponential random graph ( p * ) models for directed social networks},
  author={Garry Robins and Pip Pattison and Peng Wang},
  year={2006}
}
The new higher order specifications for exponential random graph models introduced by Snijders, Pattison, Robins & Handcock (2006) exhibit dramatic improvements in model fit compared with the commonly used Markov random graphs. Snijders et al briefly presented versions of these new specifications for directed graphs, in particular a directed alternating ktriangle parameter, based on closure of multiple two-paths. In this paper, we present a number of additional higher order parameters for… CONTINUE READING
8 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Statistical models for social networks: Degeneracy and inference

  • M. S. Social Network. Social Networks. Handcock
  • In
  • 2002
Highly Influential
9 Excerpts

Multiple networks: Comparing QAP and exponential random graph (p*) models

  • Y. Zhao, G. L. Robins
  • Presentation at Sunbelt International Social…
  • 2006
Highly Influential
3 Excerpts

Examining newcomers’ socialization into an organization

  • A. Pane
  • Unpublished Doctor of Psychology thesis…
  • 2006
2 Excerpts

Pnet: a program for the simulation and estimation of exponential random graph models. University of Melbourne

  • P. Wang, G. Robins, P. Pattison
  • 2006

An Introduction to Random Graphs, Dependence Graphs, and p

  • S. Wasserman, G. L. Robins
  • (Eds.) Models and Methods in Social
  • 2005
2 Excerpts

Similar Papers

Loading similar papers…