Mining and Searching Massive Graphs (Networks)

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

Cpt S 223 – Advanced Data Structures Graph Algorithms: Introduction
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Introduction to Network Theory: Modern Concepts, Algorithms
Analysis and Modeling of Social Networks Foudalis Ilias.
CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Advanced Topics in Data Mining Special focus: Social Networks.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
CS 206 Introduction to Computer Science II 11 / 11 / Veterans Day Instructor: Michael Eckmann.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Mining and Searching Massive Graphs (Networks) Introduction and Background Lecture 1.
Advanced Topics in Data Mining Special focus: Social Networks.
Graph, Search Algorithms Ka-Lok Ng Department of Bioinformatics Asia University.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
Data Mining for Complex Network Introduction and Background.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Computer Science 1 Web as a graph Anna Karpovsky.
Graph Essentials Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Graph Essentials Networks A network is a graph. – Elements of the network.
Social Media Mining Graph Essentials.
Models of Influence in Online Social Networks
The Erdös-Rényi models
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
Information Networks Introduction to networks Lecture 1.
Network properties Slides are modified from Networks: Theory and Application by Lada Adamic.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Lectures 6 & 7 Centrality Measures Lectures 6 & 7 Centrality Measures February 2, 2009 Monojit Choudhury
COM1721: Freshman Honors Seminar A Random Walk Through Computing Lecture 2: Structure of the Web October 1, 2002.
Vertices and Edges Introduction to Graphs and Networks Mills College Spring 2012.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Mathematics of Networks (Cont)
Data Structures & Algorithms Graphs
Complex Networks: Models Lecture 2 Slides by Panayiotis TsaparasPanayiotis Tsaparas.
Web Intelligence Complex Networks I This is a lecture for week 6 of `Web Intelligence Example networks in this lecture come from a fabulous site of Mark.
Chapter 10 Graph Theory Eulerian Cycle and the property of graph theory 10.3 The important property of graph theory and its representation 10.4.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
Week 1 – Introduction to Graph Theory I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
341- INTRODUCTION TO BIOINFORMATICS Overview of the Course Material 1.
Models and Algorithms for Complex Networks Introduction and Background Lecture 1.
Clusters Recognition from Large Small World Graph Igor Kanovsky, Lilach Prego Emek Yezreel College, Israel University of Haifa, Israel.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Class 2: Graph Theory IST402. Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory THE BRIDGES OF.
Copyright © Curt Hill Graphs Definitions and Implementations.
Informatics tools in network science
Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)
Class 2: Graph Theory IST402.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Graph clustering to detect network modules
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Introduction CS 765: Complex Networks
Applications of graph theory in complex systems research
Network analysis.
Network Science: A Short Introduction i3 Workshop
Prof. Paolo Ferragina, Algoritmi per "Information Retrieval"
Discrete Mathematics and its Applications Lecture 1 – Graph Theory
Prof. Paolo Ferragina, Algoritmi per "Information Retrieval"
Modelling and Searching Networks Lecture 2 – Complex Networks
Advanced Topics in Data Mining Special focus: Social Networks
Presentation transcript:

Mining and Searching Massive Graphs (Networks) Introduction and Background Lecture 1

Welcome! Instructor: Ruoming Jin Homepage: www.cs.kent.edu/~jin/ Office: 264 MCS Building Email: jin@cs.kent.edu Office hour: Tuesdays and Thursdays (10:30AM to 11:00AM) or by appointment

Overview Homepage: www.cs.kent.edu/~jin/graph mining.html Time: 11:00-12:15PM Tuesdays and Thursdays Place: MSB 276 Prerequisite: Preferred: Machine Learning, Algorithms, and Data Structures Preferred Math: Probability, Linear Algebra, Graph Theory

Course overview The course goal First of all, this is a research course, or a special topic course. There is no textbook and even no definition what topics are supposed to under the course name But we will try to understand the underlying (math and cs) techniques! Learning by reading and presenting some recent interesting papers! Thinking about interesting ideas (don’t forget this is a research course!)

Topics 1. Basic Math for Massive Graph Mining Probability (Classical Random Graph Theory) Linear Algebra (Eigenvalue/Eigenvector, SVD) Markov Chain and Random Walk 2. Statistical Properties of Real Networks 3. Models for Networks 4. Process and Dynamics on the Network

Requirement Each of you will have two presentations Project Select a topic and review at least four papers Develop a new idea on this topic Surplus: do an implementation exam Final term paper on the survey topic, your idea and possible implementation/evaluation Final Grade: 50% presentations, 40% project, and 10% class participation

What is a network? Network: a collection of entities that are interconnected with links. people that are friends computers that are interconnected web pages that point to each other proteins that interact

Graphs In mathematics, networks are called graphs, the entities are nodes, and the links are edges Graph theory starts in the 18th century, with Leonhard Euler The problem of Königsberg bridges Since then graphs have been studied extensively.

Networks in the past Graphs have been used in the past to model existing networks (e.g., networks of highways, social networks) usually these networks were small network can be studied visual inspection can reveal a lot of information

Networks now More and larger networks appear Products of technological advancement e.g., Internet, Web Result of our ability to collect more, better, and more complex data e.g., gene regulatory networks Networks of thousands, millions, or billions of nodes impossible to visualize

The internet map

Understanding large graphs What are the statistics of real life networks? Can we explain how the networks were generated? What else? A still very young field! (What is the basic principles and what those principle will mean?)

Measuring network properties Around 1999 Watts and Strogatz, Dynamics and small-world phenomenon Faloutsos3, On power-law relationships of the Internet Topology Kleinberg et al., The Web as a graph Barabasi and Albert, The emergence of scaling in real networks

Real network properties Most nodes have only a small number of neighbors (degree), but there are some nodes with very high degree (power-law degree distribution) scale-free networks If a node x is connected to y and z, then y and z are likely to be connected high clustering coefficient Most nodes are just a few edges away on average. small world networks Networks from very diverse areas (from internet to biological networks) have similar properties Is it possible that there is a unifying underlying generative process?

Generating random graphs Classic graph theory model (Erdös-Renyi) each edge is generated independently with probability p Very well studied model but: most vertices have about the same degree the probability of two nodes being linked is independent of whether they share a neighbor the average paths are short

Modeling real networks Real life networks are not “random” Can we define a model that generates graphs with statistical properties similar to those in real life? a flurry of models for random graphs

Processes on networks Why is it important to understand the structure of networks? Epidemiology: Viruses propagate much faster in scale-free networks Vaccination of random nodes does not work, but targeted vaccination is very effective

The future of networks Networks seem to be here to stay More and more systems are modeled as networks Scientists from various disciplines are working on networks (physicists, computer scientists, mathematicians, biologists, sociologist, economists) There are many questions to understand.

Basic Mathematical Tools Graph theory Probability theory Linear Algebra

Graph Theory Graph G=(V,E) V = set of vertices E = set of edges 2 1 3 5 4 undirected graph E={(1,2),(1,3),(2,3),(3,4),(4,5)}

Graph Theory Graph G=(V,E) V = set of vertices E = set of edges 2 1 3 5 4 directed graph E={‹1,2›, ‹2,1› ‹1,3›, ‹3,2›, ‹3,4›, ‹4,5›}

Undirected graph degree d(i) of node i degree sequence 2 degree d(i) of node i number of edges incident on node i 1 degree sequence [d(1),d(2),d(3),d(4),d(5)] [2,2,2,1,1] 3 5 degree distribution [(1,2),(2,3)] 4

Directed Graph in-degree din(i) of node i out-degree dout(i) of node i 2 in-degree din(i) of node i number of edges pointing to node i out-degree dout(i) of node i number of edges leaving node i 1 3 in-degree sequence [1,2,1,1,1] out-degree sequence [2,1,2,1,0] 5 4

Paths Path from node i to node j: a sequence of edges (directed or undirected from node i to node j) path length: number of edges on the path nodes i and j are connected cycle: a path that starts and ends at the same node 2 2 1 1 3 3 5 5 4 4

Shortest Paths Shortest Path from node i to node j also known as BFS path, or geodesic path 2 2 1 1 3 3 5 4 5 4

Diameter The longest shortest path in the graph 2 2 1 1 3 3 5 4 5 4

Undirected graph Connected graph: a graph where there every pair of nodes is connected Disconnected graph: a graph that is not connected Connected Components: subsets of vertices that are connected 2 1 3 5 4

Fully Connected Graph Clique Kn A graph that has all possible n(n-1)/2 edges 2 1 3 5 4

Directed Graph 2 Strongly connected graph: there exists a path from every i to every j 1 Weakly connected graph: If edges are made to be undirected the graph is connected 3 5 4

Subgraphs Subgraph: Given V’  V, and E’  E, the graph G’=(V’,E’) is a subgraph of G. Induced subgraph: Given V’  V, let E’  E is the set of all edges between the nodes in V’. The graph G’=(V’,E’), is an induced subgraph of G 2 1 3 5 4

Trees Connected Undirected graphs without cycles 2 1 3 5 4

Bipartite graphs Graphs where the set V can be partitioned into two sets L and R, such that all edges are between nodes in L and R, and there is no edge within L or R

Linear Algebra Adjacency Matrix symmetric matrix for undirected graphs 2 1 3 5 4

Linear Algebra Adjacency Matrix unsymmetric matrix for undirected graphs 2 1 3 5 4

Random Walks Start from a node, and follow links uniformly at random. Stationary distribution: The fraction of times that you visit node i, as the number of steps of the random walk approaches infinity if the graph is strongly connected, the stationary distribution converges to a unique vector.

Random Walks stationary distribution: principal left eigenvector of the normalized adjacency matrix x = xP for undirected graphs, the degree distribution 2 1 3 5 4

Eigenvalues and Eigenvectors The value λ is an eigenvalue of matrix A if there exists a non-zero vector x, such that Ax=λx. Vector x is an eigenvector of matrix A The largest eigenvalue is called the principal eigenvalue The corresponding eigenvector is the principal eigenvector Corresponds to the direction of maximum change