MO412 - 1s2023

Random graphs are a type of mathematical object used to model complex systems, such as social networks on the internet. In a random graph with n vertices and edge probability p, the typical distance between two  vertices  follows a known property called small world phenomena which implies that: A) The distances between all pairs of vertices will be the same. B) The distances between vertices will follow a normal distribution. C) The distances between vertices will be roughly proportional to log(n). D) The distances between vertices will be randomly distributed. E) None of the above. Original idea by: Arthur Hendricks.

Consider the Following Applications of the BFS Algorithm starting at the Orange Node: Which examples are applying BFS the wrong way: A) B and D B) A and D C) B and C D) Only C E) None of the above Original idea by: Arthur Hendricks.

Hey There, this Blog was created to upload exercicies of Network Science Class - MO412A 1s2023. Campinas, São Paulo, Brazil.   Arthur Hendricks :)

Consider the following examples of Bipartite Networks: I - In the iFood Delivery Network, a set of nodes corresponding to Motorcycle Couries (U) and the other to Customers (V). II - In the Gmail Spam Network, a set of nodes corresponding to E-mails (U) and the other to Spam List (V). III - In the Spotify Playlist Network, a set of nodes corresponding to Playlists (U) and the other to Musics (V). IV - In the LinkedIn Job Opportunities Network, a set of nodes corresponding to Recruiters (U) and the other to Employment Opportunities (V). The only affirmations above that are  false  are: A) III and IV  B) II and IV C) I and III D) Only II E) None of the above Original idea by: Arthur Hendricks.