Description
HW 1 – module “Networks”
Assignment 1: co-occurrence network of characters
Please choose one of the following options:
- Find an appealing book (for example, use the Project Gutenberg https://www.gutenberg.org/ to find the text), parse the textual information in order to reconstruct the co-occurrence network of characters. For example, two characters can be linked if they appear in the same paragraph. Examples for inspiration: Lord of the Rings, War and Peace, Les Miserables, etc.
- Find a screenplay from your favorite movie (there are many resources can be found by Googling, for example, https://thescriptsavant.com/free-moviescreenplays-am/). Convert the .pdf to text using any online tool and parse the textual information to reconstruct the co-occurrence network of characters, where two characters can be linked if they appear in the same scene. Scenes are usually distinguished in bold notation. Examples for inspiration: Harry Potter, Lord of the Rings, Zootopia, etc.
The only requirement here would be to choose a book or a movie with many characters (ideally more than 50). Tools for text processing were discussed on the first lecture.
- Find degree assortativity of the network and perform community detection using Louvain algorithm. Visualise the results. What can you tell from the them?
- Write the code for k-core decomposition (do not use the preprogrammed instance in networkx) and apply it to the network. What can you infer from it?
- Generate the preferential attachment (Barabasi-Albert) network with similar average degree and size. Perform same operations on this network. Describe any differences or similarities you can spot.
