Exponential random graph models for social networks theories, methods, and applications /

"Exponential random graph models (ERGMs) are a class of statistical models for social networks. They account for the presence (and absence) of network ties and so provide a model for network structure. An ERGM models a given network in terms of small local tie-based structures, such as reciproc...

Full description

Saved in:
Bibliographic Details
Corporate Author: ebrary, Inc
Other Authors: Lusher, Dean, Koskinen, Johan, Robbins, Garry
Format: Electronic eBook
Language:English
Published: Cambridge : Cambridge University Press, 2013.
Series:Structural analysis in the social sciences ; 35
Subjects:
Online Access:An electronic book accessible through the World Wide Web; click to view
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a2200000 a 4500
001 ebr10628063
003 CaPaEBR
006 m u
007 cr cn|||||||||
008 120522s2013 enka sb 001 0 eng d
010 |z  2012021034 
020 |z 9780521193566 (hardback) 
020 |z 9780521141383 (paperback) 
020 |z 9781139844321 (e-book) 
040 |a CaPaEBR  |c CaPaEBR 
035 |a (OCoLC)820434055 
050 1 4 |a HM741  |b .E96 2013eb 
082 0 4 |a 302.3  |2 23 
245 0 0 |a Exponential random graph models for social networks  |h [electronic resource] :  |b theories, methods, and applications /  |c editors, Dean Lusher, Johan Koskinen, Garry Robbins. 
260 |a Cambridge :  |b Cambridge University Press,  |c 2013. 
300 |a xxii, 336 p. :  |b ill. 
440 0 |a Structural analysis in the social sciences ;  |v 35 
504 |a Includes bibliographical references and index. 
504 |a Includes bibliographical references and index. 
505 8 |a Machine generated contents note: Introduction Dean Lusher, Johan Koskinen and Garry Robins; 1. What are exponential random graph models Garry Robins and Dean Lusher; 2. The formation of social network structure Dean Lusher and Garry Robins; 3. A simplified account of ERGM as a statistical model Garry Robins and Dean Lusher; 4. An example of ERGM analysis Dean Lusher and Garry Robins; 5. Exponential random graph model fundamentals Johan Koskinene and Galina Daragonova; 6. Dependence graphs and sufficient statistics Johan Koskinen and Galina Daragonova; 7. Social selection, dyadic covariates and geospatial effects Garry Robins and Galina Daragonova; 8. Autologistic actor attribute models Galina Daragonova and Garry Robins; 9. ERGM extensions: models for multiple networks and bipartite networks Peng Wang; 10. Longitudinal models Tom Snijders and Johan Koskinen; 11. Simulation, estimation and goodness of fit Johan Koskinen and Tom Snijders; 12. Illustrations: simulation, estimation and goodness of fit Garry Robins and Dean Lusher; 13. Personal attitudes, perceived attitudes and social structures: a social selection model Dean Lusher and Garry Robins; 14. How to close a hole: exploring alternative closure mechanisms in inter-organizational networks Alessandro Lomi and Francesca Pallotti; 15. Interdependencies between working relations: multivariate ERGMs for advice and satisfaction Yu Zhao and Olaf Rank; 16. Brain, brawn or optimism? The structure and correlates of emergent military leadership Yuval Kalish and Gil Luria; 17. An ALAAM analysis of unemployment: the dual importance of who you know and where you live Galina Daragonova and Philippa Pattison; 18. Longitudinal changes in face-to-face and text message-mediated friendship networks Tasuku Igarashi; 19. The differential impact of directors' social and financial capital on corporate interlock formation Nicholas Harrigan and Matthew Bond; 20. Comparing networks: a structural correspondence between behavioural and recall networks Eric Quintane; 21. Modelling social networks: next steps Philippa Pattison and Tom Snijders. 
520 |a "Exponential random graph models (ERGMs) are a class of statistical models for social networks. They account for the presence (and absence) of network ties and so provide a model for network structure. An ERGM models a given network in terms of small local tie-based structures, such as reciprocated ties and triangles. A social network can be thought of as being built up of these local patterns of ties, called network configurations xe "network configurations" , which correspond to the parameters in the model. Moreover, these configurations can be considered to arise from local social processes, whereby actors in the network form connections in response to other ties in their social environment. ERGMs are a principled statistical approach to modeling social networks. They are theory-driven in that their use requires the researcher to consider the complex, intersecting and indeed potentially competing theoretical reasons why the social ties in the observed network have arisen. For instance, does a given network structure occur due to processes of homophily xe "actor-relation effects:homophily" , xe "homophily" \t "see actor-relation effects" reciprocity xe "reciprocity" , transitivity xe "transitivity" , or indeed a combination of these? By including such parameters together in the one model a researcher can test these effects one against the other, and so infer the social processes that have built the network. Being a statistical model, an ERGM permits inferences about whether, in our network of interest, there are significantly more (or fewer) reciprocated ties, or triangles (for instance), than we would expect"--  |c Provided by publisher. 
533 |a Electronic reproduction.  |b Palo Alto, Calif. :  |c ebrary,  |d 2011.  |n Available via World Wide Web.  |n Access may be limited to ebrary affiliated libraries. 
650 0 |a Social networks  |x Mathematical models. 
650 0 |a Social networks  |x Research  |x Graphic methods. 
655 7 |a Electronic books.  |2 local 
700 1 |a Lusher, Dean. 
700 1 |a Koskinen, Johan. 
700 1 |a Robbins, Garry. 
710 2 |a ebrary, Inc. 
856 4 0 |u http://site.ebrary.com/lib/daystar/Doc?id=10628063  |z An electronic book accessible through the World Wide Web; click to view 
999 |c 197467  |d 197467