In765 Knowledge Networks: A Structural Study of Networks Judith Molka-Danielsen Molde University College

Slides:



Advertisements
Similar presentations
Six degrees: The science of a connected age By Duncan J. Watts Brian Lewis INF 385Q December 1, 2005 Brian Lewis INF 385Q December 1, 2005.
Advertisements

Classes will begin shortly. Networks, Complexity and Economic Development Class 5: Network Dynamics.
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Routing in Poisson small-world networks A. J. Ganesh Microsoft Research, Cambridge Joint work with Moez Draief.
The Structure of the Web Mark Levene (Follow the links to learn more!)
Measurement and Analysis of Online Social Networks 1 A. Mislove, M. Marcon, K Gummadi, P. Druschel, B. Bhattacharjee Presentation by Shahan Khatchadourian.
Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Topology and Dynamics of Complex Networks FRES1010 Complex Adaptive Systems Eileen Kraemer Fall 2005.
Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Complex Network Theory
Complex Networks Advanced Computer Networks: Part1.
Scale Free Networks.
Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU
The Small World Phenomenon: An Algorithmic Perspective Speaker: Bradford Greening, Jr. Rutgers University – Camden.
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
Small-world networks.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Influence and Correlation in Social Networks Xufei wang Nov
Analysis and Modeling of Social Networks Foudalis Ilias.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Exp. vs. Scale-Free Poisson distribution Exponential Network Power-law distribution Scale-free Network.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
From Complex Networks to Human Travel Patterns Albert-László Barabási Center for Complex Networks Research Northeastern University Department of Medicine.
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.
Global topological properties of biological networks.
IN765 Knowledge Networks Introductions Judith Molka-Danielsen 2005 Reference: LINKED by Albert-László Barábasi.
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.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Stefano Boccaletti Complex networks in science and society *Istituto Nazionale di Ottica Applicata - Largo E. Fermi, Florence, ITALY *CNR-Istituto.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Complex Network Theory – An Introduction Niloy Ganguly.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Complex Network Theory – An Introduction Niloy Ganguly.
LECTURE 2 1.Complex Network Models 2.Properties of Protein-Protein Interaction Networks.
Social Networking: Large scale Networks
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Analyzing Networks. Milgram’s Experiments “Six degrees of Separation” Milgram’s letters to various recruits in Nebraska who were asked to forward the.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Network Science Overview (2)
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Lecture 23: Structure of Networks
Structures of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Complex Networks
A Network Model of Knowledge Acquisition
Lecture 23: Structure of Networks
The Watts-Strogatz model
Social Network Analysis
Classes will begin shortly
Peer-to-Peer and Social Networks Fall 2017
Department of Computer Science University of York
Topology and Dynamics of Complex Networks
Peer-to-Peer and Social Networks
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Diffusion in Networks
Navigation and Propagation in Networks
Advanced Topics in Data Mining Special focus: Social Networks
From Connections to Function: The Mouse Brain Connectome Atlas
Presentation transcript:

In765 Knowledge Networks: A Structural Study of Networks Judith Molka-Danielsen Molde University College

Types of Networks.. Social Networks Friends, families, colleagues Logical Resources web-pages,P2P-Gnutella Telephone Wireline, mobile Transport Roads, railroads, airline, electricity Economic Firms, markets, organization Physical Resources Internet IP routers

Why Study Networks? Research Areas  Availability and vulnerability of services: electric, telephone, air connections, etc.  Preventing or stopping of viruses on data networks.  The importance of weak ties: connectivness to the core, finding a job, finding a web page.  The characterization of network structure and the role of hubs in the spreading an idea, or proliferation of a product, and managing organizations.

Former Research  Random Network Theory –Erdös & Rényi (1960)  Six Degrees of Separation –S.Milgram (1967)  Cluster Coefficient –Small Worlds – Watts & Strogatz (1998)  Hubs and Scale Free Networks – Albert, Jeong, & Barab á si (1999)  Hubs in Social Networks – Malcolm Gladwell (2000)

Random Networks Erdös-Rényi model (1960) - Democratic - Random Pál Erdös ( ) Connect with probability p p=1/6 N=10  k  ~ 1.5 Poisson distribution

Six Degrees of Separation Nodes: individuals Links: social relationship (family/work/friendship/etc.) S. Milgram (1967) Social networks: Many individuals with diverse social interactions between them. John Guare (1980) Six Degrees of Separation

Cluster Coefficient Clustering: My friends will likely know each other! Probability to be connected C » p C = # of links between 1,2,…n neighbors n(n-1)/2 C friends = 15/ [6(5)/2] = 100%

Hubs in Networks  200 million searches each day  More than 2300 searches per second  In 88 languages  3.2 billion web pages indexed.  super computers perform the searches.

Do we find Hubs in Social Networks? Yes.  Most influencial  Access to the most information  Impacts others decisions most  Have the most power

Who do you know? (similar to a study by Malcolm Gladwell, 2000)  Bjørnstjerne Bjørnsons Vei  Alme Jørund  Andenes Aud  Andestad Reidar  Bakke Gerd Inger  Bergseth Egil  Bergtun Lill Eldrid  Bjøringsøy Karl Magnar  Bjørkly Jorunn  Bjørkly Åsa Bjordal  Bjørnebo Solveig Randi Midtbø  Broks Vivi-Annie  Brokstad Jon  Drageseth Dagfinn  Dyrli Janne Merete  Døving Ellen  Eilertsen Gudny  Flø Jorunn Marie  Fylling Lars Kristen Tovan  Gjære Arne  Gjære Guro Wiersholm  Gjære Vibeke Wiersholm  Grønbugt Rutt  Grønset Erling Rune  Gudbrandsen Åste Einbu  Gøncz Geir Janos  Göncz Arne  Hansen Helge  Hansen Sissel  Helde Marit Illøkken  Henriksen Line  Hjelmsøt Maria  Hoem Jermund  Hofset Siv  Jenset Grete  Jenset Torbjørn  Jordet Birgit  Kanestrøm Andreas Julshamn  …

A = number of persons known on the list. B = number of persons (nodes) that person A knows. AB AB Who do you know?: survey to faculty gruppert 22

AB AB Who do you know?: survey to students gruppert 48 A = number of persons known on the list. B = number of persons (nodes) that person A knows.

Scale Free Networks and Power Laws by Albert, Jeong, Barabasi.

Collaboration Among Researchers Networks have diverse nodes and links are -computers -routers -satellites - researchers -phone lines -TV cables -EM waves - co-authorship

Unique co-author link distribution – researchers represented individually

Unique Co-Authors versus Publications

Average # of Co-Authors versus Publications

Informatics Institute Cluster: researchers and co-author links

Health Institute Cluster: researchers and co-author links

Social Sciences Institute: researchers and co-author links

Economics/Logistics Cluster: researchers and co-author links

Economics Institute Cluster: researchers and co-author links

Connected Network Tree of researchers and co-author links

Conclusions  Network of researchers at HSM is a Scale Free network. (existance of hubs, clustering coeffiencient)  Co-authors are not chosen randomly.  Co-authorship & Publication count: (cannot claim causality) –Average # of co-author per paper is the same regardless of the total # of publications per author. (does not help) –Average # of unique associations is related to a total # of publications per author. (helps)  Role of “ connectors” (nodes with a high # of external links) are important –They often have high publication counts. –They have more external contacts. –They are more likely to hold a joint appointment (again not causal).