Projects

Deadline: June 8th, 2019

Project 1

Solve the problem with your number with the Monte Carlo method. If you are able to solve it also theoretically compare both results.

Project 2

Select an undirected labeled network with at least 50 nodes and average degree at least 4. Determine the graphlet spectra for its nodes. On their basis construct a dissimilarity between nodes and use it to cluster the nodes.

Project 3

On a network of your choice either with at least 30 nodes

  • Compute Geary's and Moran's measure.

or

  • Make a CUG or QAP test.

Interpret the obtained results.

ru/hse/snet/stu.txt · Last modified: 2019/06/02 01:09 by vlado
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki