Abstract
Homophily is a concept in social network analysis that states that in a network a link is more probable, if the two individuals have a common characteristic. We study the question if an observer can assess homophily by looking at the node-link diagram of the network. We design an experiment that investigates three different layout algorithms and asks the users to estimate the degree of homophily in the displayed network. One of the layout algorithms is a classical force-directed method, the other two are designed to improve node distinction based on the common characteristic. We study how each of the three layout algorithms helps to get a fair estimate, and whether there is a tendency to over or underestimate the degree of homophily. The stimuli in our experiments use different network sizes and different proportions of the cluster sizes.
| Original language | English |
|---|---|
| Title of host publication | Graph Drawing and Network Visualization |
| Subtitle of host publication | 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers |
| Editors | E. Di Giacomo, A. Lubiw |
| Place of Publication | Dordrecht |
| Publisher | Springer |
| Pages | 489-501 |
| ISBN (Electronic) | 978-3-319-27261-0 |
| ISBN (Print) | 978-3-319-27260-3 |
| DOIs | |
| Publication status | Published - 2015 |
| Externally published | Yes |
| Event | 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015) - California State University Northridge, Los Angeles, United States Duration: 24 Sept 2015 → 26 Sept 2015 Conference number: 23 http://www.csun.edu/gd2015/ |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Volume | 9411 |
Conference
| Conference | 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015) |
|---|---|
| Abbreviated title | GD 2015 |
| Country/Territory | United States |
| City | Los Angeles |
| Period | 24/09/15 → 26/09/15 |
| Internet address |