WLU Mathematics Department Seminar March 12, The Web Graph. Anthony Bonato. Wilfrid Laurier University. Waterloo, Canada
|
|
- Bartholomew Bryan
- 6 years ago
- Views:
Transcription
1 WLU Mathematics Department Seminar March 12, 2007 The Web Graph Anthony Bonato Wilfrid Laurier University Waterloo, Canada
2 Graph theory the last century 4/27/2007 The web graph - Anthony Bonato 2
3 Today 4/27/2007 The web graph - Anthony Bonato 3
4 a graph G=(V,E) consists of a nonempty set of vertices or nodes V, and a set of edges E, which is a reflexive, symmetric binary relation on V in directed graphs E need not be symmetric nodes edges 4/27/2007 The web graph - Anthony Bonato 4
5 The web graph/network nodes: web pages edges: links 4/27/2007 The web graph - Anthony Bonato 5
6 Google uses graph theory! 4/27/2007 The web graph - Anthony Bonato 6
7 How big is the web? The web is really infinite calendars, online organizers random strings: google raingod random strings Total web 54 billion static pages (Hirate, Kato, Yamana, 07) 4/27/2007 The web graph - Anthony Bonato 7
8 Collaboration networks nodes: mathematicians edges: co-authoring 4/27/2007 The web graph - Anthony Bonato 8
9 4/27/2007 The web graph - Anthony Bonato 9
10 Social networks nodes: people edges: social interaction (eg friendship, co-authorship, sexual relations) 4/27/2007 The web graph - Anthony Bonato 10
11 Biological networks nodes: proteins edges: biochemical interactions 4/27/2007 The web graph - Anthony Bonato 11
12 Hollywood network nodes: actors edges: star in same movie 4/27/2007 The web graph - Anthony Bonato 12
13 The web graph and related networks above are often called: self-organizing scale-free massive complex heterogeneous 4/27/2007 The web graph - Anthony Bonato 13
14 Important graph parameters distance degree diameter of between of a G, vertex diam(g) nodes, x in G, deg G (x,y) G (x) G deg diam(g)=3 G (1,6)=3 G (1)=2 deg G (6)=1 4/27/2007 The web graph - Anthony Bonato 14
15 Power laws in web graph P( k ) k b for some b>1 ratio of # nodes of degree k, to # nodes Broder et al, 01 4/27/2007 The web graph - Anthony Bonato 15
16 Interpreting a power law Many lowdegree nodes Few highdegree nodes 4/27/2007 The web graph - Anthony Bonato 16
17 Binomial Power law Highway network Air traffic network 4/27/2007 The web graph - Anthony Bonato 17
18 Other properties of self-organizing networks small world topology (Watts, Strogatz, 98): low diameter/average distance diameter of the web: 19 globally sparse, locally dense rich bipartite structures (Kumar et al, 00) 4/27/2007 The web graph - Anthony Bonato 18
19 Random graphs Paul Erdős Alfred Rényi 4/27/2007 The web graph - Anthony Bonato 19
20 4/27/2007 The web graph - Anthony Bonato 20
21 G(n,p) random graph model (Erdős, Rényi, 63) p a real number in (0,1), n a positive integer G(n,p): probability space on graphs with nodes {1,,n}, two nodes joined independently and with probability p 4/27/2007 The web graph - Anthony Bonato 21
22 Properties of G(n,p) Almost regular: node degrees concentrated around np Degree distribution is binomial Low diameter, low clustering, rich but uniform substructures 4/27/2007 The web graph - Anthony Bonato 22
23 G(n,p) as a model for the web graph Pros: Cons Corpus of existing literature:large arsenal of tools Independence Binomial degree distribution Independence Off-line 4/27/2007 The web graph - Anthony Bonato 23
24 (Bonato, 04) A model for selforganizing networks should have the following properties: 1. On-line property. The number of nodes and edges changes with time. 2. Power law degree distribution. 3. Small world property. 4. Many bipartite substructures. 4/27/2007 The web graph - Anthony Bonato 24
25 Preferential attachment (PA) model (Barabási, Albert, 99), (Bollobás et al, 01) Parameter: m a positive integer At time 0, add a single edge At time t+1, add m edges from a new node v t+1 to existing nodes the edge v t+1 v s is added with probability deg Gt 2t ( ) v s 4/27/2007 The web graph - Anthony Bonato 25
26 Simulation of the model: m=1 Wilensky, U. (2005). NetLogo Preferential Attachment model. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL. 4/27/2007 The web graph - Anthony Bonato 26
27 Theorem (Bollobás et al, 01) Fix m a positive integer and fix ε > 0. For k a non-negative integer, define α m,k = 2m( m+1) ( k + m) ( k + m +1) ( k + m + 2) Then with probability tending to 1 as t, for all k satisfying 0 k t 1/5 ( 1 ε ) α m, k P tm ( k) ( 1+ ε ) α m, k G 4/27/2007 The web graph - Anthony Bonato 27
28 Theorem (Bollobás, Riordan, 04) Fix an integer m 1 and a positive real number ε. With probability 1 as t, G m (t) is connected and log t log log ( ) ( t 1 ε diam G ) ( 1 + ε ) t m log log t log t 4/27/2007 The web graph - Anthony Bonato 28
29 Other web graph models (Aiello, Chung Lu, 01) ACL. (Chung, Lu, 03) CL. (Kumar et al, 99) Copying model. (Chung, Lu, 04) CL-del growth-deletion model. (Cooper, Frieze, Vera, 04) CFV growth-deletion model. 4/27/2007 The web graph - Anthony Bonato 29
30 Properties of the models Model Online Power law Small world Bipartite Subgraphs PA Y Y Y? 3 ACL Y Y? N (2, ) CL N Y Y? (2, ) Copying Y Y? Y (2, ) CL-del Y Y Y? (2, ) CFV Y Y?? (2, ) b 4/27/2007 The web graph - Anthony Bonato 30
31 Open problem Design a model that provably has all of the four properties. 4/27/2007 The web graph - Anthony Bonato 31
32 Google and graph theory major component of Google s rankings: PageRank PageRank is a measure of the popularity of a page as a function of its indegree 4/27/2007 The web graph - Anthony Bonato 32
33 Pagerank PageRank is models the probability web surfing a random via a surfer random visits walka page surfer usually moves via out-links on occasion, the surfer teleports to a random page 4/27/2007 The web graph - Anthony Bonato 33
34 The Google Matrix given a digraph G with vertices {1,,n}, define the matrix P 1 form P 2 by replacing entries in zero rows of P 1 by 1/n define the Google matrix P as - c in (0,1) is the teleportation constant 4/27/2007 The web graph - Anthony Bonato 34
35 1 2 G 3 4 P(G) 4/27/2007 The web graph - Anthony Bonato 35
36 it can be shown that PageRank is the dominant eigenvector s of P, normalized so the sum of entries is 1 reduces to computing an eigenvector of an order 54 billion matrix numerical short-cut: power method applied to sparse matrices 4/27/2007 The web graph - Anthony Bonato 36
37 /27/2007 The web graph - Anthony Bonato 37
38 Infinite graphs A new research direction: As time tends to in on-line models, number of nodes grows Consider infinite limit: union of chain of nodes and edges Limit behaviour studied in other disciplines: Economics (continuum of agents) Physics(lattice structures) 4/27/2007 The web graph - Anthony Bonato 38
39 Infinite limit graph loses some properties of finite system: -nodes have infinite degree Certain structural properties are magnified: -self-similarity 4/27/2007 The web graph - Anthony Bonato 39
40 Theorem (Erdős,Rényi, 63): The random process generates a unique isomorphism type of graph with probability 1. paradoxical: random process with deterministic conclusion 4/27/2007 The web graph - Anthony Bonato 40
41 Infinite random graph unique isomorphism type, R Infinite random graph, Rado graph, universal homogeneous graph, R focus of intensive research for over 50 years Graph theorists Logicians Probabilists Group and semigroup theorists Topologists 4/27/2007 The web graph - Anthony Bonato 41
42 Homogeneity A graph G is homogeneous if each isomorphism between finite induced subgraphs extends to an automorphism of G. strongest symmetry a graph can possess for example C 5 is homogeneous, but C 6 is not R is homogeneous (by a back-and-forth argument) Countable homogeneous graphs were classified by: Gardiner, Sheehan, Gol fand & Klin: finite case, 1970 s Lachlan & Woodrow: infinite case, 1980 s there are countably many countable homogeneous graphs 4/27/2007 The web graph - Anthony Bonato 42
43 Isotropic graphs A graph G which is the limit of a sequence (G : t t 0) is isotropic if for all t 0 >0 there is an isomorphic copy of G contained in limg t t 0 t G 4/27/2007 The web graph - Anthony Bonato 43
44 isotropic anisotropic 4/27/2007 The web graph - Anthony Bonato 44
45 Limits of models of self-organizing networks are: isotropic and heterogeneous Self-organizing networks are: self-similar and heterogeneous 4/27/2007 The web graph - Anthony Bonato 45
46 Copying models New nodes copy some of the link structure of an existing node Motivation: 1. web page generation 2. mutation in biology 4/27/2007 The web graph - Anthony Bonato 46
47 Copying model for W: R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, Stochastic models for the web graph, In: Proceedings of the 41th IEEE Symp. on Foundations of Computer Science, (2000) Duplication model for biological networks: F.R.K. Chung, G. Dewey, D.J. Galas, L. Lu, Duplication models for biological networks, Journal of Computational Biology 10 (2003) Generalized copying model: generalizes and unifies the above A. Bonato, J. Janssen, in preparation. 4/27/2007 The web graph - Anthony Bonato 47
48 N(v) v N(u) u y x 4/27/2007 The web graph - Anthony Bonato 48
49 Limits of copying models (Bonato,Janssen, 04) start with a finite initial graph H at each time-step, choose a node u, and choose a subset S of N(u) add a node z joined to S do for all u and S resulting limit is R H 4/27/2007 The web graph - Anthony Bonato 49
50 Non-isomorphic R H The graph R H admits a homomorphism to H (using a greedy colouring) There are infinitely many non-isomorphic R H for example, R K3 is not isomorphic to R K4 4/27/2007 The web graph - Anthony Bonato 50
51 Properties of R H with probability 1, limits of graphs generated by duplication model (with initial graph H) isomorphic to R H inexhaustible: for all nodes x, R H -x isomorphic to R H isomorphism type related to dismantling orderings on finite graphs studied by (Nowakowski, Winkler, 83) rich endomorphisms (Bonato, P. Cameron, Delic, 06) heterogeneous, isotropic 4/27/2007 The web graph - Anthony Bonato 51
52 Limits for PA models (J. Kleinberg, R. Kleinberg,05) considered limits of preferential attachment models limits of PA models: m=1,2: unique limit m>2: limit not unique proofs use martingale techniques heterogeneous, isotropic 4/27/2007 The web graph - Anthony Bonato 52
53 A new geometric model for the web Idea: web pages exist in a topic-space (similar to word-document space, used in text-mining) a page is more likely to link to pages close to it in topic-space 4/27/2007 The web graph - Anthony Bonato 53
54 Random geometric graphs well-studied alternative to G(n,p) (Frieze et al.,04) proposes a geometric PA model for the web graph drawback: new nodes need global knowledge 4/27/2007 The web graph - Anthony Bonato 54
55 Locally Random Geometric (LRG) model (Bonato,Cooper,Janssen, 07) on-line model generating directed graphs parameter: p a real number in (0,1] let S be a sphere in R 3 with radius 1 at time 0, add a single node chosen u.a.r. at time t, each node v has a neighbourhood of influence B v with radius ( v) deg + G 1 t t at time t+1, node z is added with position u.a.r. on S if z is in B v, then add (z,v) independently with probability p 4/27/2007 The web graph - Anthony Bonato 55
56 As nodes are born, they are more likely to enter some B v with larger radius (indegree) Over time, a power law degree distribution results 4/27/2007 The web graph - Anthony Bonato 56
57 Theorem (Bonato, Cooper, Janssen, 07) With probability 1, the LRG model generates power law graphs with exponent 1 1+ [2, ) p other properties under investigation: sparse cuts, local structure, diameter 4/27/2007 The web graph - Anthony Bonato 57
58 Research Directions 1. Limits of graphs generated by models. graph searching and sweeping, graph homomorphisms, endo/automorphisms, adjacency properties. 2. Global theory for self-organizing networks. definitions, concentration results (eg via differential equations); node deletion models. 3. Dynamics in networks. modelling viruses and worms, network attacks, network congestion and routing. 4/27/2007 The web graph - Anthony Bonato 58
59 Preprints, reprints, contact: Google: Anthony Bonato 4/27/2007 The web graph - Anthony Bonato 59
60 new book by me: A course on the web graph due out later this year Fall 07 term: MA338 Graph Theory MWF 1:30 2:20 pm 4/27/2007 The web graph - Anthony Bonato 60
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 informationDISTINGUISHING NUMBER AND ADJACENCY PROPERTIES
DISTINGUISHING NUMBER AND ADJACENCY PROPERTIES ANTHONY BONATO AND DEJAN DELIĆ Dedicated to the memory of Roland Fraïssé. Abstract. The distinguishing number of countably infinite graphs and relational
More informationDISTINGUISHING NUMBER AND ADJACENCY PROPERTIES
DISTINGUISHING NUMBER AND ADJACENCY PROPERTIES ANTHONY BONATO AND DEJAN DELIĆ Dedicated to the memory of Roland Fraïssé. Abstract. The distinguishing number of countably infinite graphs and relational
More informationConnected-homogeneous graphs
Connected-homogeneous graphs Robert Gray BIRS Workshop on Infinite Graphs October 2007 1 / 14 Homogeneous graphs Definition A graph Γ is called homogeneous if any isomorphism between finite induced subgraphs
More informationINFINITE RANDOM GEOMETRIC GRAPHS EXTENDED ABSTRACT
INFINITE RANDOM GEOMETRIC GRAPHS EXTENDED ABSTRACT ANTHONY BONATO AND JEANNETTE JANSSEN Abstract. We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in
More informationStructures with lots of symmetry
Structures with lots of symmetry (one of the things Bob likes to do when not doing semigroup theory) Robert Gray Centro de Álgebra da Universidade de Lisboa NBSAN Manchester, Summer 2011 Why? An advertisement
More informationInfinite locally random graphs
Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph
More informationTopic 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 informationDistances in power-law random graphs
Distances in power-law random graphs Sander Dommers Supervisor: Remco van der Hofstad February 2, 2009 Where innovation starts Introduction There are many complex real-world networks, e.g. Social networks
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationA geometric model for on-line social networks
WOSN 10 June 22, 2010 A geometric model for on-line social networks Anthony Bonato Ryerson University Geometric model for OSNs 1 Complex Networks web graph, social networks, biological networks, internet
More informationCS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS
CS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS Overview of Networks Instructor: Yizhou Sun yzsun@cs.ucla.edu January 10, 2017 Overview of Information Network Analysis Network Representation Network
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 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 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 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 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 informationRandomized 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 informationLesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008
Lesson 4 Random graphs Sergio Barbarossa Graph models 1. Uncorrelated random graph (Erdős, Rényi) N nodes are connected through n edges which are chosen randomly from the possible configurations 2. Binomial
More informationModels 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 informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu HITS (Hypertext Induced Topic Selection) Is a measure of importance of pages or documents, similar to PageRank
More information6. Overview. L3S Research Center, University of Hannover. 6.1 Section Motivation. Investigation of structural aspects of peer-to-peer networks
, University of Hannover Random Graphs, Small-Worlds, and Scale-Free Networks Wolf-Tilo Balke and Wolf Siberski 05.12.07 * Original slides provided by K.A. Lehmann (University Tübingen, Germany) 6. Overview
More informationCSCI5070 Advanced Topics in Social Computing
CSCI5070 Advanced Topics in Social Computing Irwin King The Chinese University of Hong Kong king@cse.cuhk.edu.hk!! 2012 All Rights Reserved. Outline Graphs Origins Definition Spectral Properties Type of
More informationOverlay (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 informationSummary: What We Have Learned So Far
Summary: What We Have Learned So Far small-world phenomenon Real-world networks: { Short path lengths High clustering Broad degree distributions, often power laws P (k) k γ Erdös-Renyi model: Short path
More informationPeer-to-Peer Data Management
Peer-to-Peer Data Management Wolf-Tilo Balke Sascha Tönnies Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 10. Networkmodels 1. Introduction Motivation
More informationA 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 informationGraph Model Selection using Maximum Likelihood
Graph Model Selection using Maximum Likelihood Ivona Bezáková Adam Tauman Kalai Rahul Santhanam Theory Canal, Rochester, April 7 th 2008 [ICML 2006 (International Conference on Machine Learning)] Overview
More informationUNIVERSITA DEGLI STUDI DI CATANIA FACOLTA DI INGEGNERIA
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.
More informationA Study of Random Duplication Graphs and Degree Distribution Pattern of Protein-Protein Interaction Networks
A Study of Random Duplication Graphs and Degree Distribution Pattern of Protein-Protein Interaction Networks by Zheng Ma A thesis presented to the University of Waterloo in fulfillment of the thesis requirement
More informationRegular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles
Regular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles ANDRZEJ DUDEK ALAN FRIEZE ANDRZEJ RUCIŃSKI MATAS ŠILEIKIS March 15, 2013 Abstract We present results from two papers by the authors on
More informationExample for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows)
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows) Average clustering coefficient of a graph Overall measure
More informationTitle Edge-minimal graphs of exponent 2
Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the published version when available. Title Edge-minimal graphs of exponent 2 Author(s) O'Mahony, Olga Publication
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More information1 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 informationMAE 298, Lecture 9 April 30, Web search and decentralized search on small-worlds
MAE 298, Lecture 9 April 30, 2007 Web search and decentralized search on small-worlds Search for information Assume some resource of interest is stored at the vertices of a network: Web pages Files in
More informationNetwork 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 informationMathematics of networks. Artem S. Novozhilov
Mathematics of networks Artem S. Novozhilov August 29, 2013 A disclaimer: While preparing these lecture notes, I am using a lot of different sources for inspiration, which I usually do not cite in the
More informationSmall-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 informationCentralities (4) By: Ralucca Gera, NPS. Excellence Through Knowledge
Centralities (4) By: Ralucca Gera, NPS Excellence Through Knowledge Some slide from last week that we didn t talk about in class: 2 PageRank algorithm Eigenvector centrality: i s Rank score is the sum
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 informationThe Establishment Game. Motivation
Motivation Motivation The network models so far neglect the attributes, traits of the nodes. A node can represent anything, people, web pages, computers, etc. Motivation The network models so far neglect
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 informationLink Structure Analysis
Link Structure Analysis Kira Radinsky All of the following slides are courtesy of Ronny Lempel (Yahoo!) Link Analysis In the Lecture HITS: topic-specific algorithm Assigns each page two scores a hub score
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
More informationAn Evolving Network Model With Local-World Structure
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 47 423 An Evolving Network odel With
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu How to organize the Web? First try: Human curated Web directories Yahoo, DMOZ, LookSmart Second
More informationHyperbolic Geometry of Complex Network Data
Hyperbolic Geometry of Complex Network Data Konstantin Zuev http://www.its.caltech.edu/~zuev/ Joint work with D. Krioukov, M. Boguñá, and G. Bianconi CMX seminar, Caltech May 24, 2017 How do complex networks
More informationThomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6
More information16 1. The Basics. x = t 1 >...>t k <...<t n = y
16 1. The Basics [8.2.3] [8.6.8] Lemma 1.5.5. Let T be a normal tree in G. (i) Any two vertices x, y T are separated in G by the set x y. (ii) If S V (T )=V(G) and S is down-closed, then the components
More informationM.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 informationTopology Enhancement in Wireless Multihop Networks: A Top-down Approach
Topology Enhancement in Wireless Multihop Networks: A Top-down Approach Symeon Papavassiliou (joint work with Eleni Stai and Vasileios Karyotis) National Technical University of Athens (NTUA) School of
More information8.1 Basic notions, facts and techniques
8 Infinite Graphs The study of infinite graphs is an attractive, but often neglected, part of graph theory. This chapter aims to give an introduction that starts gently, but then moves on in several directions
More informationA Survey of Mathematics with Applications 8 th Edition, 2009
A Correlation of A Survey of Mathematics with Applications 8 th Edition, 2009 South Carolina Discrete Mathematics Sample Course Outline including Alternate Topics and Related Objectives INTRODUCTION This
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 information(Social) Networks Analysis III. Prof. Dr. Daning Hu Department of Informatics University of Zurich
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Outline Network Topological Analysis Network Models Random Networks Small-World Networks Scale-Free Networks
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
More informationThe 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 informationEdge-minimal graphs of exponent 2
JID:LAA AID:14042 /FLA [m1l; v1.204; Prn:24/02/2017; 12:28] P.1 (1-18) Linear Algebra and its Applications ( ) Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa
More informationRandom Simplicial Complexes
Random Simplicial Complexes Duke University CAT-School 2015 Oxford 9/9/2015 Part II Random Geometric Complexes Contents Probabilistic Ingredients Random Geometric Graphs Definitions Random Geometric Complexes
More informationData mining --- mining graphs
Data mining --- mining graphs University of South Florida Xiaoning Qian Today s Lecture 1. Complex networks 2. Graph representation for networks 3. Markov chain 4. Viral propagation 5. Google s PageRank
More informationResearch Proposal. Guo, He. November 3rd, 2016
1 Research Proposal Guo, He November 3rd, 2016 1 Introduction Can the special structure possessed by social networks be exploited algorithmically? Answering this question requires a formal definition of
More informationCritical Phenomena in Complex Networks
Critical Phenomena in Complex Networks Term essay for Physics 563: Phase Transitions and the Renormalization Group University of Illinois at Urbana-Champaign Vikyath Deviprasad Rao 11 May 2012 Abstract
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 informationarxiv: v1 [math.co] 20 Nov 2013
HOMOGENEOUS 2-PARTITE DIGRAPHS arxiv:1311.5056v1 [math.co] 20 Nov 2013 MATTHIAS HAMANN Abstract. We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects
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 informationDrawing power law graphs
Drawing power law graphs Reid Andersen Fan Chung Linyuan Lu Abstract We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationLecture 2: From Structured Data to Graphs and Spectral Analysis
Lecture 2: From Structured Data to Graphs and Spectral Analysis Radu Balan February 9, 2017 Data Sets Today we discuss type of data sets and graphs. The overarching problem is the following: Main Problem
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationSocial Network Analysis
Social Network Analysis Giri Iyengar Cornell University gi43@cornell.edu March 14, 2018 Giri Iyengar (Cornell Tech) Social Network Analysis March 14, 2018 1 / 24 Overview 1 Social Networks 2 HITS 3 Page
More informationExtremal Graph Theory. Ajit A. Diwan Department of Computer Science and Engineering, I. I. T. Bombay.
Extremal Graph Theory Ajit A. Diwan Department of Computer Science and Engineering, I. I. T. Bombay. Email: aad@cse.iitb.ac.in Basic Question Let H be a fixed graph. What is the maximum number of edges
More informationErdös-Rényi Graphs, Part 2
Graphs and Networks Lecture 3 Erdös-Rényi Graphs, Part 2 Daniel A. Spielman September 5, 2013 3.1 Disclaimer These notes are not necessarily an accurate representation of what happened in class. They are
More informationThe Structure of Information Networks. Jon Kleinberg. Cornell University
The Structure of Information Networks Jon Kleinberg Cornell University 1 TB 1 GB 1 MB How much information is there? Wal-Mart s transaction database Library of Congress (text) World Wide Web (large snapshot,
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 informationIntro to Random Graphs and Exponential Random Graph Models
Intro to Random Graphs and Exponential Random Graph Models Danielle Larcomb University of Denver Danielle Larcomb Random Graphs 1/26 Necessity of Random Graphs The study of complex networks plays an increasingly
More informationBACKGROUND: A BRIEF INTRODUCTION TO GRAPH THEORY
BACKGROUND: A BRIEF INTRODUCTION TO GRAPH THEORY General definitions; Representations; Graph Traversals; Topological sort; Graphs definitions & representations Graph theory is a fundamental tool in sparse
More informationNotation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.
Notation Index (there exists) (for all) Fn-4 Fn-4 (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5 ( n ) k (binomial coefficient) CL-15 ( n m 1,m 2,...) (multinomial coefficient)
More informationOn the Longest Path and The Diameter in Random Apollonian Networks
On the Longest Path and The Diameter in Random Apollonian Networks Abbas Mehrabian amehrabi@uwaterloo.ca University of Waterloo Frontiers in Mathematical Sciences Honouring Siavash Shahshahani Sharif University
More informationGraph theoretic concepts. Devika Subramanian Comp 140 Fall 2008
Graph theoretic concepts Devika Subramanian Comp 140 Fall 2008 The small world phenomenon The phenomenon is surprising because Size of graph is very large (> 6 billion for the planet). Graph is sparse
More informationIntroduction to Algorithms Third Edition
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationarxiv: v1 [math.co] 28 Sep 2010
Densities of Minor-Closed Graph Families David Eppstein Computer Science Department University of California, Irvine Irvine, California, USA arxiv:1009.5633v1 [math.co] 28 Sep 2010 September 3, 2018 Abstract
More informationResilient 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 informationSocial and Technological Network Data Analytics. Lecture 5: Structure of the Web, Search and Power Laws. Prof Cecilia Mascolo
Social and Technological Network Data Analytics Lecture 5: Structure of the Web, Search and Power Laws Prof Cecilia Mascolo In This Lecture We describe power law networks and their properties and show
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationStrong Triple Connected Domination Number of a Graph
Strong Triple Connected Domination Number of a Graph 1, G. Mahadevan, 2, V. G. Bhagavathi Ammal, 3, Selvam Avadayappan, 4, T. Subramanian 1,4 Dept. of Mathematics, Anna University : Tirunelveli Region,
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
More informationA note on isolate domination
Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura
More informationMath/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 informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationROBERTO BATTITI, MAURO BRUNATO. The LION Way: Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, Apr 2015
ROBERTO BATTITI, MAURO BRUNATO. The LION Way: Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, Apr 2015 http://intelligentoptimization.org/lionbook Roberto Battiti
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 informationThe Small World Phenomenon in Hybrid Power Law Graphs
The Small World Phenomenon in Hybrid Power Law Graphs Fan Chung and Linyuan Lu Department of Mathematics, University of California, San Diego, La Jolla, CA 92093 USA Abstract. The small world phenomenon,
More informationNetworks and Discrete Mathematics
Aristotle University, School of Mathematics Master in Web Science Networks and Discrete Mathematics Small Words-Scale-Free- Model Chronis Moyssiadis Vassilis Karagiannis 7/12/2012 WS.04 Webscience: lecture
More informationE6885 Network Science Lecture 5: Network Estimation and Modeling
E 6885 Topics in Signal Processing -- Network Science E6885 Network Science Lecture 5: Network Estimation and Modeling Ching-Yung Lin, Dept. of Electrical Engineering, Columbia University October 7th,
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 informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu SPAM FARMING 2/11/2013 Jure Leskovec, Stanford C246: Mining Massive Datasets 2 2/11/2013 Jure Leskovec, Stanford
More informationMAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 18: Introduction to Spectral Graph Theory I. Basics of Graph Theory
MAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 18: Introduction to Spectral Graph Theory I. Basics of Graph Theory Lecturer: Naoki Saito Scribe: Adam Dobrin/Allen Xue
More informationCS6200 Information Retreival. The WebGraph. July 13, 2015
CS6200 Information Retreival The WebGraph The WebGraph July 13, 2015 1 Web Graph: pages and links The WebGraph describes the directed links between pages of the World Wide Web. A directed edge connects
More information