Class 10: Introduction to CINET Using CINET for network analysis and visualization Network Science: Introduction to CINET 2015 Prof. Boleslaw K. Szymanski.

Slides:



Advertisements
Similar presentations
Short introduction to the use of PEARL General properties First tier assessments Higher tier assessments Before looking at first and higher tier assessments,
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
CREATING A PAYMENT REQUEST FOR VENDOR IN SYSTEM
CSE 5243 (AU 14) Graph Basics and a Gentle Introduction to PageRank 1.
Analysis and Modeling of Social Networks Foudalis Ilias.
Corporate Property Automated Information System (CPAIS) Macro Walkthrough Guide for Excel Version 2003.
© 2010 Blackboard Inc. All rights reserved. Blackboard Learn 9.1 SafeAssign.
Analysis of Social Media MLD , LTI William Cohen
Information Retrieval Lecture 8 Introduction to Information Retrieval (Manning et al. 2007) Chapter 19 For the MSc Computer Science Programme Dell Zhang.
Chapter 18 - Data sources and datasets 1 Outline How to create a data source How to use a data source How to use Query Builder to build a simple query.
Smoothing Linework June 2012, Planetary Mappers Meeting.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
Network Statistics Gesine Reinert. Yeast protein interactions.
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Advanced Topics in Data Mining Special focus: Social Networks.
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
UCSD AP On-Line RECRUIT Training Applicants Screens.
Graphing with Excel: Graphing Made Easy Mac 2008 Version.
WorkPad 4 Quick Start WorkPad 4 Quick Start  Business Optix brings the rigor and discipline of business modelling and design into.
Star Rays Website User Guide. These screens demonstrate that how to register on Star Rays web site to avail to view the Star Rays inventory. User Registration.
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Decomposing Networks and Polya Urns with the Power of Choice Joint work with Christos Amanatidis, Richard Karp, Christos Papadimitriou, Martha Sideri Presented.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
PRIOS ARA Limited Agent User Instructions PRIOS ARA Limited Agent User Instructions Professional Repossessors Interactive Operating System.
Modeling Information Diffusion in Networks with Unobserved Links Quang Duong Michael P. Wellman Satinder Singh Computer Science and Engineering University.
by Chris Brown under Prof. Susan Rodger Duke University June 2012
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
An Introduction to Grants.gov Sponsored Programs Office February 22,
ENTERING ELIGIBLE ENERGY RESOURCE APPLICATIONS IN DELAFILE Version 2.0 August 25, 2015.
Efficient Identification of Overlapping Communities Jeffrey Baumes Mark Goldberg Malik Magdon-Ismail Rensselaer Polytechnic Institute, Troy, NY.
Chapter 8: Writing Graphical User Interfaces Visual Basic.NET Programming: From Problem Analysis to Program Design.
Introduction to HTML Reporting with SAS Welcome to HTML reporting with SAS Sam Gordji, Weir 107.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Chapter 3. Community Detection and Evaluation May 2013 Youn-Hee Han
SP5 - Neuroinformatics SynapsesSA Tutorial Computational Intelligence Group Technical University of Madrid.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
1 Chapter 20 – Data sources and datasets Outline How to create a data source How to use a data source How to use Query Builder to build a simple query.
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Computer Simulation. The Essence of Computer Simulation A stochastic system is a system that evolves over time according to one or more probability distributions.
Class 3: Introduction to CINET
Select (drop-down list) Inputs. Insert/Form/List Menu.
Class Builder Tutorial Presented By- Amit Singh & Sylendra Prasad.
Percolation in self-similar networks PRL 106:048701, 2011
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. Fast.
SEQUENCES. Introduction The symbols and words of Sequences n is a symbol used all the time in sequences n simply represents a counting number.
SP5 - Neuroinformatics 3DSomaMS Tutorial Computational Intelligence Group Technical University of Madrid.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
From digital to craft: How to make a data matrix with SNS data There are many applications that allow its users to visualize different networks directly.
T3/Tutorials: Data Submission Uploading genotype experiments
EE327 Final Representation Qianyang Peng F
Network (graph) Models
T3/Tutorials: Data Submission
Random Walk for Similarity Testing in Complex Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Principles of Network Analysis
Minimum Spanning Tree 8/7/2018 4:26 AM
Department of Computer Science University of York
Analysis models and design models
Peer-to-Peer and Social Networks
You will need to click the login button here
Introduction to One View Service Center (OVSC)
Network Models Michael Goodrich Some slides adapted from:
Presentation transcript:

Class 10: Introduction to CINET Using CINET for network analysis and visualization Network Science: Introduction to CINET 2015 Prof. Boleslaw K. Szymanski Konstantin Kuzmin

CINET Hands-on Labs Overview Exercise 1 Review different random graph generators available in CINET Generate ER random graphs Exercise 2 Experiment with random graph generation facility of CINET Find the smallest probability value to satisfy a given property Exercise 3 Compare the structural measures of an Erdős-Renyi (ER) random network with those of a Barabasi-Albert (preferential attachment based) scale-free (SF) network Exercise 4 Compare the structural properties of a network with its shuffled version Network Science: Introduction to CINET

CINET Links Useful links Main CINET page Granite page Stanford Network Analysis Project Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 1 Objectives In this exercise Review random graph models available in CINET Practice random graph generation Generate three random graphs using the Erdős-Renyi (ER) model with different probability values. For each of the three graphs, compute three network measures. Fill in the following table: Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 1 Procedure Follow these steps Under the “Network Generators” tab, CINET has a “+ New Network Generator” button which allows a user to specify the generator name and select a generator from the list. For this exercise please use the “G(n, p) random graph” choice that generates an ER model random undirected graph with a specified number of nodes (n) and edge probability (p). After you generate a random graph, you need to add it to the CINET repository of graphs so that you can use CINET to compute all the required measures: a)Click on its “View Report” link to see the output files generated. b)Download and unzip the output. c)Rename the output.out file as output.nx. (The extension “.nx” indicates a file that can be processed by CINET using NetworkX. d)Use the “+New Network” tab (in the “Networks” tab of Granite) to upload the generated network and do the following: Select the option “Directly upload a file”. Click on “Done”. Choose the file (output.nx) to upload. Provide the requested details for the network (e.g., name, type) and select the Visible option as “Only Me”. (This will make the network private to you.) Click on “Save”. The uploaded network will be seen in the “Networks” list. Now, use the “Network Analysis” button to compute each necessary measure for the added network. Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 1 Outcome Exercise review What random graph models are available in CINET? What parameters are available for ER networks? How do they affect the networks to be generated? Network Science: Introduction to CINET

Experiment with random graph generation facility of CINET Consider random graphs generated using the Erdős-Renyi model on 1,000 nodes. As we increase the edge probability p, the number of edges in the generated graph increases. The goal of this exercise is to experiment with various probability values and find the smallest probability value at which the generated graph has a certain property. Perform the exercise for three properties and fill in the following table: CINET Hands-on Labs Exercise 2 Objectives In this exercise Network Science: Introduction to CINET PropertyProbability p The graph has a giant component with at least 900 nodes The graph is connected The graph has no bridge edges

CINET Hands-on Labs Exercise 2 Procedure Follow these steps First choose a graph property; let us call it P. You need to try various edge probability values and find the smallest value. (If you are familiar with binary search, you can do this in a systematic manner.) For each probability value p, you need to carry out the following steps. 1.Generate the random graph with edge probability p. 2.Add it to the list of networks in CINET. 3.Compute the measure corresponding to property P. Depending on the value of the measure obtained in Step 3 above, you must increase or decrease the value of p appropriately for the next attempt. Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 3 Objectives In this exercise Compare the structural measures of an Erdős-Renyi (ER) random network with those of a Barabasi-Albert (preferential attachment based) scale-free (SF) network Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 3 Procedure Follow these steps Choose the same number of nodes (say, 1,000) in both graphs. Choose the parameters (probability of each edge for the ER model and the number of edges attached to each new node for the SF model) so that both graphs have (approximately) the same number of edges. Generate two graphs using CINET and upload them. (We will use G1 and G2 to the ER graph and the SF graph respectively.) Compute and compare the degree distributions of G1 and G2. Compute and compare the clustering coefficient distributions of G1 and G2. Compute and compare the numbers of articulation points of G1 and G2. Compute and compare the numbers of bridge edges of G1 and G2. Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 4 Objectives In this exercise Compare the structural properties of a network with its shuffled version We will indicate how a shuffled network can be generated for one value of the fraction f of the number of edges. You can try different values of f. Network Science: Introduction to CINET

CINET Hands-on Labs Exercise 4 Procedure Follow these steps Choose a network from the list of available networks in CINET. (Let G1 denote this network.) In the “Measures” tab of CINET, choose “Shuffle (switch) edges”. When you start the analysis (by clicking on the “Analyze” button), the system will ask you to input the fraction f of the number of edges to be switched. To begin with, choose the fraction 0.1. (You can repeat all of the steps for other values of f.) Generate the shuffled version G2 of G1 and upload G2 to CINET. Compute and compare the degree distributions of G1 and G2. Compute and compare the clustering coefficient distributions of G1 and G2. Compute and compare the numbers of articulation points of G1 and G2. Compute and compare the numbers of bridge edges of G1 and G2. Network Science: Introduction to CINET