====== 2015/16: project 2 ======


Select a data set - 'First-come, first-served':

Master program:
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/dic/Wordnet/Wordnet.zip|Wordnet]]; [[http://wordnet.princeton.edu/|Princeton]]
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/viszards.02/daysT.zip|Reuters Terror News]] (**Nikola Hrelja**)
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/dic/fa/FreeAssoc.htm|The University of South Florida word association, rhyme, and word fragment norms]]
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/2mode/theyrule.htm|They rule]]
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/GED/franklin.zip|Franklin]]
  - [[http://www.informatik.uni-freiburg.de/~cziegler/BX/|Book-Crossing Dataset]]
  - [[http://webdocs.cs.ualberta.ca/~lindek/downloads.htm|Thesaurus of similar words/Dependency Triples]]
  - Game of thrones: [[http://qz.com/650796/mathematicians-mapped-out-every-game-of-thrones-relationship-to-find-the-main-character/|News]], [[https://www.macalester.edu/~abeverid/thrones.html|data]] (**Naja Bohanec**)












Phd program:
  - [[http://cid.econ.ucdavis.edu/wixd.html|World Import and Export Data]]; {{pajek:data:zip:nberwt.zip|NBER world trade, 1962-2000}}; {{pajek:data:zip:nberwt99.zip|NBER world trade 1999}}  (**Tanja Knific**)
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/KEDS/KEDS.htm|KEDS]] / Levant
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/GD/GD.htm|Internet Movies Database]] GD05
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/patents/Patents.htm|US patents]], [[https://sites.google.com/site/patentdataproject/Home|New data 1976-2006]] (**Miha Matjašič**)
  - [[http://vlado.fmf.uni-lj.si/pub/networks/data/bib/SN5.zip|SN5]] - citation network from Social networks bibliography (2008)(**Anka Slana**) 
and **send the reservation to my e-mail**.

For the selected network:
  * determine basic network characteristics (directed/undirected; weights?; number of nodes, number of links, number of components; largest degree, diameter, acyclic?, ...).
  * draw the degree (in directed also indegree and outdebree) distribution. List 20 nodes of largest degree. 
  * determine the most important nodes.
  * determine some interesting subnetworks of your network and draw them. Interpret the results.

Write a report.