DOCSLIB.ORG

A Contraction Procedure for Planar Directed Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Contraction Procedure for Planar Directed Graphs A Contraction Pro cedure for Planar Directed Graphs y Stephen Guattery Gary L Miller Scho ol of Computer Science Carnegie Mellon University Pittsburgh PA lem Many graph algorithms either implicitly or explic Abstract itly solve this problem For sequential algorithm design We show that testing reachability in a planar DAG the two classic paradigms for solving this problem are can b e p erformed in parallel in O log n log n time BFS and DFS They only require time at most prop or O log n time using randomization using O n pro tional to the size of the graph Parallel p olylogarithmic cessors In general we give a paradigm for contracting time algorithms for the problem now use approximately a planar DAG to a p oint and then expanding it back O M n pro cessors where M n is the numb er of pro This paradigm is develop ed from a prop erty of planar di cessors needed to multiply two n n matrices together rected graphs we refer to as the Poincare index formula in parallel Ullman and Yannakakis give a probabilis p Using this new paradigm we then overlay our appli tic algorithm which that works in O n time using n cation in a fashion similar to parallel tree contraction pro cessors for sparse graphs UY This blowup in MR MR We also discuss some of the changes the amount of work for parallel algorithms makes work needed to extend the reduction pro cedure to work for with general directed graphs on negrain parallel ma general planar digraphs Using the stronglyconnected chines virtually impossible One p ossible way around components algorithm of Kao Kao we can compute this dilemma is to nd useful classes of graphs for which multiplesource reachability for general planar digraphs the problem can b e solved eciently In pioneering 3 in O log n time using O n pro cessors This improves pap ers Kao and Shannon KS and Kao and Klein the results of Kao and Klein KK who showed that KK showed that the reachability problem and many 5 this problem could b e p erformed in O log n time using related problem could b e solved in p olylogarithmic time O n pro cessors This work represen ts initial results of using only a linear numb er of pro cessors Their meth an eort to develop ecient algorithms for certain prob o ds require one to solve each of many related problems lems encountered in parallel compilation by reducing one problem to another Each reduction in tro duces more logarithmic factors to the running time 5 In the end they used O log time to solve the planar Intro duction reachability problem for multiple start vertices In this pap er we give a general paradigm for contract Testing if there exists a path from a vertex x to a vertex ing planar directed acyclic graphs DAGs to a p oint y in a directed graph is known as the reachability prob We will show that after O log n rounds of contraction an nno de directed planar DAG will b e reduced to a This work supp orted in part by the Avionics Lab oratory Wright Research and Development Center Aeronautical Sys p oint There have b een several contraction rules pro tems Division AFSC US Air Force WrightPatterson AFB p osed for undirected planar graphs Phi Gaz but Ohio under Contract FC ARPA Or this is the rst set for a class of directed planar graphs der No and by National Science Foundation Award CCR After we presen t the rules for contraction it will b e a y This work supp orted in part by National Science Foundation relatively simple matter to overlay rules necessary to grant DCR compute multiplesource reachability These results are part of a larger eort to develop a set of reduction rules for arbitrary planar directed graphs ie those with cycles as well as DAGs The algorithm for the general case is more complicated and is not pre sented here though we discuss changes involved in ex tending the reduction pro cedure to the general case We is the head of the arc We say that an arc is out of feel that the class of directed planar graphs are impor its tail and into its head An arc a is incident to a tant for at least two reasons First the class includes vertex v if v is the head or the tail of a The degree several important classes including tree and series paral of a vertex v is the numb er of arcs incident to it we lel graphs Second the ow graph for many structured represen t this numb er as deg r eev The indegree of programming languages without function calls is planar a vertex v is the numb er of arcs that have v as their Our goal is to develop the basic algorithmic foundation head the outdegree of v is the numb er of arcs with v for a class of planar graphs so that a theory of planar as their tail ow graphs could b e based on it For any directed graph G we can dene an undirected 0 In the interest of simplicity we only present the de graph G on the same set of vertices in the following way 0 tails of the DAG case here On the other hand we feel for each arc u v in G we include an edge u v in G 0 that our algorithm for planar DAGs is interesting in its We refer to G as the underlying graph of G In this own right First ignoring our algorithm for the general pap er we will distinguish b etween edges and arcs edges case we can improve the computation of manysource are undirected and lie in the underlying graph while 2 reachability by a factor of log n time by simply using arcs are directed When we refer to arcs in G as edges 0 the strong connectivity of Kao Kao Our algorithm we are actually referring to the asso ciated edges in G for general planar digraphs removes one further log n A directed path is a sequence of vertices factor Second it uses new top ological techniques in v v v such that the v s are distinct with the 0 1 k i particular the Poincare index formula This should b e exception that we might have v v and for all 0 k of interest in parallel algorithm design for digraphs i k we have the arc v v in A A directed i1 i Throughout the pap er we will assume that the graph cycle is a directed path such that v v A digraph 0 k G V A is a directed emb edded planar graph If that contains no directed cycles is called a directed an an emb edding is not given we can construct one acyclic graph DAG in O log n time using n pro cessors using the work of A planar directed graph is a directed graph that Gazit Gaz and Ramachandran and Reif RR We can b e drawn in the plane in such a way that its arcs assume that the emb edding is given in some nice com intersect only at vertices A sp ecication of some par binatorial way such as the cyclic ordering of the arcs ticular way in which such a graph can b e drawn in the radiating out of each vertex plane is called a planar emb edding of the digraph In This pap er is divided into seven sections The sec an emb edded planar digraph we dene parallel arcs as ond gives the main denitions necessary to dene and two arcs u v and u v such that either u u 1 1 2 2 1 2 analyze the directed graph contraction algorithm The and v v or u v and v u and the arcs are 1 2 1 2 1 2 third gives the contraction algorithm for sp ecial case of consecutive in the cyclic order at b oth u and v Par 1 1 of a planar DAG The theorems in Sections and show allel edges in the underlying graph are edges asso ciated that the reduction algorithm for planar DAGs works with parallel arcs in the graph in a logarithmic numb er of reduction steps The sixth If the p oints corresp onding to the arcs in an emb ed section explains how the reduction pro cedure can b e ded planar digraph are deleted the plane is divided into applied to the manysources reachability problem and a numb er of connected regions These regions are called calculates the running time Finally in Section we faces The b oundary of a face is the set of arcs that are discuss work in progress including some of the steps adjacent to that face We denote the set of faces by F necessary to extend this result to the case of general Eulers formula which holds for emb edded connected planar digraphs planar graphs relates the numb ers of arcs vertices and faces Preliminaries jV j jE j jF j If the graph also has or more vertices no selfloops Planar Directed Graphs and no parallel edges then each face will have at least We will assume that the reader is familiar with basic three edges in its b oundary and it is easy to prove the denitions and results from graph theory that apply to following inequality undirected graphs see for example textb ooks such as the one by Bondy and Murty BM jE j jV j A directed graph digraph GV A is a set of vertices V and a set of arcs A Each arc a A is The formula corresp onding to with jAj substituted an ordered pair drawn from V V We say that arc for jE j holds for emb edded planar digraphs that have a u v is directed from u to v u is the tail and v a connected underlying graph since the orientations of the arcs do not aect the quantities involved The in not distinguish b etween the notation used in these two equality corresp onding to with jAj substituted for cases jE j holds for an emb edded planar digraph G if Gs un Our approach dep ends on combinatorial arguments 0 derlying graph G is connected and has no selflo ops or based on the following simple but fundamental theorem parallel edges which we refer to as the Poincare index formula Theorem For every embedded connected planar di The Poincare Index Formula graph the fol lowing formula holds Let GV A b e a connected emb edded planar digraph X X with faces F We say that a vertex of G is a indexv indexf sourcesink if its indegreeoutdegree is zero The v 2V f 2F alternation numb er of a vertex is the
Load more

Recommended publications
  • Directed Graph Algorithms
    Directed Graph Algorithms CSE 373 Data Structures Readings • Reading Chapter 13 › Sections 13.3 and 13.4 Digraphs 2 Topological Sort 142 322 143 321 Problem: Find an order in which all these courses can 326 be taken. 370 341 Example: 142 Æ 143 Æ 378 Æ 370 Æ 321 Æ 341 Æ 322 Æ 326 Æ 421 Æ 401 378 421 In order to take a course, you must 401 take all of its prerequisites first Digraphs 3 Topological Sort Given a digraph G = (V, E), find a linear ordering of its vertices such that: for any edge (v, w) in E, v precedes w in the ordering B C A F D E Digraphs 4 Topo sort – valid solution B C Any linear ordering in which A all the arrows go to the right F is a valid solution D E A B F C D E Note that F can go anywhere in this list because it is not connected. Also the solution is not unique. Digraphs 5 Topo sort – invalid solution B C A Any linear ordering in which an arrow goes to the left F is not a valid solution D E A B F C E D NO! Digraphs 6 Paths and Cycles • Given a digraph G = (V,E), a path is a sequence of vertices v1,v2, …,vk such that: ›(vi,vi+1) in E for 1 < i < k › path length = number of edges in the path › path cost = sum of costs of each edge • A path is a cycle if : › k > 1; v1 = vk •G is acyclic if it has no cycles.
    [Show full text]
  • Graph Varieties Axiomatized by Semimedial, Medial, and Some Other Groupoid Identities
    Discussiones Mathematicae General Algebra and Applications 40 (2020) 143–157 doi:10.7151/dmgaa.1344 GRAPH VARIETIES AXIOMATIZED BY SEMIMEDIAL, MEDIAL, AND SOME OTHER GROUPOID IDENTITIES Erkko Lehtonen Technische Universit¨at Dresden Institut f¨ur Algebra 01062 Dresden, Germany e-mail: [email protected] and Chaowat Manyuen Department of Mathematics, Faculty of Science Khon Kaen University Khon Kaen 40002, Thailand e-mail: [email protected] Abstract Directed graphs without multiple edges can be represented as algebras of type (2, 0), so-called graph algebras. A graph is said to satisfy an identity if the corresponding graph algebra does, and the set of all graphs satisfying a set of identities is called a graph variety. We describe the graph varieties axiomatized by certain groupoid identities (medial, semimedial, autodis- tributive, commutative, idempotent, unipotent, zeropotent, alternative). Keywords: graph algebra, groupoid, identities, semimediality, mediality. 2010 Mathematics Subject Classification: 05C25, 03C05. 1. Introduction Graph algebras were introduced by Shallon [10] in 1979 with the purpose of providing examples of nonfinitely based finite algebras. Let us briefly recall this concept. Given a directed graph G = (V, E) without multiple edges, the graph algebra associated with G is the algebra A(G) = (V ∪ {∞}, ◦, ∞) of type (2, 0), 144 E. Lehtonen and C. Manyuen where ∞ is an element not belonging to V and the binary operation ◦ is defined by the rule u, if (u, v) ∈ E, u ◦ v := (∞, otherwise, for all u, v ∈ V ∪ {∞}. We will denote the product u ◦ v simply by juxtaposition uv. Using this representation, we may view any algebraic property of a graph algebra as a property of the graph with which it is associated.
    [Show full text]
  • Networkx: Network Analysis with Python
    NetworkX: Network Analysis with Python Salvatore Scellato Full tutorial presented at the XXX SunBelt Conference “NetworkX introduction: Hacking social networks using the Python programming language” by Aric Hagberg & Drew Conway Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. You are ready for your project! 1. Introduction to NetworkX. Introduction to NetworkX - network analysis Vast amounts of network data are being generated and collected • Sociology: web pages, mobile phones, social networks • Technology: Internet routers, vehicular flows, power grids How can we analyze this networks? Introduction to NetworkX - Python awesomeness Introduction to NetworkX “Python package for the creation, manipulation and study of the structure, dynamics and functions of complex networks.” • Data structures for representing many types of networks, or graphs • Nodes can be any (hashable) Python object, edges can contain arbitrary data • Flexibility ideal for representing networks found in many different fields • Easy to install on multiple platforms • Online up-to-date documentation • First public release in April 2005 Introduction to NetworkX - design requirements • Tool to study the structure and dynamics of social, biological, and infrastructure networks • Ease-of-use and rapid development in a collaborative, multidisciplinary environment • Easy to learn, easy to teach • Open-source tool base that can easily grow in a multidisciplinary environment with non-expert users
    [Show full text]
  • Structural Graph Theory Meets Algorithms: Covering And
    Structural Graph Theory Meets Algorithms: Covering and Connectivity Problems in Graphs Saeed Akhoondian Amiri Fakult¨atIV { Elektrotechnik und Informatik der Technischen Universit¨atBerlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften Dr. rer. nat. genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. Rolf Niedermeier Gutachter: Prof. Dr. Stephan Kreutzer Gutachter: Prof. Dr. Marcin Pilipczuk Gutachter: Prof. Dr. Dimitrios Thilikos Tag der wissenschaftlichen Aussprache: 13. October 2017 Berlin 2017 2 This thesis is dedicated to my family, especially to my beautiful wife Atefe and my lovely son Shervin. 3 Contents Abstract iii Acknowledgementsv I. Introduction and Preliminaries1 1. Introduction2 1.0.1. General Techniques and Models......................3 1.1. Covering Problems.................................6 1.1.1. Covering Problems in Distributed Models: Case of Dominating Sets.6 1.1.2. Covering Problems in Directed Graphs: Finding Similar Patterns, the Case of Erd}os-P´osaproperty.......................9 1.2. Routing Problems in Directed Graphs...................... 11 1.2.1. Routing Problems............................. 11 1.2.2. Rerouting Problems............................ 12 1.3. Structure of the Thesis and Declaration of Authorship............. 14 2. Preliminaries and Notations 16 2.1. Basic Notations and Defnitions.......................... 16 2.1.1. Sets..................................... 16 2.1.2. Graphs................................... 16 2.2. Complexity Classes................................
    [Show full text]
  • Katz Centrality for Directed Graphs • Understand How Katz Centrality Is an Extension of Eigenvector Centrality to Learning Directed Graphs
    Prof. Ralucca Gera, [email protected] Applied Mathematics Department, ExcellenceNaval Postgraduate Through Knowledge School MA4404 Complex Networks Katz Centrality for directed graphs • Understand how Katz centrality is an extension of Eigenvector Centrality to Learning directed graphs. Outcomes • Compute Katz centrality per node. • Interpret the meaning of the values of Katz centrality. Recall: Centralities Quality: what makes a node Mathematical Description Appropriate Usage Identification important (central) Lots of one-hop connections The number of vertices that Local influence Degree from influences directly matters deg Small diameter Lots of one-hop connections The proportion of the vertices Local influence Degree centrality from relative to the size of that influences directly matters deg C the graph Small diameter |V(G)| Lots of one-hop connections A weighted degree centrality For example when the Eigenvector centrality to high centrality vertices based on the weight of the people you are (recursive formula): neighbors (instead of a weight connected to matter. ∝ of 1 as in degree centrality) Recall: Strongly connected Definition: A directed graph D = (V, E) is strongly connected if and only if, for each pair of nodes u, v ∈ V, there is a path from u to v. • The Web graph is not strongly connected since • there are pairs of nodes u and v, there is no path from u to v and from v to u. • This presents a challenge for nodes that have an in‐degree of zero Add a link from each page to v every page and give each link a small transition probability controlled by a parameter β. u Source: http://en.wikipedia.org/wiki/Directed_acyclic_graph 4 Katz Centrality • Recall that the eigenvector centrality is a weighted degree obtained from the leading eigenvector of A: A x =λx , so its entries are 1 λ Thoughts on how to adapt the above formula for directed graphs? • Katz centrality: ∑ + β, Where β is a constant initial weight given to each vertex so that vertices with zero in degree (or out degree) are included in calculations.
    [Show full text]
  • A Gentle Introduction to Deep Learning for Graphs
    A Gentle Introduction to Deep Learning for Graphs Davide Bacciua, Federico Erricaa, Alessio Michelia, Marco Poddaa aDepartment of Computer Science, University of Pisa, Italy. Abstract The adaptive processing of graph data is a long-standing research topic that has been lately consolidated as a theme of major interest in the deep learning community. The snap increase in the amount and breadth of related research has come at the price of little systematization of knowledge and attention to earlier literature. This work is a tutorial introduction to the field of deep learn- ing for graphs. It favors a consistent and progressive presentation of the main concepts and architectural aspects over an exposition of the most recent liter- ature, for which the reader is referred to available surveys. The paper takes a top-down view of the problem, introducing a generalized formulation of graph representation learning based on a local and iterative approach to structured in- formation processing. Moreover, it introduces the basic building blocks that can be combined to design novel and effective neural models for graphs. We com- plement the methodological exposition with a discussion of interesting research challenges and applications in the field. Keywords: deep learning for graphs, graph neural networks, learning for structured data arXiv:1912.12693v2 [cs.LG] 15 Jun 2020 1. Introduction Graphs are a powerful tool to represent data that is produced by a variety of artificial and natural processes. A graph has a compositional nature, being a compound of atomic information pieces, and a relational nature, as the links defining its structure denote relationships between the linked entities.
    [Show full text]
  • Graph Mining: Social Network Analysis and Information Diffusion
    Graph Mining: Social network analysis and Information Diffusion Davide Mottin, Konstantina Lazaridou Hasso Plattner Institute Graph Mining course Winter Semester 2016 Lecture road Introduction to social networks Real word networks’ characteristics Information diffusion GRAPH MINING WS 2016 2 Paper presentations ▪ Link to form: https://goo.gl/ivRhKO ▪ Choose the date(s) you are available ▪ Choose three papers according to preference (there are three lists) ▪ Choose at least one paper for each course part ▪ Register to the mailing list: https://lists.hpi.uni-potsdam.de/listinfo/graphmining-ws1617 GRAPH MINING WS 2016 3 What is a social network? ▪Oxford dictionary A social network is a network of social interactions and personal relationships GRAPH MINING WS 2016 4 What is an online social network? ▪ Oxford dictionary An online social network (OSN) is a dedicated website or other application, which enables users to communicate with each other by posting information, comments, messages, images, etc. ▪ Computer science : A network that consists of a finite number of users (nodes) that interact with each other (edges) by sharing information (labels, signs, edge directions etc.) GRAPH MINING WS 2016 5 Definitions ▪Vertex/Node : a user of the social network (Twitter user, an author in a co-authorship network, an actor etc.) ▪Edge/Link/Tie : the connection between two vertices referring to their relationship or interaction (friend-of relationship, re-tweeting activity, etc.) Graph G=(V,E) symbols meaning V users E connections deg(u) node degree:
    [Show full text]
  • A Faster Parameterized Algorithm for PSEUDOFOREST DELETION
    A faster parameterized algorithm for PSEUDOFOREST DELETION Citation for published version (APA): Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). A faster parameterized algorithm for PSEUDOFOREST DELETION. Discrete Applied Mathematics, 236, 42-56. https://doi.org/10.1016/j.dam.2017.10.018 Document license: Unspecified DOI: 10.1016/j.dam.2017.10.018 Document status and date: Published: 19/02/2018 Document Version: Accepted manuscript including changes made at the peer-review stage Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Quick Notes on Nodexl
    Quick notes on NodeXL Programme organisation, 3 components: • NodeXL command ‘ribbon’ – access with menu-like item at top of the screen, contains all network data functions • Data sheets – 5 separate sheets for edges, vertices, metrics etc, switching between them using tabs on the bottom. NB because the screen gets quite crowded the sheet titles sometimes disappear off to one side so use the small arrows (bottom left) to scroll across the tabs if something seems to have gone missing. • Graph viewer – separate window pane labelled ‘Document Actions’ with graphical layout functions. Can be closed while working with data – to open it again click the ‘Show Graph’ button near the left-hand side of the ribbon. Working with data, basic process: 1. Start in ‘Edges’ data sheet (leftmost tab at the bottom); each row represents one connection of the form A links to B (directed graph) OR A and B are linked (undirected). (Directed/Undirected changed in ‘Type’ option on ribbon. In directed graph this sheet might include one row for A->B and one for B->A; in an undirected graph this would be tautologous.) No other data in this sheet is required, although optionally: • Could include text under ‘label’ if the visible label on graphs should be different from the name used in columns A or B. NB These might be overwritten when using ‘autofill columns’. • Could add an extra column at column L to identify weight of links if (as is the case with IssueCrawler data) each connection might represent more than 1 actually existing link between two vertices, hence inclusion of ‘Edge Weight’ in blogs data.
    [Show full text]
  • NODEXL for Beginners Nasri Messarra, 2013‐2014
    NODEXL for Beginners Nasri Messarra, 2013‐2014 http://nasri.messarra.com Why do we study social networks? Definition from: http://en.wikipedia.org/wiki/Social_network: A social network is a social structure made up of a set of social actors (such as individuals or organizations) and a set of the dyadic ties between these actors. Social networks and the analysis of them is an inherently interdisciplinary academic field which emerged from social psychology, sociology, statistics, and graph theory. From http://en.wikipedia.org/wiki/Sociometry: "Sociometric explorations reveal the hidden structures that give a group its form: the alliances, the subgroups, the hidden beliefs, the forbidden agendas, the ideological agreements, the ‘stars’ of the show". In social networks (like Facebook and Twitter), sociometry can help us understand the diffusion of information and how word‐of‐mouth works (virality). Installing NODEXL (Microsoft Excel required) NodeXL Template 2014 ‐ Visit http://nodexl.codeplex.com ‐ Download the latest version of NodeXL ‐ Double‐click, follow the instructions The SocialNetImporter extends the capabilities of NodeXL mainly with extracting data from the Facebook network. To install: ‐ Download the latest version of the social importer plugins from http://socialnetimporter.codeplex.com ‐ Open the Zip file and save the files into a directory you choose, e.g. c:\social ‐ Open the NodeXL template (you can click on the Windows Start button and type its name to search for it) ‐ Open the NodeXL tab, Import, Import Options (see screenshot below) 1 | Page ‐ In the import dialog, type or browse for the directory where you saved your social importer files (screenshot below): ‐ Close and open NodeXL again For older Versions: ‐ Visit http://nodexl.codeplex.com ‐ Download the latest version of NodeXL ‐ Unzip the files to a temporary folder ‐ Close Excel if it’s open ‐ Run setup.exe ‐ Visit http://socialnetimporter.codeplex.com ‐ Download the latest version of the socialnetimporter plug in 2 | Page ‐ Extract the files and copy them to the NodeXL plugin direction.
    [Show full text]
  • Graph and Network Analysis
    Graph and Network Analysis Dr. Derek Greene Clique Research Cluster, University College Dublin Web Science Doctoral Summer School 2011 Tutorial Overview • Practical Network Analysis • Basic concepts • Network types and structural properties • Identifying central nodes in a network • Communities in Networks • Clustering and graph partitioning • Finding communities in static networks • Finding communities in dynamic networks • Applications of Network Analysis Web Science Summer School 2011 2 Tutorial Resources • NetworkX: Python software for network analysis (v1.5) http://networkx.lanl.gov • Python 2.6.x / 2.7.x http://www.python.org • Gephi: Java interactive visualisation platform and toolkit. http://gephi.org • Slides, full resource list, sample networks, sample code snippets online here: http://mlg.ucd.ie/summer Web Science Summer School 2011 3 Introduction • Social network analysis - an old field, rediscovered... [Moreno,1934] Web Science Summer School 2011 4 Introduction • We now have the computational resources to perform network analysis on large-scale data... http://www.facebook.com/note.php?note_id=469716398919 Web Science Summer School 2011 5 Basic Concepts • Graph: a way of representing the relationships among a collection of objects. • Consists of a set of objects, called nodes, with certain pairs of these objects connected by links called edges. A B A B C D C D Undirected Graph Directed Graph • Two nodes are neighbours if they are connected by an edge. • Degree of a node is the number of edges ending at that node. • For a directed graph, the in-degree and out-degree of a node refer to numbers of edges incoming to or outgoing from the node.
    [Show full text]
  • 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: [email protected] Networks or Graphs • We typically use the terms interchangeably. • Networks – refers to real systems – WWW : network of web pages connected by URLs – Society : network of individuals connected by family, friendship or professional ties – Metabolic network : sum of all chemical reactions that take place in a cell • Graphs: Mathematical representation of the networks – Web graph, Social graph, Metabolic graph Real systems of quite different nature can have the same network representation • Even though these real systems have different nature, appearance or scope, they can be represented as the same network (graph) • Internet – connected using routers • Actor network – network of actors who acted together in at least one movie • Protein-Protein Interaction (PPI) network – two proteins are connected if there is experimental evidence that they can bind each other in the cell Internet Actor Network Graph PPI Network Fig. 2.3: Barabasi Networks: Terminologies • Node – Components in the system • Link – Interactions between the nodes • Directed link – nodes that interact in a specific direction (A calling B, not vice-versa; URL A is linked to URL B; A likes B) • Undirected link – Transmission lines on the power grid (two people who are friends to each other in Facebook; electric current flowing in both directions; A and B are siblings; A and B are co-authors) • Degree of a node – Number of links incident on it • In-degree - # incoming links; Out-degree - # outgoing links • Directed network – contains all directed links • Undirected network – contains all undirected links • Some networks can have both directed and undirected links – Metabolic network with certain reactions being reversible and certain reactions proceeding in only one direction • It is important to make proper choices in the selection of links to apply the network science theory.
    [Show full text]