Econ 430 Lecture 3: Significance and Structural Properties of N
|
|
- Janis Summers
- 5 years ago
- Views:
Transcription
1 Econ 430 Lecture 3: Significance and Structural Properties of Networks Alper Duman Izmir University Economics, March 8, 2013
2 Prevalence of Networks Networks are everywhere! Even in this class. We can classify networks broadly into three: (1) technological/physical, (2) social/economic and (3) mixed. Transportation, power grids, internet, food web, chemical reaction and circuits are examples of the first class. Friendship, job, crime, insurance, risk sharing, sexual, supplier, customer, ownership and religious networks are some of the examples the second class of networks. Information, phone calls, communication, citation, patent and online-game players networks are from class three
3 Prevalence of Networks 1. Visit 2. Visit http : //www personal.umich.edu/ mejn/netdata/ 3. Visit http : //math.nist.gov/ RPozo/complex d atasets.html 4. Visit http : //wiki.gephi.org/index.php/datasets 5. Visit http : //vlado.fmf.uni lj.si/pub/networks/data/
4 Figure : Football Transfers Network from Countries in WC98 JAM CHE USA NLD BEL GBR IRN HRV ZAF DNK SCO CHL NGA ITA DEU AUT ROM NOR ARG TUR ESP FRA YUG GRE COL CMR BGR TUN BRA MAR KOR PRY JPN PRT MEX Pajek
5 Figure : Structural Equivalence -Hierarchical Clustering Pajek - Ward [0.00,6.79] ARG AUT BEL BGR BRA CHE DNK GRE IRN JAM KOR MAR MEX USA YUG ZAF HRV NLD NOR CHL CMR COL GBR NGA PRY TUN ITA ROM DEU JPN PRT SCO TUR ESP FRA
6 Random networks are benchmarks! Random network properties provide clues on what we can expect from other types of networks Believe or not sexual partnership network in US resemble a random network! Random networks on grids are important for games on networks.
7 Bipartite-Affiliation Networks We use adjacency matrices of bipartite (directed or undirected) networks in order to get one-mode projections; undirected networks. C = AA T gives cocitation matrix B = A T A gives bibliographic coupling matrix.
8 Acyclic Directed Networks Paper and patent citations are acyclic; the direction of edges can be represented all pointing downwards Acyclic directed networks also represent information geometry models in which there can be multiple causes and effects. The adjacency matrix of an acyclic directed network is a strictly triangular matrix.
9 Small Worlds Small world implies that large networks have small diameters, small average path lengths and greater clustering coefficients. Remember six degrees! Search for Erdös and Bacon numbers for mathematicians and movie stars respectively. How many steps does it take you to arrange a delivery of a mail to anyone in the world?
10 Figure : Ownership Network Giant Component by Gephi
11 Average degree: Diameter: 9 Average path length: Average Clustering coefficient: (Number of triangles: 4126) Short path lengths and high clustering suggest small world of corporations in Turkey.
12 Triad Closure and Clustering George Simmel -importance of mutually connected triplets. Norbert Elias -clustering in families, clans, tribes, communities It is easy to see why you would observe high clustering in the Facebook network But it is also true for WWW! Lara Adamic finds that WWW network has a clustering measure of ; the clustering coefficient of a random network with same number of links would be
13 Triad Closure and Clustering Triadic Closure occurs for many reasons One reason why B and C are more likely to become friends, when they have a common friend A, is simply based on the opportunity for B and C to meet Two friendship links suggest TRUST if A is friends with B and C, then it becomes a source of latent stress in these relationships if B and C are not friends with each other If a node A has edges to nodes B and C, then the B-C edge is especially likely to form if A s edges to B and C are both strong ties
14
15 Degree Distributions Most networks are neither random nor regular. There are hubs in network with very high number of links and a lot of vertices with very few links. Fat-tails suggesting scale-free degree distributions are observed in many contexts. Word usage, plant classification, city size, article citations, internet servers! A simple preferential attachment model would give a scale-free (or power law) degree distribution.
16 Correlations and Assortativity When relatively high-degree nodes tend to be connected to other high-degree node, we call this relation positive assortativity. This relation is a common feature of social/economic networks in contrast to technological/physical networks. In the latter we often observe negative assortativity. In the world trade network, there is a hub-and-spoke system in which smaller countries (spokes) tend to have few partners and mainly trade with larger countries (hubs).
17 Homophily People are more likely to have links with other people similar to themselves. Give examples...ie football fans, ethnicity, employment status Why is the homophily effect important? Are you crime-prone and hence you become a member of a gang; or you know a gang member and she pulls you into crime business! Turkish migrants in Germany or in Holland; they are much more connected with each other
18 Weak and Strong Ties Mark Granovetter has come up with the idea while analysing job network in Massachusetts Strong ties relate to close/intense links, ie best friends, extended family members. Weak ties refer to links such as acquaintances. Weak ties are usually bridges! Weak ties are critical in terms of information flows
19 The embeddedness of an edge in a network to be the number of common neighbours the two endpoints have. Local bridges are precisely the edges that have an embeddedness of zero Social sanctions and reputation effects matter through embeddedness For isolates no such mechanism exist
20 Structural Holes and Social Capital A structural hole is a void between two connected subgraphs (components). This can be due to strategic decisions or due to physical/social constraints. An agent filling the void (a broker) can be very powerful/influential. Social capital related to the material/non-material asset that agents can have by having specific links or by being in a specific network. Community governance depends on the social capital; i.e. fishermen of Güzelbahçe.
21 Diffusion Diffusion of open source software, smart phones and new innovations Diffusion of diseases Diffusion of information Threshold models and rebellions (Chwe models in Collective Action)
Social Networks, Social Interaction, and Outcomes
Social Networks, Social Interaction, and Outcomes Social Networks and Social Interaction Not all links are created equal: Some links are stronger than others Some links are more useful than others Links
More informationThe webinar will begin shortly
The webinar will begin shortly Towards Green Growth? Official Launch of the OECD's Tracking Progress Report 27 July 2015 Need technical support? Email: contact@ggkp.org Supported by: Towards Green Growth?
More informationCSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks
CSE 258 Lecture 12 Web Mining and Recommender Systems Social networks Social networks We ve already seen networks (a little bit) in week 3 i.e., we ve studied inference problems defined on graphs, and
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Social networks
CSE 158 Lecture 11 Web Mining and Recommender Systems Social networks Assignment 1 Due 5pm next Monday! (Kaggle shows UTC time, but the due date is 5pm, Monday, PST) Assignment 1 Assignment 1 Social networks
More informationWeb 2.0 Social Data Analysis
Web 2.0 Social Data Analysis Ing. Jaroslav Kuchař jaroslav.kuchar@fit.cvut.cz Structure(1) Czech Technical University in Prague, Faculty of Information Technologies Software and Web Engineering 2 Contents
More informationCisco HCS Country Dial Plans
Introduction to Country Dial Plans for Cisco Unified Communications Domain Manager 8.1(x), page 1 Guidelines for Deploying Country Dial Plans, page 4 Load a Country-Specific Dial Plan, page 4 Introduction
More informationTie strength, social capital, betweenness and homophily. Rik Sarkar
Tie strength, social capital, betweenness and homophily Rik Sarkar Networks Position of a node in a network determines its role/importance Structure of a network determines its properties 2 Today Notion
More informationTHE KNOWLEDGE MANAGEMENT STRATEGY IN ORGANIZATIONS. Summer semester, 2016/2017
THE KNOWLEDGE MANAGEMENT STRATEGY IN ORGANIZATIONS Summer semester, 2016/2017 SOCIAL NETWORK ANALYSIS: THEORY AND APPLICATIONS 1. A FEW THINGS ABOUT NETWORKS NETWORKS IN THE REAL WORLD There are four categories
More informationSocial, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior
Social, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior Who? Prof. Aris Anagnostopoulos Prof. Luciana S. Buriol Prof. Guido Schäfer What will We Cover? Topics: Network properties
More informationSocial Network Analysis
Social Network Analysis Mathematics of Networks Manar Mohaisen Department of EEC Engineering Adjacency matrix Network types Edge list Adjacency list Graph representation 2 Adjacency matrix Adjacency matrix
More informationRecap! CMSC 498J: Social Media Computing. Department of Computer Science University of Maryland Spring Hadi Amiri
Recap! CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2015 Hadi Amiri hadi@umd.edu Announcement CourseEvalUM https://www.courseevalum.umd.edu/ 2 Announcement
More informationNetworks in economics and finance. Lecture 1 - Measuring networks
Networks in economics and finance Lecture 1 - Measuring networks What are networks and why study them? A network is a set of items (nodes) connected by edges or links. Units (nodes) Individuals Firms Banks
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 11/13/17 Jure Leskovec, Stanford CS224W: Analysis of Networks, http://cs224w.stanford.edu 2 Observations Models
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Triadic closure; strong & weak ties
CSE 158 Lecture 11 Web Mining and Recommender Systems Triadic closure; strong & weak ties Triangles So far we ve seen (a little about) how networks can be characterized by their connectivity patterns What
More informationStructure of Social Networks
Structure of Social Networks Outline Structure of social networks Applications of structural analysis Social *networks* Twitter Facebook Linked-in IMs Email Real life Address books... Who Twitter #numbers
More informationEconomics of Information Networks
Economics of Information Networks Stephen Turnbull Division of Policy and Planning Sciences Lecture 4: December 7, 2017 Abstract We continue discussion of the modern economics of networks, which considers
More informationCSE 255 Lecture 13. Data Mining and Predictive Analytics. Triadic closure; strong & weak ties
CSE 255 Lecture 13 Data Mining and Predictive Analytics Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)
More informationCSE 158 Lecture 13. Web Mining and Recommender Systems. Triadic closure; strong & weak ties
CSE 158 Lecture 13 Web Mining and Recommender Systems Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)
More information1 Homophily and assortative mixing
1 Homophily and assortative mixing Networks, and particularly social networks, often exhibit a property called homophily or assortative mixing, which simply means that the attributes of vertices correlate
More informationAlgorithmic and Economic Aspects of Networks. Nicole Immorlica
Algorithmic and Economic Aspects of Networks Nicole Immorlica Syllabus 1. Jan. 8 th (today): Graph theory, network structure 2. Jan. 15 th : Random graphs, probabilistic network formation 3. Jan. 20 th
More informationExtracting Information from Complex Networks
Extracting Information from Complex Networks 1 Complex Networks Networks that arise from modeling complex systems: relationships Social networks Biological networks Distinguish from random networks uniform
More informationComplex-Network Modelling and Inference
Complex-Network Modelling and Inference Lecture 8: Graph features (2) Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/notes/ Network_Modelling/ School
More informationGraph Theory. Graph Theory. COURSE: Introduction to Biological Networks. Euler s Solution LECTURE 1: INTRODUCTION TO NETWORKS.
Graph Theory COURSE: Introduction to Biological Networks LECTURE 1: INTRODUCTION TO NETWORKS Arun Krishnan Koenigsberg, Russia Is it possible to walk with a route that crosses each bridge exactly once,
More informationELITE TRIATHLON UNIFORMS UPDATED ON
ELITE TRIATHLON UNIFORMS UPDATED ON 2018-01-31 ARG OPTION 1 MEN Approved by the ITU Uniform Panel, 6 April 2016 This uniform is approved under the condition that Sponsor Space C is available only on the
More informationTELCOM2125: Network Science and Analysis
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2
More informationCyber Attack Information System CAIS. DI Thomas Bleier, MSc, CISSP, CEH
Cyber Attack Information System CAIS Cyber Attack Information System DI Thomas Bleier, MSc, CISSP, CEH 09.11.2012 AIT Austrian Institute of Technology Bundeskanzleramt Österreich Bundesministerium für
More informationErdős-Rényi Model for network formation
Network Science: Erdős-Rényi Model for network formation Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Why model? Simpler representation
More informationUnderground economy. Economics of Security and Privacy (BMEVIHIAV15) Mark Felegyhazi. assistant professor CrySyS Lab.
Underground economy Economics of Security and Privacy (BMEVIHIAV15) Mark Felegyhazi assistant professor CrySyS Lab. Underground economy BME Department of Telecommunications (Híradástechnikai Tanszék) mfelegyhazi(atat)crysys(dot)hu
More informationGraph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
More informationELITE TRIATHLON UNIFORMS UPDATED ON
ELITE TRIATHLON UNIFORMS UPDATED ON 2018-07-05 ARG Approved by the ITU Uniform Panel, 13 June 2018 AUS MEN Approved by the ITU Uniform Panel, 10 May 2018 AUS WOMEN Approved by the ITU Uniform Panel, 10
More informationRANDOM-REAL NETWORKS
RANDOM-REAL NETWORKS 1 Random networks: model A random graph is a graph of N nodes where each pair of nodes is connected by probability p: G(N,p) Random networks: model p=1/6 N=12 L=8 L=10 L=7 The number
More informationcaution in interpreting graph-theoretic diagnostics
April 17, 2013 What is a network [1, 2, 3] What is a network [1, 2, 3] What is a network [1, 2, 3] What is a network [1, 2, 3] What is a network a collection of more or less identical agents or objects,
More informationBasic Network Concepts
Basic Network Concepts Basic Vocabulary Alice Graph Network Edges Links Nodes Vertices Chuck Bob Edges Alice Chuck Bob Edge Weights Alice Chuck Bob Apollo 13 Movie Network Main Actors in Apollo 13 the
More informationNick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell
Nick Hamilton Institute for Molecular Bioscience Essential Graph Theory for Biologists Image: Matt Moores, The Visible Cell Outline Core definitions Which are the most important bits? What happens when
More informationMINFS544: Business Network Data Analytics and Applications
MINFS544: Business Network Data Analytics and Applications Feb 21 th, 2017 Daning Hu, Ph.D., Department of Informatics University of Zurich F Schweitzer et al. Science 2009 Stop Contagious Failures in
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationMeasures of prestige
A. Mrvar: Network Analysis using Pajek 1 Measures of prestige Prestige measures are usually computed for directed networks only, since for this measures the direction is important property of the relation.
More informationOECD Methodology for Measuring the Information Society
Gaborone, 28-29 October 2004 OECD Methodology for Measuring the Information Society Brigitte van Beuzekom OECD Economic Analysis and Statistics Division, Directorate for Science, Technology and Industry
More informationModels of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation Networked Life NETS 112 Fall 2017 Prof. Michael Kearns Roadmap Recently: typical large-scale social and other networks exhibit: giant component with small diameter sparsity
More informationDavid Easley and Jon Kleinberg January 24, 2007
Networks: Spring 2007 Graph Theory David Easley and Jon Kleinberg January 24, 2007 A graph is simply a way of encoding the pairwise relationships among a set of objects: we will refer to the objects as
More informationChapter 1. Social Media and Social Computing. October 2012 Youn-Hee Han
Chapter 1. Social Media and Social Computing October 2012 Youn-Hee Han http://link.koreatech.ac.kr 1.1 Social Media A rapid development and change of the Web and the Internet Participatory web application
More informationGraph-theoretic Properties of Networks
Graph-theoretic Properties of Networks Bioinformatics: Sequence Analysis COMP 571 - Spring 2015 Luay Nakhleh, Rice University Graphs A graph is a set of vertices, or nodes, and edges that connect pairs
More informationGuanxi in the Chinese Web. University of Victoria Victoria, BC, Canada {yul, val,
Guanxi in the Chinese Web Louis Yu Valerie King Yan Zhuang University of Victoria Victoria, BC, Canada {yul, val, yzhuang}@uvic.ca 1 Outline Introduction and related work Link analysis and web graph measurement
More informationDistribution-Free Models of Social and Information Networks
Distribution-Free Models of Social and Information Networks Tim Roughgarden (Stanford CS) joint work with Jacob Fox (Stanford Math), Rishi Gupta (Stanford CS), C. Seshadhri (UC Santa Cruz), Fan Wei (Stanford
More informationAGE GROUPS UNIFORMS UPDATED ON
AGE GROUPS UNIFORMS UPDATED ON 2018-05-25 ARG OPTION 1 Approved by the ITU Uniform Panel, 17 February 2014 MEN WOMEN ARG OPTION 2 Approved by the ITU Uniform Panel, 29 June 2017 AUS OPTION 1 Approved by
More informationRelational data. Peter Hoff. 567 Social network analysis. Statistics, University of Washington /20
/20 Relational data 567 Social network analysis Peter Hoff Statistics, University of Washington 2/20 Defining characteristics of network data Relational data are data that include a set of objects, and
More informationSection 7.13: Homophily (or Assortativity) By: Ralucca Gera, NPS
Section 7.13: Homophily (or Assortativity) By: Ralucca Gera, NPS Are hubs adjacent to hubs? How does a node s degree relate to its neighbors degree? Real networks usually show a non-zero degree correlation
More informationMeasuring scholarly impact: Methods and practice Link prediction with the linkpred tool
Measuring scholarly impact: Methods and practice Link prediction with the linkpred tool Raf Guns University of Antwerp raf.guns@uantwerpen.be If you want to follow along Download and install Anaconda Python
More informationCIP- OSN Online Social Networks as Graphs. Dr. Thanassis Tiropanis -
CIP- OSN Online Social Networks as Graphs Dr. Thanassis Tiropanis - tt2@ecs http://vimeo.com/58729247 http://socialnetworks.soton.ac.uk The narra9ve Web Evolu9on and Online Social Networks Web Evolu9on
More informationInformation Networks and Semantics. Srinath Srinivasa IIIT Bangalore
Information Networks and Semantics Srinath Srinivasa IIIT Bangalore sri@iiitb.ac.in Outline Information versus Material Networks Semantics in Information Networks Knowledge Networks Triadic Closure Entrenchment
More informationCS 124/LINGUIST 180 From Languages to Information. Social Networks: Small Worlds, Weak Ties, and Power Laws. Dan Jurafsky Stanford University
CS 124/LINGUIST 180 From Languages to Information Dan Jurafsky Stanford University Social Networks: Small Worlds, Weak Ties, and Power Laws Slides from Jure Leskovec, Lada Adamic, James Moody, Bing Liu,
More informationBiological Networks Analysis
Biological Networks Analysis Introduction and Dijkstra s algorithm Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein The clustering problem: partition genes into distinct
More informationL Modeling and Simulating Social Systems with MATLAB
851-0585-04L Modeling and Simulating Social Systems with MATLAB Lecture 6 Introduction to Graphs/Networks Karsten Donnay and Stefano Balietti Chair of Sociology, in particular of Modeling and Simulation
More informationWeb 2.0 Social Data Analysis
Web 2.0 Social Data Analysis Ing. Jaroslav Kuchař jaroslav.kuchar@fit.cvut.cz Structure (2) Czech Technical University in Prague, Faculty of Information Technologies Software and Web Engineering 2 Contents
More informationDegree Distribution: The case of Citation Networks
Network Analysis Degree Distribution: The case of Citation Networks Papers (in almost all fields) refer to works done earlier on same/related topics Citations A network can be defined as Each node is a
More informationModeling and Simulating Social Systems with MATLAB
Modeling and Simulating Social Systems with MATLAB Lecture 8 Introduction to Graphs/Networks Olivia Woolley, Stefano Balietti, Lloyd Sanders, Dirk Helbing Chair of Sociology, in particular of Modeling
More informationCS-E5740. Complex Networks. Scale-free networks
CS-E5740 Complex Networks Scale-free networks Course outline 1. Introduction (motivation, definitions, etc. ) 2. Static network models: random and small-world networks 3. Growing network models: scale-free
More informationV2: Measures and Metrics (II)
- Betweenness Centrality V2: Measures and Metrics (II) - Groups of Vertices - Transitivity - Reciprocity - Signed Edges and Structural Balance - Similarity - Homophily and Assortative Mixing 1 Betweenness
More informationExponential Random Graph Models for Social Networks
Exponential Random Graph Models for Social Networks ERGM Introduction Martina Morris Departments of Sociology, Statistics University of Washington Departments of Sociology, Statistics, and EECS, and Institute
More information1 Degree Distributions
Lecture Notes: Social Networks: Models, Algorithms, and Applications Lecture 3: Jan 24, 2012 Scribes: Geoffrey Fairchild and Jason Fries 1 Degree Distributions Last time, we discussed some graph-theoretic
More informationStatistical Methods for Network Analysis: Exponential Random Graph Models
Day 2: Network Modeling Statistical Methods for Network Analysis: Exponential Random Graph Models NMID workshop September 17 21, 2012 Prof. Martina Morris Prof. Steven Goodreau Supported by the US National
More informationMeeting the Challenges of the Bottom of the Pyramid
Meeting the Challenges of the Bottom of the Pyramid Planting Seeds... Intel Applications Research and Strategy Lab 16 May, 2002 Colin M. Maclay Center for International Development Harvard University Agenda
More informationIntroduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 16th, 2014 Outline n Network Science A Random History n Network Analysis Network
More informationAlessandro Del Ponte, Weijia Ran PAD 637 Week 3 Summary January 31, Wasserman and Faust, Chapter 3: Notation for Social Network Data
Wasserman and Faust, Chapter 3: Notation for Social Network Data Three different network notational schemes Graph theoretic: the most useful for centrality and prestige methods, cohesive subgroup ideas,
More informationELITE MULTISPORT UNIFORMS UPDATED ON
ELITE MULTISPORT UNIFORMS UPDATED ON 2018-11-20 ARG Approved by the ITU Uniform Panel, 13 June 2018 AUS Approved by the ITU Uniform Panel, 25 January 2017 AUT Approved by ITU Uniform Panel, 17 March 2011
More informationDigital Context Pacific Alliance
SEPTEMBER 2016 Digital Context Pacific Alliance 1 Index Overview 1 Digital scenario 2 ICT access and usage 3 Online activities 4 Regulation Appendix 2 Overview The (PA) has a high position regarding Internet
More informationCOMP6237 Data Mining and Networks. Markus Brede. Lecture slides available here:
COMP6237 Data Mining and Networks Markus Brede Brede.Markus@gmail.com Lecture slides available here: http://users.ecs.soton.ac.uk/mb8/stats/datamining.html Outline Why? The WWW is a major application of
More informationBasics of Network Analysis
Basics of Network Analysis Hiroki Sayama sayama@binghamton.edu Graph = Network G(V, E): graph (network) V: vertices (nodes), E: edges (links) 1 Nodes = 1, 2, 3, 4, 5 2 3 Links = 12, 13, 15, 23,
More informationWorkload Characterization of the 1998 World Cup Web Site
of the 1998 World Cup Web Site Martin Arlitt, Tai Jin Internet Systems and Applications Laboratory HP Laboratories Palo Alto HPL-1999-35(R.1) September, 1999 E-mail: {arlitt, tai}@hpl.hp.com World-Wide
More information1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G))
10 Graphs 10.1 Graphs and Graph Models 1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 2. an edge is present, say e = {u,
More informationCAIM: Cerca i Anàlisi d Informació Massiva
1 / 72 CAIM: Cerca i Anàlisi d Informació Massiva FIB, Grau en Enginyeria Informàtica Slides by Marta Arias, José Balcázar, Ricard Gavaldá Department of Computer Science, UPC Fall 2016 http://www.cs.upc.edu/~caim
More informationWednesday, March 8, Complex Networks. Presenter: Jirakhom Ruttanavakul. CS 790R, University of Nevada, Reno
Wednesday, March 8, 2006 Complex Networks Presenter: Jirakhom Ruttanavakul CS 790R, University of Nevada, Reno Presented Papers Emergence of scaling in random networks, Barabási & Bonabeau (2003) Scale-free
More informationGraphs. Data Structures and Algorithms CSE 373 SU 18 BEN JONES 1
Graphs Data Structures and Algorithms CSE 373 SU 18 BEN JONES 1 Warmup Discuss with your neighbors: Come up with as many kinds of relational data as you can (data that can be represented with a graph).
More informationCustomer specific dial plan
Prerequisites, page 1 Dial Plan workflow, page 2 Determine customer specific dial plan requirements, page 2 Prerequisites Note This section of the document starts the planning part that is repeated with
More informationLecture 1: Networks: A brief introduction
Lecture 1: Networks: A brief introduction Sudipta Sarangi Virginia Tech Networks Network: Defines the interaction structure between agents through the set of ties between them. Agents: individuals, organizations,
More informationAlgorithms and Applications in Social Networks. 2017/2018, Semester B Slava Novgorodov
Algorithms and Applications in Social Networks 2017/2018, Semester B Slava Novgorodov 1 Lesson #1 Administrative questions Course overview Introduction to Social Networks Basic definitions Network properties
More informationOnline Social Networks 2
Online Social Networks 2 Formation, Contagion, Information Diffusion Some slides adapted from Michael Kearns (Upenn) and Eytan Adar (Michigan) 1 Today's Plan Information diffusion, contagion Formation
More informationELITE MULTISPORT UNIFORMS UPDATED ON
ELITE MULTISPORT UNIFORMS UPDATED ON 2018-04-25 ARG OPTION 1 Approved by ITU Uniform Panel, 17 February 2014 MEN WOMEN ARG OPTION 2 Approved by ITU Uniform Panel, 25 August 2011 The colours and design
More informationOverview of Organizational Structures and System Architectures. Joel Moses February 2006
Overview of Organizational Structures and System Architectures Joel Moses February 2006 Some assumptions/biases Generic system architectures and generic organizational structures have much in common A
More informationGraph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
More informationAlgorithms. Graphs. Algorithms
Algorithms Graphs Algorithms Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Algorithms 1 Graphs Vertices: Nodes, points, computers, users, items,...
More informationA quick review. The clustering problem: Hierarchical clustering algorithm: Many possible distance metrics K-mean clustering algorithm:
The clustering problem: partition genes into distinct sets with high homogeneity and high separation Hierarchical clustering algorithm: 1. Assign each object to a separate cluster.. Regroup the pair of
More informationCS2 Algorithms and Data Structures Note 10. Depth-First Search and Topological Sorting
CS2 Algorithms and Data Structures Note 10 Depth-First Search and Topological Sorting In this lecture, we will analyse the running time of DFS and discuss a few applications. 10.1 A recursive implementation
More informationInstructor: Paul Zeitz, University of San Francisco
Berkeley Math Circle Graph Theory and Ramsey Theory Instructor: Paul Zeitz, University of San Francisco (zeitz@usfca.edu) Definitions 1 A graph is a pair (V,E), where V is a finite set and E is a set of
More informationSocial and Information Network Analysis Positive and Negative Relationships
Social and Information Network Analysis Positive and Negative Relationships Cornelia Caragea Department of Computer Science and Engineering University of North Texas June 14, 2016 To Recap Triadic Closure
More informationOnline Social Networks and Media. Positive and Negative Edges Strong and Weak Edges Strong Triadic Closure
Online Social Networks and Media Positive and Negative Edges Strong and Weak Edges Strong Triadic Closure POSITIVE AND NEGATIVE TIES Structural Balance What about negative edges? Initially, a complete
More informationMa/CS 6b Class 10: Ramsey Theory
Ma/CS 6b Class 10: Ramsey Theory By Adam Sheffer The Pigeonhole Principle The pigeonhole principle. If n items are put into m containers, such that n > m, then at least one container contains more than
More informationComplex networks: A mixture of power-law and Weibull distributions
Complex networks: A mixture of power-law and Weibull distributions Ke Xu, Liandong Liu, Xiao Liang State Key Laboratory of Software Development Environment Beihang University, Beijing 100191, China Abstract:
More informationThis is not the chapter you re looking for [handwave]
Chapter 4 This is not the chapter you re looking for [handwave] The plan of this course was to have 4 parts, and the fourth part would be half on analyzing random graphs, and looking at different models,
More informationGraph Theory. Network Science: Graph theory. Graph theory Terminology and notation. Graph theory Graph visualization
Network Science: Graph Theory Ozalp abaoglu ipartimento di Informatica Scienza e Ingegneria Università di ologna www.cs.unibo.it/babaoglu/ ranch of mathematics for the study of structures called graphs
More informationAlgorithms: Graphs. Amotz Bar-Noy. Spring 2012 CUNY. Amotz Bar-Noy (CUNY) Graphs Spring / 95
Algorithms: Graphs Amotz Bar-Noy CUNY Spring 2012 Amotz Bar-Noy (CUNY) Graphs Spring 2012 1 / 95 Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Amotz
More informationHeuristics for the Critical Node Detection Problem in Large Complex Networks
Heuristics for the Critical Node Detection Problem in Large Complex Networks Mahmood Edalatmanesh Department of Computer Science Submitted in partial fulfilment of the requirements for the degree of Master
More informationMa/CS 6b Class 12: Ramsey Theory
Ma/CS 6b Class 12: Ramsey Theory By Adam Sheffer The Pigeonhole Principle The pigeonhole principle. If n items are put into m containers, such that n > m, then at least one container contains more than
More informationSLANG Session 4. Jason Quinley Roland Mühlenbernd Seminar für Sprachwissenschaft University of Tübingen
SLANG Session 4 Jason Quinley Roland Mühlenbernd Seminar für Sprachwissenschaft University of Tübingen Overview Network properties Degree Density and Distribution Clustering and Connections Network formation
More informationA quick review. Which molecular processes/functions are involved in a certain phenotype (e.g., disease, stress response, etc.)
Gene expression profiling A quick review Which molecular processes/functions are involved in a certain phenotype (e.g., disease, stress response, etc.) The Gene Ontology (GO) Project Provides shared vocabulary/annotation
More informationOnline Social Networks and Media
Online Social Networks and Media Absorbing Random Walks Link Prediction Why does the Power Method work? If a matrix R is real and symmetric, it has real eigenvalues and eigenvectors: λ, w, λ 2, w 2,, (λ
More informationPositive and Negative Links
Positive and Negative Links Web Science (VU) (707.000) Elisabeth Lex KTI, TU Graz May 4, 2015 Elisabeth Lex (KTI, TU Graz) Networks May 4, 2015 1 / 66 Outline 1 Repetition 2 Motivation 3 Structural Balance
More informationIntroduction to Complex Networks Analysis
Introduction to Complex Networks Analysis Miloš Savić Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia Complex systems and networks System - a set of interrelated
More informationInternational Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.7, No.3, May Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani
LINK MINING PROCESS Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani Higher Colleges of Technology, United Arab Emirates ABSTRACT Many data mining and knowledge discovery methodologies and process models
More informationUniversal Properties of Mythological Networks Midterm report: Math 485
Universal Properties of Mythological Networks Midterm report: Math 485 Roopa Krishnaswamy, Jamie Fitzgerald, Manuel Villegas, Riqu Huang, and Riley Neal Department of Mathematics, University of Arizona,
More information