Data Sources and Other Web Resources - Mastering Gephi Network Visualization (2015)

Mastering Gephi Network Visualization (2015)

Appendix A. Data Sources and Other Web Resources

This appendix lists various data sources, web resources, and references which you can use as supplementary material for the best use of this book.

Data sources

Here are a number of data sources that provide network data as well as links to other data sources:

· Stanford Network Analysis Project (SNAP) has a website http://snap.stanford.edu/data/links.html with links to many network datasets (large and small).

· Mark Newman is one of the most recognized network scientists who maintains a number of network datasets at his site http://www-personal.umich.edu/~mejn/netdata/.

· Albert-László Barabási is one of the foremost network scientists and runs the Barabasi Lab at Northeastern University. More information about him can be found at http://barabasilab.com/rs-netdb.php.

· The Gephi wiki has many network datasets as well as a number of files that are already in various proprietary formats. These can be found at https://wiki.gephi.org/index.php/Datasets.

· KONECT is the Koblenz Network Collection available at the University of Koblenz-Landau. The University's site houses one of the best collections of network data, and provides easily accessible symbols that identify specific network attributes, which can be found at http://konect.uni-koblenz.de/.

Web resources

Here are just a few websites that provide practical or theoretical insights into network analysis. There are, of course, dozens more that can be discovered by a simple web search:

· The Center for Network Science (CNS) at Central European University hosts a variety of resources of interest for network scientists and practitioners at https://cns.ceu.hu/.

· The Carnegie-Mellon University houses the Center for Computational Analysis of Social and Organizational Systems (CASOS). A variety of informational and educational resources are provided that will be of interest to network analysts. More information can be found at http://www.casos.cs.cmu.edu/index.php.

· NetLogo is a site where you can run model simulations online or using the downloaded NetLogo software. Many interesting examples are available at http://ccl.northwestern.edu/netlogo/index.shtml to help you understand network growth and evolution patterns.

Import processes

For additional details on how to import datasets, refer to Chapter 4, Network Patterns, from Network Graph Analysis and Visualization with Gephi, available at https://www.packtpub.com/big-data-and-business-intelligence/network-graph-analysis-and-visualization-gephi.

Bibliography

There are hundreds of papers available on the Web dealing with various aspects of network graph analysis, as well as multiple books available in PDF versions. This list provides some of the resources I have found most useful while preparing for and writing this book:

· Barabási, A. Linked: The New Science of Networks. 2014.

· Bearman, P., Moody, J., Stovel, K. Chains Of Affection: The Structure of Adolescent Romantic and Sexual Networks. American Journal of Sociology. 2004. 44-91. Retrieved April 19, 2014.

· Easley, D., Kleinberg, J. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press. 2010.

· Kourtellis, N., Alahakoon, T., Simha, R., Iamnitchi, A., Tripathi, R. Identifying high betweenness centrality nodes in large social networks: Social Network Analysis and Mining. 899-914. Retrieved November 2, 2014.

· Lattanzi, S., Sivakumar, D. Affiliation networks. 2009.

· Newman, M. The Structure and Function of Complex Networks, SIAM Review. 2003. 167-167. Retrieved March 27, 2014.

· Steen, M. Graph Theory and Complex Networks: An Introduction. 2010.

· Tang, J., Musolesi, M., Mascolo, C., Latora, V. Temporal distance metrics for social network analysis. 2009. Retrieved March 21, 2014.

· Wimmer, A., Lewis, K. Beyond and below racial homophily: ERG models of a friendship network documented on Facebook. American Journal of Sociology. 2010. 583-642. Retrieved June 22, 2014.