{ "metadata": { "name": "", "signature": "sha256:eb3e9b57029cc2670a2bf12d5e4a17d9a8845980209ab9cadd338765c0655ad7" }, "nbformat": 3, "nbformat_minor": 0, "worksheets": [ { "cells": [ { "cell_type": "heading", "level": 1, "metadata": {}, "source": [ "
Structural Analysis and Visualization of Networks
" ] }, { "cell_type": "heading", "level": 2, "metadata": {}, "source": [ "
Home Assignment #2: Network models
" ] }, { "cell_type": "heading", "level": 3, "metadata": {}, "source": [ "
Student: *{Your Name}*
" ] }, { "cell_type": "heading", "level": 4, "metadata": {}, "source": [ "
\n", "General Information" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "**Due Date:** 18.02.2015 23:59
\n", "**Late submission policy:** -0.2 points per day
\n", "\n", "\n", "Please send your reports to and with message subject of the following structure:
**[HSE Networks 2015] *{LastName}* *{First Name}* HA*{Number}***\n", "\n", "Support your computations with figures and comments.
\n", "If you are using IPython Notebook you may use this file as a starting point of your report.
\n", "
\n", "
" ] }, { "cell_type": "heading", "level": 2, "metadata": {}, "source": [ "Problems" ] }, { "cell_type": "heading", "level": 3, "metadata": {}, "source": [ "Task 1" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Consider Barabasi and Albert dynamical grow model. Two main ingredients of this model are *network growing* and *prefferential attachment*. Implement two restricted B&A-based models:\n", "
\n", "\n", "**Model A**\n", "
\n", "Lack of prefferential attachment, that is at each time-step form edges uniformly at random while network keeps growing.\n", "\n", "**Model B**\n", "
\n", "Lack of growing, that is fix total number of nodes, on each time-step randomly choose one and form edges with prefferential attachment.\n", "
\n", "\n", "1. Generate networks according to the models above ($N > 1000$ nodes)\n", "2. Compute CDF/PDF, describe the distribution and compute\\describe its properties.\n", "3. Illustate the following dependencies: \n", " * average path length to the number of nodes\n", " * average clustering coefficient to the number of nodes\n", " * average node degee to the nodes \"age\"\n", "4. Is scale-free property conserved in these models?\n", "\n", "Analyse results with respect to various parameter settings" ] }, { "cell_type": "heading", "level": 3, "metadata": {}, "source": [ "
\n", "Task 2" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Consider the following \"Vertex copying model\" of growing network.\n", "\n", "At every time step a random vertex from already existing vertices is selected and duplicated together with all edges, such that every edge of the vertex\n", "* is copied with probability $q$\n", "* is rewired to any other randomly selected vertex with probability $1-q$\n", "\n", "\n", "Starting state is defined by some small number of randomly connected vertices.\n", "\n", "The model can generate both directed and undirected networks.\n", "\n", "1. Generate graphs based on the model ($N > 1000$ nodes)\n", "2. Compute CDF/PDF, describe the distribution and compute\\describe its properties.\n", "3. Illustate the following dependencies: \n", " * average path length to the number of nodes\n", " * average clustering coefficient to the number of nodes\n", " * average node degee to the nodes \"age\"\n", " \n", "Analyse results with respect to various parameter settings" ] } ], "metadata": {} } ] }