Linear-time graph triples census algorithm under assumptions typical of social networks

dc.contributor.author	McEnnis, Daniel
dc.date.accessioned	2009-08-24T23:47:16Z
dc.date.available	2009-08-24T23:47:16Z
dc.date.issued	2009-08-20
dc.description.abstract	A graph triples census is a histogram of all possible sets of three vertici (called a triple) from a graph. Graph triples census have been in active use in sociology for over 50 years. The earliest paper using this approach is by Holland and Leinhardt [1]. This gives a general description of the structure of directed graphs in a fixed length vector. Since this time, this analytic tool has been widely used in social network analysis. A summary of important papers using this approach, both as end product and as a component of further analysis, are in[2].	en
dc.format.mimetype	application/pdf
dc.identifier.citation	McEnnis, D. (2009). Linear-time Graph Triples Census algorithm under assumptions typical of social networks. (Working paper 06/2009). Hamilton, New Zealand: University of Waikato, Department of Computer Science.	en
dc.identifier.issn	1177-777X
dc.identifier.uri	https://hdl.handle.net/10289/2863
dc.language.iso	en
dc.publisher	University of Waikato, Department of Computer Science	en
dc.relation.ispartofseries	Computer Science Working Papers
dc.subject	computer science	en
dc.subject	Graph Triples Census	en
dc.title	Linear-time graph triples census algorithm under assumptions typical of social networks	en
dc.type	Journal Article	en
pubs.elements-id	53915
pubs.place-of-publication	Hamilton, New Zealand	en_NZ
uow.relation.series	06/2009