UNIVERSITA DEGLI STUDI DI CATANIA FACOLTA DI INGEGNERIA

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "UNIVERSITA DEGLI STUDI DI CATANIA FACOLTA DI INGEGNERIA"

Transcription

1 UNIVERSITA DEGLI STUDI DI CATANIA FACOLTA DI INGEGNERIA PhD course in Electronics, Automation and Complex Systems Control-XXIV Cycle DIPARTIMENTO DI INGEGNERIA ELETTRICA ELETTRONICA E DEI SISTEMI ing. Angelo Sarra Fiore Tutor: prof. ing. Luigi Fortuna ing. Mattia Frasca

2 Outline Networks Theory Friends Network How a friends network grows? Courses

3 A network is a system consisting of many entities, called nodes, linked to each other and interacting through connections (edges). A general network may be represented as a graph G = (N, E), where N is the set of nodes and E the set of edges = = {(,2),(,5),(2,3),(2,5),(3,6),(4,5)} {,2,3,4,5,6} ) :, ( E edges N nodes E N G Networks Theory WHAT IS A NETWORK? = A Mathematically a graph G (N, E) can be represented by a matrix (called adjacency matrix A) that has nodes as elements of rows and columns and the elements are different from zero (if different from it is a weight" of the link: cost, velocity, energy etc.) if the two nodes are connected.

4 Networks Theory EXAMPLES Many complex systems can be represented as networks of interacting elements. -Social Networks Coauthors Networks Actors Networks /IM Networks -Technological Networks Telephone Networks Internet Transport Networks -Knowledge (Information) Networks References Network World Wide Web -Biological Networks Proteins Networks Neural Networks

5 Networks Theory CHARACTERISTIC PARAMETERS OF NETWORKS Node degree: number of the edge of a node k i = a ij j N Shortest path length: the average of the shortest paths connecting each pair of nodes L = N( N ) d ij i, j N, i j where d ij is the element of the D matrix which contains the shortest paths connecting each pair of nodes Clustering coefficient of a node: quantifies the importance of a node by evaluating the number of connections that remain if the node was removed c i = 2 arcs' number k ( k ) i i of G i

6 Networks Theory HISTORY The classical network theory goes back to 736 with Eulero's study to solve the Koningsberg Bridges Problem. In 959 P. Erdos and A. Rényi, two Hungarian mathematicians, introduced random network In 998 S. Strogatz e D. Watts, studying actors' networks, energy distribution network and the neural network of the worm C.elegans, saw a deviation from random networks and introduced the small world networks In 999 Barabási e R. Albert saw that many networks had a power law degree distribution N(k) ~ k - γ and defined the scale-free networks and very popular is the sentence "the rich get richer"

7 Friends Network We re analyzing the friends networks of some user of the popular social network Facebook (originally known as Thefacebook) is the most popular social network site today and was founded on 4 February 24 by Mark Zuckerberg, a nineteen student of the Harvard s University, with the help of Andrew McCollum and Eduardo Saverino. In April 29 the number of active users has reached 2 million and the average number of friends per user is 2.

8 Friends Network Start with a star network where the user is the central node

9 Friends Network Remove the central node to obtain the friend s network

10 Friends Network Remove isolated nodes and Extract the Main Component

11 Friends Network Analysis of this network

12 Friends Network Comparison with other network topologies

13 Degree Distribution of Four Different Networks L=3,488 C=,4528 K=8,398 nodes: 75 edges: L=2,5534 C=,5993 K=,2745 nodes: 3 edges: k k L=2,273 C=,436 K=24,292 nodes: 37 edges: L=2,639 C=,574 K=2,37 nodes: 262 edges: k k

14 Power Law Degree Distribution 6 Erdos L=2,28 C=,493 K=25,8824 Random L=2,944 C=,52 K=26,7324 Real L=3,2683 C=,422 K=26,7324 nodes: 528 edges: P(k)=a*k -γ a=48 γ= k k

15 Results of the Analysis L C networks erdos random real,8,7,6,5,4,3,2, networks erdos random real K networks In comparison with the random and the Erdos-Renyi networks friends networks present an higher clustering coefficient and a lower path length, typical characteristics of small-world networks, but the degree distributions aren t power law erdos random real

16 How a Friends Network Grows? Study of a social network that evolves in time A dynamic network is a particular network in which the topology changes in time for the variations in the sets of edges and nodes

17 How a Friends Network Grows? Edges number Nodes number sample sample

18 How a Friends Network Grows? L = C = sample sample 25 2 K 5 5 K = sample

19 How a Friends Network Grows? 9 DEGREE DISTRIBUTION k

20 How a Friends Network Grows? 62 nodes 4354 edges

21 Courses Fondamenti di Bioingegneria Elettronica Misure Elettroniche

Erdős-Rényi Model for network formation

Erdő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 information

CS-E5740. Complex Networks. Scale-free networks

CS-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 information

Properties of Biological Networks

Properties of Biological Networks Properties of Biological Networks presented by: Ola Hamud June 12, 2013 Supervisor: Prof. Ron Pinter Based on: NETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION By Albert-László Barabási

More information

CAIM: Cerca i Anàlisi d Informació Massiva

CAIM: 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 information

Complex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems

Complex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems Complex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems networks are everywhere (and always have been) - relationships (edges) among entities (nodes) explosion of interest in network

More information

Basics of Network Analysis

Basics 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 information

Networks in economics and finance. Lecture 1 - Measuring networks

Networks 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 information

Resilient Networking. Thorsten Strufe. Module 3: Graph Analysis. Disclaimer. Dresden, SS 15

Resilient Networking. Thorsten Strufe. Module 3: Graph Analysis. Disclaimer. Dresden, SS 15 Resilient Networking Thorsten Strufe Module 3: Graph Analysis Disclaimer Dresden, SS 15 Module Outline Why bother with theory? Graphs and their representations Important graph metrics Some graph generators

More information

A Generating Function Approach to Analyze Random Graphs

A Generating Function Approach to Analyze Random Graphs A Generating Function Approach to Analyze Random Graphs Presented by - Vilas Veeraraghavan Advisor - Dr. Steven Weber Department of Electrical and Computer Engineering Drexel University April 8, 2005 Presentation

More information

Characteristics of Preferentially Attached Network Grown from. Small World

Characteristics of Preferentially Attached Network Grown from. Small World Characteristics of Preferentially Attached Network Grown from Small World Seungyoung Lee Graduate School of Innovation and Technology Management, Korea Advanced Institute of Science and Technology, Daejeon

More information

Models 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 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 information

M.E.J. Newman: Models of the Small World

M.E.J. Newman: Models of the Small World A Review Adaptive Informatics Research Centre Helsinki University of Technology November 7, 2007 Vocabulary N number of nodes of the graph l average distance between nodes D diameter of the graph d is

More information

1 Degree Distributions

1 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 information

Topic II: Graph Mining

Topic II: Graph Mining Topic II: Graph Mining Discrete Topics in Data Mining Universität des Saarlandes, Saarbrücken Winter Semester 2012/13 T II.Intro-1 Topic II Intro: Graph Mining 1. Why Graphs? 2. What is Graph Mining 3.

More information

Small-World Models and Network Growth Models. Anastassia Semjonova Roman Tekhov

Small-World Models and Network Growth Models. Anastassia Semjonova Roman Tekhov Small-World Models and Network Growth Models Anastassia Semjonova Roman Tekhov Small world 6 billion small world? 1960s Stanley Milgram Six degree of separation Small world effect Motivation Not only friends:

More information

6.207/14.15: Networks Lecture 5: Generalized Random Graphs and Small-World Model

6.207/14.15: Networks Lecture 5: Generalized Random Graphs and Small-World Model 6.207/14.15: Networks Lecture 5: Generalized Random Graphs and Small-World Model Daron Acemoglu and Asu Ozdaglar MIT September 23, 2009 1 Outline Generalized random graph models Graphs with prescribed

More information

Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009.

Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009. Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009. Describing Graphs (8.2) A graph is a mathematical way of describing

More information

Eciency of scale-free networks: error and attack tolerance

Eciency of scale-free networks: error and attack tolerance Available online at www.sciencedirect.com Physica A 320 (2003) 622 642 www.elsevier.com/locate/physa Eciency of scale-free networks: error and attack tolerance Paolo Crucitti a, Vito Latora b, Massimo

More information

Using! to Teach Graph Theory

Using! to Teach Graph Theory !! Using! to Teach Graph Theory Todd Abel Mary Elizabeth Searcy Appalachian State University Why Graph Theory? Mathematical Thinking (Habits of Mind, Mathematical Practices) Accessible to students at a

More information

1 Random Graph Models for Networks

1 Random Graph Models for Networks Lecture Notes: Social Networks: Models, Algorithms, and Applications Lecture : Jan 6, 0 Scribes: Geoffrey Fairchild and Jason Fries Random Graph Models for Networks. Graph Modeling A random graph is a

More information

Signal Processing for Big Data

Signal Processing for Big Data Signal Processing for Big Data Sergio Barbarossa 1 Summary 1. Networks 2.Algebraic graph theory 3. Random graph models 4. OperaGons on graphs 2 Networks The simplest way to represent the interaction between

More information

Clustering in Networks

Clustering in Networks Clustering in Networks (Spectral Clustering with the Graph Laplacian... a brief introduction) Tom Carter Computer Science CSU Stanislaus http://csustan.csustan.edu/ tom/clustering April 1, 2012 1 Our general

More information

Overlay (and P2P) Networks

Overlay (and P2P) Networks Overlay (and P2P) Networks Part II Recap (Small World, Erdös Rényi model, Duncan Watts Model) Graph Properties Scale Free Networks Preferential Attachment Evolving Copying Navigation in Small World Samu

More information

caution in interpreting graph-theoretic diagnostics

caution 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 information

Towardsunderstanding: Astudy ofthe SourceForge.net community using modeling and simulation

Towardsunderstanding: Astudy ofthe SourceForge.net community using modeling and simulation Towardsunderstanding: Astudy ofthe SourceForge.net community using modeling and simulation YongqinGao,GregMadey DepartmentofComputerScience and Engineering UniversityofNotreDame ygao,gmadey@nd.edu Keywords:

More information

Small World Graph Clustering

Small World Graph Clustering Small World Graph Clustering Igor Kanovsky, Lilach Prego University of Haifa, Max Stern Academic College Israel 1 Clustering Problem Clustering problem : How to recognize communities within a huge graph.

More information

Unit 2: Graphs and Matrices. ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie

Unit 2: Graphs and Matrices. ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie Unit 2: Graphs and Matrices ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie Four main ways to notate a social network There are a variety of ways to mathematize a social network,

More information

Second-Order Assortative Mixing in Social Networks

Second-Order Assortative Mixing in Social Networks Second-Order Assortative Mixing in Social Networks 1 arxiv:0903.0687v2 [physics.soc-ph] 23 Nov 2009 Shi Zhou* and Ingemar J. Cox Department of Computer Science, University College London Gower Street,

More information

Simplicial Complexes of Networks and Their Statistical Properties

Simplicial Complexes of Networks and Their Statistical Properties Simplicial Complexes of Networks and Their Statistical Properties Slobodan Maletić, Milan Rajković*, and Danijela Vasiljević Institute of Nuclear Sciences Vinča, elgrade, Serbia *milanr@vin.bg.ac.yu bstract.

More information

Estrada Index. Bo Zhou. Augest 5, Department of Mathematics, South China Normal University

Estrada Index. Bo Zhou. Augest 5, Department of Mathematics, South China Normal University Outline 1. Introduction 2. Results for 3. References Bo Zhou Department of Mathematics, South China Normal University Augest 5, 2010 Outline 1. Introduction 2. Results for 3. References Outline 1. Introduction

More information

CSE 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 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 information

Distributed Data Management. Christoph Lofi Institut für Informationssysteme Technische Universität Braunschweig

Distributed Data Management. Christoph Lofi Institut für Informationssysteme Technische Universität Braunschweig Distributed Data Management Christoph Lofi Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 7.0 Network Models 7.0 Introduction 7.1 Graph Model Basics 7.2

More information

CSE 190 Lecture 16. Data Mining and Predictive Analytics. Small-world phenomena

CSE 190 Lecture 16. Data Mining and Predictive Analytics. Small-world phenomena CSE 190 Lecture 16 Data Mining and Predictive Analytics Small-world phenomena Another famous study Stanley Milgram wanted to test the (already popular) hypothesis that people in social networks are separated

More information

NDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016

NDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016 NDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016 Caesar S. Benipayo, PhD Student Under advisement of Dr. Michael Grenn and Dr. Blake Roberts Department of Engineering

More information

EFFECT OF VARYING THE DELAY DISTRIBUTION IN DIFFERENT CLASSES OF NETWORKS: RANDOM, SCALE-FREE, AND SMALL-WORLD. A Thesis BUM SOON JANG

EFFECT OF VARYING THE DELAY DISTRIBUTION IN DIFFERENT CLASSES OF NETWORKS: RANDOM, SCALE-FREE, AND SMALL-WORLD. A Thesis BUM SOON JANG EFFECT OF VARYING THE DELAY DISTRIBUTION IN DIFFERENT CLASSES OF NETWORKS: RANDOM, SCALE-FREE, AND SMALL-WORLD A Thesis by BUM SOON JANG Submitted to the Office of Graduate Studies of Texas A&M University

More information

Math 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search

Math 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search Math 443/543 Graph Theory Notes 0: Small world phenomenon and decentralized search David Glickenstein November 0, 008 Small world phenomenon The small world phenomenon is the principle that all people

More information

arxiv:cond-mat/ v5 [cond-mat.dis-nn] 16 Aug 2006

arxiv:cond-mat/ v5 [cond-mat.dis-nn] 16 Aug 2006 arxiv:cond-mat/0505185v5 [cond-mat.dis-nn] 16 Aug 2006 Characterization of Complex Networks: A Survey of measurements L. da F. Costa F. A. Rodrigues G. Travieso P. R. Villas Boas Instituto de Física de

More information

OPERATIONS RESEARCH. Transportation and Assignment Problems

OPERATIONS RESEARCH. Transportation and Assignment Problems OPERATIONS RESEARCH Chapter 2 Transportation and Assignment Problems Prof Bibhas C Giri Professor of Mathematics Jadavpur University West Bengal, India E-mail : bcgirijumath@gmailcom MODULE-3: Assignment

More information

WLU Mathematics Department Seminar March 12, The Web Graph. Anthony Bonato. Wilfrid Laurier University. Waterloo, Canada

WLU Mathematics Department Seminar March 12, The Web Graph. Anthony Bonato. Wilfrid Laurier University. Waterloo, Canada WLU Mathematics Department Seminar March 12, 2007 The Web Graph Anthony Bonato Wilfrid Laurier University Waterloo, Canada Graph theory the last century 4/27/2007 The web graph - Anthony Bonato 2 Today

More information

V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms!

V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms! V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms! How Does a Cell Work?! A cell is a crowded environment! => many different proteins,! metabolites, compartments,! On a microscopic level!

More information

Chapter 4 Graphs and Matrices. PAD637 Week 3 Presentation Prepared by Weijia Ran & Alessandro Del Ponte

Chapter 4 Graphs and Matrices. PAD637 Week 3 Presentation Prepared by Weijia Ran & Alessandro Del Ponte Chapter 4 Graphs and Matrices PAD637 Week 3 Presentation Prepared by Weijia Ran & Alessandro Del Ponte 1 Outline Graphs: Basic Graph Theory Concepts Directed Graphs Signed Graphs & Signed Directed Graphs

More information

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes Commun. Theor. Phys. (Beijing, China) 45 (2006) pp. 950 954 c International Academic Publishers Vol. 45, No. 5, May 15, 2006 Small World Properties Generated by a New Algorithm Under Same Degree of All

More information

Evolving Complex Neural Networks

Evolving Complex Neural Networks Evolving Complex Neural Networks Mauro Annunziato, Ilaria Bertini, Matteo De Felice, Stefano Pizzuti Energy, New technology and Environment Agency (ENEA) Via Anguillarese 30, 003 Rome, Italy {mauro.annunziato,

More information

Big Data Management and NoSQL Databases

Big Data Management and NoSQL Databases NDBI040 Big Data Management and NoSQL Databases Lecture 10. Graph databases Doc. RNDr. Irena Holubova, Ph.D. holubova@ksi.mff.cuni.cz http://www.ksi.mff.cuni.cz/~holubova/ndbi040/ Graph Databases Basic

More information

Nested (2, r)-regular Graphs and Their Network Properties. A thesis. presented to. the faculty of the Department of Mathematics

Nested (2, r)-regular Graphs and Their Network Properties. A thesis. presented to. the faculty of the Department of Mathematics Nested (, r-regular Graphs and Their Network Properties A thesis presented to the faculty of the Department of Mathematics East Tennessee State University In partial fulfillment of the requirements for

More information

Graph Theory for Network Science

Graph 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 information

Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Computer Network.

Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Computer Network. Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma Computer Network Introduction Prof. Agostino Poggi Summary Theory Data Transmission Packet Transmission

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Graph theory G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/37 Outline 1 Graph theory Undirected and directed graphs

More information

On the relationship between the algebraic connectivity and graph s robustness to node and link failures

On the relationship between the algebraic connectivity and graph s robustness to node and link failures On the relationship between the algebraic connectivity and graph s robustness to node and link failures A. Jamakovic, S. Uhlig Delft University of Technology Electrical Engineering, Mathematics and Computer

More information

Graph Algorithms using Map-Reduce. Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web

Graph Algorithms using Map-Reduce. Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some

More information

MultiDimensional Signal Processing Master Degree in Ingegneria delle Telecomunicazioni A.A

MultiDimensional Signal Processing Master Degree in Ingegneria delle Telecomunicazioni A.A MultiDimensional Signal Processing Master Degree in Ingegneria delle Telecomunicazioni A.A. 205-206 Pietro Guccione, PhD DEI - DIPARTIMENTO DI INGEGNERIA ELETTRICA E DELL INFORMAZIONE POLITECNICO DI BARI

More information

Randomized Rumor Spreading in Social Networks

Randomized Rumor Spreading in Social Networks Randomized Rumor Spreading in Social Networks Benjamin Doerr (MPI Informatics / Saarland U) Summary: We study how fast rumors spread in social networks. For the preferential attachment network model and

More information

Statistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv: v1 [physics.soc-ph] 12 May 2008

Statistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv: v1 [physics.soc-ph] 12 May 2008 Statistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv:0805.1712v1 [physics.soc-ph] 12 May 2008 Keumsook Lee a,b Woo-Sung Jung c Jong Soo Park d M. Y.

More information

Deterministic small-world communication networks

Deterministic small-world communication networks Information Processing Letters 76 (2000) 83 90 Deterministic small-world communication networks Francesc Comellas a,,javierozón a, Joseph G. Peters b a Departament de Matemàtica Aplicada i Telemàtica,

More information

Exploiting the Scale-free Structure of the WWW

Exploiting the Scale-free Structure of the WWW Exploiting the Scale-free Structure of the WWW Niina Päivinen Department of Computer Science, University of Kuopio P.O. Box 1627, FIN-70211 Kuopio, Finland email niina.paivinen@cs.uku.fi tel. +358-17-16

More information

Onset of traffic congestion in complex networks

Onset of traffic congestion in complex networks Onset of traffic congestion in complex networks Liang Zhao, 1,2 Ying-Cheng Lai, 1,3 Kwangho Park, 1 and Nong Ye 4 1 Department of Mathematics and Statistics, Arizona State University, Tempe, Arizona 85287,

More information

Graph theory: basic concepts

Graph theory: basic concepts Graph theory: basic concepts Graphs and networks allow modelling many different decision problems Graphs permit to represent relationships among different kinds of entities: Cities connected by roads Computers

More information

Power Grid Modeling Using Graph Theory and Machine Learning Techniques. by Daniel Duncan A PROJECT. submitted to. Oregon State University

Power Grid Modeling Using Graph Theory and Machine Learning Techniques. by Daniel Duncan A PROJECT. submitted to. Oregon State University Power Grid Modeling Using Graph Theory and Machine Learning Techniques by Daniel Duncan A PROJECT submitted to Oregon State University University Honors College in partial fulfillment of the requirements

More information

Graph-theoretic Properties of Networks

Graph-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 information

Cloud e Datacenter Networking

Cloud e Datacenter Networking Cloud e Datacenter Networking Università degli Studi di Napoli Federico II Dipartimento di Ingegneria Elettrica e delle Tecnologie dell Informazione DIETI Laurea Magistrale in Ingegneria Informatica Prof.

More information

Collaboration networks and innovation in Canada s ICT Hardware Cluster. Catherine Beaudry and Melik Bouhadra Polytechnique Montréal

Collaboration networks and innovation in Canada s ICT Hardware Cluster. Catherine Beaudry and Melik Bouhadra Polytechnique Montréal Collaboration networks and innovation in Canada s ICT Hardware Cluster Catherine Beaudry and Melik Bouhadra Polytechnique Montréal CDO Third Annual Network Conference April 26 th 2016 2 Agenda Research

More information

KNOWLEDGE ARCHITECTURE FOR ENVIRONMENT REPRESENTATION IN AUTONOMOUS AGENTS

KNOWLEDGE ARCHITECTURE FOR ENVIRONMENT REPRESENTATION IN AUTONOMOUS AGENTS KNOWLEDGE ARCHITECTURE FOR ENVIRONMENT REPRESENTATION IN AUTONOMOUS AGENTS Dario Maio, Stefano Rizzi DEIS - Facoltà di Ingegneria, Università di Bologna, Italy dmaio@deis.unibo.it, srizzi@deis.unibo.it

More information

Package DirectedClustering

Package DirectedClustering Type Package Package DirectedClustering Title Directed Weighted Clustering Coefficient Version 0.1.1 Date 2018-01-10 January 11, 2018 Author Gian Paolo Clemente[cre,aut], Rosanna Grassi [ctb] Maintainer

More information

Mining and Analyzing Online Social Networks

Mining and Analyzing Online Social Networks The 5th EuroSys Doctoral Workshop (EuroDW 2011) Salzburg, Austria, Sunday 10 April 2011 Mining and Analyzing Online Social Networks Emilio Ferrara eferrara@unime.it Advisor: Prof. Giacomo Fiumara PhD School

More information

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))

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)) 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 information

Network Mathematics - Why is it a Small World? Oskar Sandberg

Network Mathematics - Why is it a Small World? Oskar Sandberg Network Mathematics - Why is it a Small World? Oskar Sandberg 1 Networks Formally, a network is a collection of points and connections between them. 2 Networks Formally, a network is a collection of points

More information

Algorithms For Community Identification In Complex Networks

Algorithms For Community Identification In Complex Networks University of Central Florida Electronic Theses and Dissertations Doctoral Dissertation (Open Access) Algorithms For Community Identification In Complex Networks 2012 Mahadevan Vasudevan University of

More information

Structural and Temporal Properties of and Spam Networks

Structural and Temporal Properties of  and Spam Networks Technical Report no. 2011-18 Structural and Temporal Properties of E-mail and Spam Networks Farnaz Moradi Tomas Olovsson Philippas Tsigas Department of Computer Science and Engineering Chalmers University

More information

Redes Complexas: teoria, algoritmos e aplicações em computação Bloco #7

Redes Complexas: teoria, algoritmos e aplicações em computação Bloco #7 Redes Complexas: teoria, algoritmos e aplicações em computação Bloco #7 ``Security and Complex Networks Virgílio A. F. Almeida Outubro de 2009 D d Ciê i d C ã Departamento de Ciência da Computação Universidade

More information

Models for the growth of the Web

Models for the growth of the Web Models for the growth of the Web Chi Bong Ho Introduction Yihao Ben Pu December 6, 2007 Alexander Tsiatas There has been much work done in recent years about the structure of the Web and other large information

More information

The Evolution of the Mathematical Research Collaboration Graph

The Evolution of the Mathematical Research Collaboration Graph The Evolution of the Mathematical Research Collaboration Graph Jerrold W. Grossman Department of Mathematics and Statistics Oakland University Rochester, MI 48309-4485 e-mail: grossman@oakland.edu Abstract

More information

Graphs / Networks. CSE 6242/ CX 4242 Feb 18, Centrality measures, algorithms, interactive applications. Duen Horng (Polo) Chau Georgia Tech

Graphs / Networks. CSE 6242/ CX 4242 Feb 18, Centrality measures, algorithms, interactive applications. Duen Horng (Polo) Chau Georgia Tech CSE 6242/ CX 4242 Feb 18, 2014 Graphs / Networks Centrality measures, algorithms, interactive applications Duen Horng (Polo) Chau Georgia Tech Partly based on materials by Professors Guy Lebanon, Jeffrey

More information

Research on Community Structure in Bus Transport Networks

Research on Community Structure in Bus Transport Networks Commun. Theor. Phys. (Beijing, China) 52 (2009) pp. 1025 1030 c Chinese Physical Society and IOP Publishing Ltd Vol. 52, No. 6, December 15, 2009 Research on Community Structure in Bus Transport Networks

More information

arxiv:cond-mat/ v3 [cond-mat.dis-nn] 30 Jun 2005

arxiv:cond-mat/ v3 [cond-mat.dis-nn] 30 Jun 2005 arxiv:cond-mat/0505185v3 [cond-mat.dis-nn] 30 Jun 2005 Characterization of Complex Networks: A Survey of measurements L. da F. Costa F. A. Rodrigues G. Travieso P. R. Villas Boas Instituto de Física de

More information

Random Graphs CS224W

Random Graphs CS224W Random Graphs CS224W Network models Why model? simple representation of complex network can derive properties mathematically predict properties and outcomes Also: to have a strawman In what ways is your

More information

Introduction Types of Social Network Analysis Social Networks in the Online Age Data Mining for Social Network Analysis Applications Conclusion

Introduction Types of Social Network Analysis Social Networks in the Online Age Data Mining for Social Network Analysis Applications Conclusion Introduction Types of Social Network Analysis Social Networks in the Online Age Data Mining for Social Network Analysis Applications Conclusion References Social Network Social Network Analysis Sociocentric

More information

Engineering shortest-path algorithms for dynamic networks

Engineering shortest-path algorithms for dynamic networks Engineering shortest-path algorithms for dynamic networks Mattia D Emidio and Daniele Frigioni Department of Information Engineering, Computer Science and Mathematics, University of L Aquila, Via Gronchi

More information

Lesson 18. Laura Ricci 08/05/2017

Lesson 18. Laura Ricci 08/05/2017 Lesson 18 WATTS STROGATZ AND KLEINBERG MODELS 08/05/2017 1 SMALL WORLD NETWORKS Many real networks are characterized by a diameter very low. In several social networks, individuals tend to group in clusters

More information

Research Article Small-World and Scale-Free Network Models for IoT Systems

Research Article Small-World and Scale-Free Network Models for IoT Systems Hindawi Mobile Information Systems Volume 2017, Article ID 6752048, 9 pages https://doi.org/10.1155/2017/6752048 Research Article Small-World and Scale-Free Network Models for IoT Systems Insoo Sohn Division

More information

Models and Algorithms for Network Immunization

Models and Algorithms for Network Immunization Models and Algorithms for Network Immunization George Giakkoupis University of Toronto Aristides Gionis, Evimaria Terzi and Panayiotis Tsaparas University of Helsinki Abstract Recently, there has been

More information

Guest Editorial GEOFFREY S CANRIGHT, KENTH ENGØ-MONSEN. graph), and a variety of interesting applications of this concept.

Guest Editorial GEOFFREY S CANRIGHT, KENTH ENGØ-MONSEN. graph), and a variety of interesting applications of this concept. Guest Editorial GEOFFREY S CANRIGHT, KENTH ENGØ-MONSEN Geoffrey S. Canright is senior researcher in Telenor R&I This issue of Telektronikk is devoted to network analysis. You, the reader, may immediately

More information

Discovery of Community Structure in Complex Networks Based on Resistance Distance and Center Nodes

Discovery of Community Structure in Complex Networks Based on Resistance Distance and Center Nodes Journal of Computational Information Systems 8: 23 (2012) 9807 9814 Available at http://www.jofcis.com Discovery of Community Structure in Complex Networks Based on Resistance Distance and Center Nodes

More information

Mathematics of Networks II

Mathematics of Networks II Mathematics of Networks II 26.10.2016 1 / 30 Definition of a network Our definition (Newman): A network (graph) is a collection of vertices (nodes) joined by edges (links). More precise definition (Bollobàs):

More information

Research on Social Network Structure and Public Opinions Dissemination of Micro-blog Based on Complex Network Analysis

Research on Social Network Structure and Public Opinions Dissemination of Micro-blog Based on Complex Network Analysis JOURNAL OF NETWORKS, VOL. 8, NO. 7, JULY 2013 1543 Research on Social Network Structure and Public Opinions Dissemination of Micro-blog Based on Complex Network Analysis Xin Jin and Yaohua Wang School

More information

Graph Theory for Network Science

Graph 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 information

Introduction to Network Analysis. Some materials adapted from Lada Adamic, UMichigan

Introduction to Network Analysis. Some materials adapted from Lada Adamic, UMichigan Introduction to Network Analysis Some materials adapted from Lada Adamic, UMichigan Outline n the role of networks in life, nature, and research n why model networks: structure & dynamics n models (structure):

More information

Rumour spreading in the spatial preferential attachment model

Rumour spreading in the spatial preferential attachment model Rumour spreading in the spatial preferential attachment model Abbas Mehrabian University of British Columbia Banff, 2016 joint work with Jeannette Janssen The push&pull rumour spreading protocol [Demers,

More information

Evolutionary Complex Neural Networks

Evolutionary Complex Neural Networks Evolutionary Complex Neural Networks Mauro Annunziato, Ilaria Bertini, Matteo De Felice, Stefano Pizzuti ENEA Energy, New technologies and Environment Agency Casaccia R.C. - Via Anguillarese 301, 00123

More information

An Introduction to Graph Theory

An Introduction to Graph Theory An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and

More information

NETWORK LITERACY. Essential Concepts and Core Ideas

NETWORK LITERACY. Essential Concepts and Core Ideas NETWORK LITERACY Essential Concepts and Core Ideas As our world becomes increasingly connected through the use of networks that allow instantaneous communication and the spread of information, the degree

More information

Systems, ESD.00. Networks II. Lecture 8. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow

Systems, ESD.00. Networks II. Lecture 8. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow Introduction to Engineering Systems, ESD.00 Networks II Lecture 8 Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow Outline Introduction to networks Infrastructure networks Institutional

More information

Error and Attack Tolerance of Scale-Free Networks: Effects of Geometry

Error and Attack Tolerance of Scale-Free Networks: Effects of Geometry Error and Attack Tolerance of Scale-Free Networks: Effects of Geometry Advisor: Prof. Hawoong Jeong A thesis submitted to the faculty of the KAIST in partial fulfillment of the requirements for the degree

More information

A Multi-Layer Model for the Web Graph

A Multi-Layer Model for the Web Graph A Multi-Layer Model for the Web Graph L. Laura S. Leonardi G. Caldarelli P. De Los Rios April 5, 2002 Abstract This paper studies stochastic graph models of the WebGraph. We present a new model that describes

More information

A Topological Network Analysis of Greek Firms

A Topological Network Analysis of Greek Firms A Topological Network Analysis of Greek Firms Kydros Dimitrios, Lecturer 1 * Notopoulos Panagiotis, Assoc. Professor* Kaparis Anastasios, Visiting Lecturer* *TEI of Serres School of Economics and Administration

More information

Sampling Large Graphs for Anticipatory Analysis

Sampling Large Graphs for Anticipatory Analysis Sampling Large Graphs for Anticipatory Analysis Lauren Edwards*, Luke Johnson, Maja Milosavljevic, Vijay Gadepally, Benjamin A. Miller IEEE High Performance Extreme Computing Conference September 16, 2015

More information

Graph Data Management Systems in New Applications Domains. Mikko Halin

Graph Data Management Systems in New Applications Domains. Mikko Halin Graph Data Management Systems in New Applications Domains Mikko Halin Introduction Presentation is based on two papers Graph Data Management Systems for New Application Domains - Philippe Cudré-Mauroux,

More information

Forms of communication in 21 st century. "Successful Communication-The future of Europe"

Forms of communication in 21 st century. Successful Communication-The future of Europe Forms of communication in 21 st century "Successful Communication-The future of Europe" Definition of Communication The roots of the word communication (communis, or common) accurately portray its purpose.

More information

Task Assignment Problem in Camera Networks

Task Assignment Problem in Camera Networks Task Assignment Problem in Camera Networks Federico Cerruti Mirko Fabbro Chiara Masiero Corso di laurea in Ingegneria dell Automazione Università degli Studi di Padova Progettazione di sistemi di controllo

More information

Introduction To Graphs and Networks. Fall 2013 Carola Wenk

Introduction To Graphs and Networks. Fall 2013 Carola Wenk Introduction To Graphs and Networks Fall 2013 Carola Wenk What is a Network? We have thought of a computer as a single entity, but they can also be connected to one another. Internet What are the advantages

More information

Reply Networks on Bulletin Board System

Reply Networks on Bulletin Board System APS/123-QED Reply Networks on Bulletin Board System Kou Zhongbao and Zhang Changshui State Key Laboratory of Intelligent Technology and Systems Department of Automation, Tsinghua University Beijing, 100084,

More information