Algorithms to measure diversity and clustering in social networks through dot product graphs

DOI10.1007/978-3-642-45030-3_13zbMATH Open1329.05281OpenAlexW2134329787MaRDI QIDQ2872078FDOQ2872078

Authors: Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen 

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14199/1/14199.pdf

Recommendations

• What graphs are 2-dot product graphs?
• Random Dot Product Graph Models for Social Networks
• Directed Random Dot Product Graphs
• Dot product representations of graphs
• Finding cliques in social networks: a new distribution-free model

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cited In (2)

• What graphs are 2-dot product graphs?
• What Graphs are 2-Dot Product Graphs?

This page was built for publication: Algorithms to measure diversity and clustering in social networks through dot product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872078)