DOCSLIB.ORG

Measures of Centrality Measures of Centrality Complex Networks | @Networksvox

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Measures of Centrality Measures of Centrality Complex Networks | @Networksvox CoNKs @networksvox Measures of centrality Measures of centrality Complex Networks | @networksvox CSYS/MATH 303, Spring, 2014 | #SpringCoNKs2014 Background Centrality measures Degree centrality Prof. Peter Dodds | @peterdodds Closeness centrality Betweenness Eigenvalue centrality Dept. of Mathematics & Statistics | Vermont Complex Systems Center Hubs and Authorities Vermont Advanced Computing Core | University of Vermont References C Really, o What’s N K the s Story? Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. .. .. .. 1 of 28 CoNKs These slides are brought to you by: @networksvox Measures of centrality Background Centrality measures Degree centrality Closeness centrality Betweenness Eigenvalue centrality Hubs and Authorities References C Really, o What’s N K the s Story? . .. .. .. 2 of 28 CoNKs Outline @networksvox Measures of centrality Background Background Centrality measures Degree centrality Closeness centrality Centrality measures Betweenness Eigenvalue centrality Degree centrality Hubs and Authorities Closeness centrality References Betweenness Eigenvalue centrality Hubs and Authorities C Really, o What’s References N K the s Story? . .. .. .. 3 of 28 CoNKs How big is my node? @networksvox Measures of centrality ▶ Basic question: how ‘important’ are specific nodes and edges in a network? Background Centrality ▶ An important node or edge might: measures Degree centrality 1. handle a relatively large amount of the network’s traffic Closeness centrality Betweenness (e.g., cars, information); Eigenvalue centrality 2. bridge two or more distinct groups (e.g., liason, Hubs and Authorities interpreter); References 3. be a source of important ideas, knowledge, or judgments (e.g., supreme court decisions, an employee who ‘knows where everything is’). ▶ So how do we quantify such a slippery concept as C Really, importance? o What’s N K the ▶ We generate ad hoc, reasonable measures, and examine s Story? their utility... .. .. .. 4 of 28 CoNKs Centrality @networksvox Measures of centrality ▶ One possible reflection of importance is centrality. Background ▶ Presumption is that nodes or edges that are (in some Centrality measures sense) in the middle of a network are important for the Degree centrality Closeness centrality network’s function. Betweenness Eigenvalue centrality ▶ Idea of centrality comes from social networks Hubs and Authorities literature [7]. References ▶ Many flavors of centrality... 1. Many are topological and quasi-dynamical; 2. Some are based on dynamics (e.g., traffic). ▶ We will define and examine a few... C Really, o What’s ▶ (Later: see centrality useful in identifying communities N K the in networks.) s Story? . .. .. .. 5 of 28 CoNKs Centrality @networksvox Measures of centrality Background Centrality . measures Degree centrality Degree centrality . Closeness centrality [7] Betweenness ▶ Naively estimate importance by node degree. Eigenvalue centrality Hubs and Authorities ▶ Doh: assumes linearity References (If node 푖 has twice as many friends as node 푗, it’s twice as important.) ▶ Doh: doesn’t take in any non-local information. C Really, o What’s N K the s Story? . .. .. .. 7 of 28 CoNKs Closeness centrality @networksvox Measures of ▶ Idea: Nodes are more central if they can reach other centrality nodes ‘easily.’ Background ▶ Measure average shortest path from a node to all other Centrality nodes. measures Degree centrality ▶ Define Closeness Centrality for node 푖 as Closeness centrality Betweenness Eigenvalue centrality 푁 − 1 Hubs and Authorities ∑ (shortest distance from 푖 to 푗). References 푗,푗≠푖 ▶ Range is 0 (no friends) to 1 (single hub). ▶ Unclear what the exact values of this measure tells us because of its ad-hocness. C Really, o What’s ▶ N General problem with simple centrality measures: what K the do they exactly mean? s Story? ▶ Perhaps, at least, we obtain an ordering of nodes in terms of ‘importance.’ . .. .. .. 9 of 28 CoNKs Betweenness centrality @networksvox Measures of centrality ▶ Betweenness centrality is based on coherence of shortest paths in a network. Background Centrality ▶ Idea: If the quickest way between any two nodes on a measures Degree centrality network disproportionately involves certain nodes, then Closeness centrality Betweenness they are ‘important’ in terms of global cohesion. Eigenvalue centrality Hubs and Authorities ▶ For each node 푖, count how many shortest paths pass References through 푖. ▶ In the case of ties, divide counts between paths. ▶ Call frequency of shortest paths passing through node 푖 the betweenness of 푖, 퐵푖. C Really, ▶ o What’s Note: Exclude shortest paths between 푖 and other N K the nodes. s Story? ▶ Note: works for weighted and unweighted networks. .. .. .. 11 of 28 CoNKs ▶ Consider a network with 푁 nodes and 푚 edges @networksvox (possibly weighted). Measures of centrality 푁 ▶ Computational goal: Find ( 2 ) shortest paths between all pairs of nodes. Background ▶ Traditionally use Floyd-Warshall algorithm. Centrality measures 3 ▶ Computation time grows as 푂(푁 ). Degree centrality Closeness centrality ▶ See also: Betweenness Eigenvalue centrality 1. Dijkstra’s algorithm for finding shortest path between Hubs and Authorities two specific nodes, References 2. and Johnson’s algorithm which outperforms Floyd-Warshall for sparse networks: 푂(푚푁 + 푁2 log 푁). ▶ Newman (2001) [4, 5] and Brandes (2001) [1] independently derive equally fast algorithms that also C Really, o What’s N compute betweenness. K the s Story? ▶ Computation times grow as: 1. 푂(푚푁) for unweighted graphs; 2 2. and 푂(푚푁 + 푁 log 푁) for weighted graphs. .. .. .. 12 of 28 CoNKs Shortest path between node 푖 and all others: @networksvox Measures of ▶ Consider unweighted networks. centrality ▶ Use breadth-first search: 1. Start at node 푖, giving it a distance 푑 = 0 from itself. Background Centrality 2. Create a list of all of 푖’s neighbors and label them being measures at a distance 푑 = 1. Degree centrality Closeness centrality 3. Go through list of most recently visited nodes and find Betweenness all of their neighbors. Eigenvalue centrality Hubs and Authorities 4. Exclude any nodes already assigned a distance. References 5. Increment distance 푑 by 1. 6. Label newly reached nodes as being at distance 푑. 7. Repeat steps 3 through 6 until all nodes are visited. ▶ Record which nodes link to which nodes moving out from 푖 (former are ‘predecessors’ with respect to 푖’s C Really, o What’s shortest path structure). N K the s Story? ▶ Runs in 푂(푚) time and gives 푁 − 1 shortest paths. ▶ Find all shortest paths in 푂(푚푁) time 2 ▶ Much, much better than naive estimate of 푂(푚푁 ). .. .. .. 13 of 28 [4] CoNKs Newman’s Betweenness algorithm: @networksvox Measures of M. E. J. NEWMAN AND M. GIRVAN PHYSICAL REVIEW E 69, 026113 ͑2004͒ centrality pears not to influence the results highly. The recalculation Background Centrality step, on the other hand, is absolutely crucial to the operation measures Degree centrality of our methods. This step was missing from previous at- Closeness centrality tempts at solving the clustering problem using divisive algo- Betweenness Eigenvalue centrality rithms, and yet without it the results are very poor indeed, Hubs and Authorities failing to find known community structure even in the sim- References plest of cases. In Sec. V B we give an example comparing the performance of the algorithm on a particular network with and without the recalculation step. In the following sections, we discuss implementation and give examples of our algorithms for finding community C Really, o What’s N structure. For the reader who merely wants to know what K the s Story? algorithm they should use for their own problem, let us give FIG. 4. Calculation of shortest-path betweenness: ͑a͒ When an immediate answer: for most problems, we recommend the there is only a single shortest path from a source vertex s ͑top͒ to all other reachable vertices, those paths necessarily form a tree, which algorithm with betweenness scores calculated using the . shortest-path betweenness measure ͑i͒ above. This measure makes the calculation of the contribution to betweenness from this .. .. .. 14 of 28 appears to work well and is the quickest to calculate—as set of paths particularly simple, as described in the text. ͑b͒ For described in Sec. III A, it can be calculated for all edges in cases in which there is more than one shortest path to some vertices, time O(mn), where m is the number of edges in the graph the calculation is more complex. First we must calculate the number and n is the number of vertices ͓48͔. This is the only version of distinct paths from the source s to each vertex ͑numbers on of the algorithm that we discussed in Ref. ͓25͔. The other vertices͒, and then these are used to weight the path counts as versions we discuss, while being of some pedagogical inter- described in the text. In either case, we can check the results by est, make greater computational demands, and in practice confirming that the sum of the betweennesses of the edges con- seem to give results no better than the shortest-path method. nected to the source vertex is equal to the total number of reachable vertices—six in each of the cases illustrated here. III. IMPLEMENTATION tion to betweenness for each edge from this set of paths as follows. We find first the ‘‘leaves’’ of the tree, i.e., those In theory, the descriptions of the preceding section com- nodes such that no shortest paths to other nodes pass through pletely define the methods we consider in this paper, but in them, and we assign a score
Load more

Recommended publications
  • Approximating Network Centrality Measures Using Node Embedding and Machine Learning
    Approximating Network Centrality Measures Using Node Embedding and Machine Learning Matheus R. F. Mendon¸ca,Andr´eM. S. Barreto, and Artur Ziviani ∗† Abstract Extracting information from real-world large networks is a key challenge nowadays. For instance, computing a node centrality may become unfeasible depending on the intended centrality due to its computational cost. One solution is to develop fast methods capable of approximating network centralities. Here, we propose an approach for efficiently approximating node centralities for large networks using Neural Networks and Graph Embedding techniques. Our proposed model, entitled Network Centrality Approximation using Graph Embedding (NCA-GE), uses the adjacency matrix of a graph and a set of features for each node (here, we use only the degree) as input and computes the approximate desired centrality rank for every node. NCA-GE has a time complexity of O(jEj), E being the set of edges of a graph, making it suitable for large networks. NCA-GE also trains pretty fast, requiring only a set of a thousand small synthetic scale-free graphs (ranging from 100 to 1000 nodes each), and it works well for different node centralities, network sizes, and topologies. Finally, we compare our approach to the state-of-the-art method that approximates centrality ranks using the degree and eigenvector centralities as input, where we show that the NCA-GE outperforms the former in a variety of scenarios. 1 Introduction Networks are present in several real-world applications spread among different disciplines, such as biology, mathematics, sociology, and computer science, just to name a few. Therefore, network analysis is a crucial tool for extracting relevant information.
    [Show full text]
  • Closeness Centrality Extended to Unconnected Graphs : the Harmonic Centrality Index
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Infoscience - École polytechnique fédérale de Lausanne ASNA 2009 Zürich Closeness Centrality Extended To Unconnected Graphs : The Harmonic Centrality Index Yannick Rochat1 Institute of Applied Mathematics University of Lausanne, Switzerland [email protected] Abstract Social network analysis is a rapid expanding interdisciplinary field, growing from work of sociologists, physicists, historians, mathematicians, political scientists, etc. Some methods have been commonly accepted in spite of defects, perhaps because of the rareness of synthetic work like (Freeman, 1978; Faust & Wasserman, 1992). In this article, we propose an alternative index of closeness centrality defined on undirected networks. We show that results from its computation on real cases are identical to those of the closeness centrality index, with same computational complex- ity and we give some interpretations. An important property is its use in the case of unconnected networks. 1 Introduction The study of centrality is one of the most popular subject in the analysis of social networks. Determining the role of an individual within a society, its influence or the flows of information on which he can intervene are examples of applications of centrality indices. They are defined at an actor-level and are expected to compare and better understand roles of each individual in the net- work. In addition, a graph-level index called centralization (i.e. how much the index value of the most central node is bigger than the others) is defined for each existing index . Each index provides a way to highlight properties of individuals, depen- dently on its definition.
    [Show full text]
  • “A Tie Is a Tie? Gender and Network Positioning in Life Science Inventor Collaboration”
    “A Tie is a Tie? Gender and Network Positioning in Life Science Inventor Collaboration” Kjersten Bunker Whittington Reed College 3203 SE Woodstock Blvd Portland, OR 97202 [email protected] (Please note: draft contains figures in color) WORKING PAPER – UNDER REVIEW Highlights Examines men’s and women’s network positioning in innovation collaboration networks Data comprises 30 years of global life science inventing across sectors and organizational forms Women have comparable numbers of ties and network reach; include more women in their networks Women are in fewer strategic positions, and their collaborations are more status-asymmetrical Finds network benefits contingent on gender; men receive higher returns for some types of ties Abstract Collaborative relationships are an important anchor of innovative activity, and rates of collaboration in science are on the rise. This research addresses differences in men’s and women’s collaborative positioning in science, and whether returns from network relationships towards scientists’ future productivity on contingent on gender. Utilizing co-inventor network relations that span thirty years of life science patenting across sectors, geographic locations, and a variety of technological backgrounds, I find persistent gender disparities in involvement in patenting and collaborative positioning across time. Amidst some network similarities, women inventors tend to be in less strategic positions and have greater status-asymmetries between themselves and their co-inventors. Collaborations tend towards gender homophily. In multivariate models that include past and future activity, I find that network benefits are contingent on gender. Men receive greater returns from network positioning for some types of ties, and when collaborating with men. I discuss the implications of these results for innovative growth, as well as for policies that support men’s and women’s career development.
    [Show full text]
  • Measures of Centrality
    Measures of centrality Measures of centrality Background Centrality Complex Networks measures Degree centrality CSYS/MATH 303, Spring, 2011 Closeness centrality Betweenness Eigenvalue centrality Hubs and Authorities Prof. Peter Dodds References Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. 1 of 28 Measures of Outline centrality Background Centrality measures Degree centrality Closeness centrality Background Betweenness Eigenvalue centrality Hubs and Authorities References Centrality measures Degree centrality Closeness centrality Betweenness Eigenvalue centrality Hubs and Authorities References 2 of 28 Measures of How big is my node? centrality Background Centrality measures I Basic question: how ‘important’ are specific nodes Degree centrality Closeness centrality and edges in a network? Betweenness Eigenvalue centrality I An important node or edge might: Hubs and Authorities 1. handle a relatively large amount of the network’s References traffic (e.g., cars, information); 2. bridge two or more distinct groups (e.g., liason, interpreter); 3. be a source of important ideas, knowledge, or judgments (e.g., supreme court decisions, an employee who ‘knows where everything is’). I So how do we quantify such a slippery concept as importance? I We generate ad hoc, reasonable measures, and examine their utility... 3 of 28 Measures of Centrality centrality Background Centrality measures Degree centrality I One possible reflection of importance is centrality. Closeness centrality Betweenness I Presumption is that nodes or edges that are (in some Eigenvalue centrality Hubs and Authorities sense) in the middle of a network are important for References the network’s function.
    [Show full text]
  • Application of Social Network Analysis in Interlibrary Loan Services
    5/2/2020 Application of social network analysis in interlibrary loan services Webology, Volume 10, Number 1, June, 2013 Home Table of Contents Titles & Subject Index Authors Index Application of social network analysis in interlibrary loan services Ammar Jalalimanesh Information Engineering Department, Iranian Research Institute for Information Science and Technology (IRANDOC), Tehran, Iran. E-mail: jalalimanesh (at) irandoc.ac.ir Seyyed Majid Yaghoubi Computer Engineering Department, University of Science and Technology, Tehran, Iran. E-mail: majidyaghoubi (at) comp.iust.ac.ir Received May 5, 2012; Accepted June 10, 2013 Abstract This paper aims to analyze interlibrary load (ILL) services' network using Social Network Analysis (SNA) techniques in order to discover knowledge about information flow between institutions. Ten years (2000 to 2010) of logs of Ghadir, an Iranian national interlibrary loan service, were processed. A data warehouse was created containing data of about 61,000 users, 158,000 visits and 160,000 borrowed books from 240 institutions. Social network analysis was conducted on data using NodeXL software and network metrics were calculated using tnet software. The network graph showed that Tehran, the capital, is hub of Ghadir project and Qazvin, Tabriz and Isfahan have the highest amount of relationship with it. The network also showed that neighbor cities and provinces have the most interactions with each other. The network metrics imply the richness of collections of institutions in different subjects. This is the first study to analyze logs of Iranian national ILL service and is one of the first studies that use SNA techniques to study ILL services. Keywords Interlibrary loan; Information services; Document delivery; Document supply; Interlending; Social network analysis; Iran Introduction The network that is also called graph is a mathematical representation of elements that interact with or relate to each other.
    [Show full text]
  • Closeness Centrality in Some Splitting Networks
    Computer Science Journal of Moldova, vol.26, no.3(78), 2018 Closeness centrality in some splitting networks Vecdi Ayta¸c Tufan Turacı Abstract A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks, and a number of graph-theoretic param- eters have been used to derive formulas for calculating network reliability. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. We consider closeness cen- trality which is defined as the total graph-theoretic distance to all other vertices in the graph. In this paper, closeness central- ity of some splitting graphs is calculated, and exact values are obtained. Keywords: Graph theory, network design and communica- tion, complex networks, closeness centrality, splitting graphs. 1 Introduction Most of the communication systems of the real world can be represented as complex networks, in which the nodes are the elementary compo- nents of the system and the links connect a pair of nodes that mutu- ally interact exchanging information. A central issue in the analysis of complex networks is the assessment of their robustness and vulnerabil- ity. One of the major concerns of network analysis is the definition of the concept of centrality. This concept measures the importance of a node’s position in a network. In social, biological, communication, and transportation networks, among others, it is important to know the relative structural prominence of nodes to identify the key elements in the network.
    [Show full text]
  • Triangle Centrality [16] Is Based on the Sum of Triangle Counts for a Vertex and Its Neighbors, Normalized Over the Total Triangle Count in the Graph
    Triangle Centrality Paul Burkhardt ∗ September 13, 2021 Abstract Triangle centrality is introduced for finding important vertices in a graph based on the concentration of triangles surrounding each vertex. An important vertex in triangle centrality is at the center of many triangles, and therefore it may be in many triangles or none at all. Given a simple, undirected graph G =(V,E), with n = V vertices and m = E edges, where N(v) | | | | + is the neighborhood set of v, N△(v) is the set of neighbors that are in triangles with v, and N△(v) is the closed set that includes v, then the triangle centrality for v, where (v) and (G) denote the respective △ △ triangle counts of v and G, is given by 1 + (u)+ w N v N v (w) 3 u∈N (v) ∈{ ( )\ △( )} TC(v)= P △ △ P △ . (G) △ It follows that the vector of triangle centralities for all vertices is ˇ 1 3A 2T + IT C = − , 1⊤T 1 where A is adjacency matrix of G, I is the identity matrix, 1 is the vectors of all ones, and the elementwise product A2 A gives T , and Tˇ is the binarized analog of T . ◦ We give optimal algorithms that compute triangle centrality in O(m√m) time and O(m + n) space. On a Concurrent Read Exclusive Write (CREW) Parallel Random Access Memory (PRAM) machine, we give a near work-optimal parallel algorithm that takes O(log n) time using O(m√m) CREW PRAM processors. In MapReduce, we show it takes four rounds using O(m√m) communication bits, and is therefore optimal.
    [Show full text]
  • A Faster Method to Estimate Closeness Centrality Ranking Arxiv
    A Faster Method to Estimate Closeness Centrality Ranking Akrati Saxena* Ralucca Gera** [email protected] [email protected] S. R. S. Iyengar* [email protected] *Department of Computer Science and Engineering, Indian Institute of Technology Ropar, India **Department of Applied Mathematics Naval Postgraduate School, Monterey, CA 93943 USA Abstract Closeness centrality is one way of measuring how central a node is in the given network. The closeness centrality measure assigns a centrality value to each node based on its accessibility to the whole network. In real life applications, we are mainly interested in ranking nodes based on their centrality values. The classical method to com- pute the rank of a node first computes the closeness centrality of all arXiv:1706.02083v1 [cs.SI] 7 Jun 2017 nodes and then compares them to get its rank. Its time complexity is O(n · m + n), where n represents total number of nodes, and m represents total number of edges in the network. In the present work, we propose a heuristic method to fast estimate the closeness rank of a node in O(α · m) time complexity, where α = 3. We also pro- pose an extended improved method using uniform sampling technique. This method better estimates the rank and it has the time complex- ity O(α · m), where α ≈ 10 − 100. This is an excellent improvement over the classical centrality ranking method. The efficiency of the 1 proposed methods is verified on real world scale-free social networks using absolute and weighted error functions. 1 Introduction In network science, various centrality measures have been defined to identify important nodes based on the application context.
    [Show full text]
  • Centrality Measures
    Social Network Analysis: Centrality Measures Donglei Du ([email protected]) Faculty of Business Administration, University of New Brunswick, NB Canada Fredericton E3B 9Y2 Donglei Du (UNB) Social Network Analysis 1 / 85 Table of contents 1 Centrality measures Degree centrality Closeness centrality Betweenness centrality Eigenvector PageRank 2 Comparison among centrality measures 3 Extensions Extensions to weighted network Extensions to bipartitie network Extensions to dynamic network Extensions to hypergraph 4 Appendix Theory of non-negative, irreducible, and primitive matrices: Perron-Frobenius theorem (Luenberger, 1979)-Chapter 6 Donglei Du (UNB) Social Network Analysis 2 / 85 What is centrality?I Centrality measures address the question: "Who is the most important or central person in this network?" There are many answers to this question, depending on what we mean by importance. According to Scott Adams, the power a person holds in the organization is inversely proportional to the number of keys on his keyring. A janitor has keys to every office, and no power. The CEO does not need a key: people always open the door for him. There are a vast number of different centrality measures that have been proposed over the years. Donglei Du (UNB) Social Network Analysis 4 / 85 What is centrality? II According to Freeman in 1979, and evidently still true today: "There is certainly no unanimity on exactly what centrality is or on its conceptual foundations, and there is little agreement on the proper procedure for its measurement." We will look at some popular ones... Donglei Du (UNB) Social Network Analysis 5 / 85 Centrality measures Degree centrality Closeness centrality Betweeness centrality Eigenvector centrality PageRank centrality ..
    [Show full text]
  • Measures of Centrality
    Measures of Measures of centrality Outline centrality Measures of centrality Complex Networks, CSYS/MATH 303, Spring, 2010 Background Background Centrality Centrality measures measures Degree centrality Background Degree centrality Closeness centrality Closeness centrality Prof. Peter Dodds Betweenness Betweenness Eigenvalue centrality Eigenvalue centrality Hubs and Authorities Hubs and Authorities Department of Mathematics & Statistics References Centrality measures References Center for Complex Systems Degree centrality Vermont Advanced Computing Center University of Vermont Closeness centrality Betweenness Eigenvalue centrality Hubs and Authorities References 1/29 2/29 Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. Measures of Measures of How big is my node? centrality Centrality centrality Background Background I Basic question: how ‘important’ are specific nodes Centrality Centrality measures I One possible reflection of importance is centrality. measures and edges in a network? Degree centrality Degree centrality Closeness centrality I Presumption is that nodes or edges that are (in some Closeness centrality I An important node or edge might: Betweenness Betweenness Eigenvalue centrality sense) in the middle of a network are important for Eigenvalue centrality 1. handle a relatively large amount of the network’s Hubs and Authorities Hubs and Authorities the network’s function. traffic (e.g., cars, information); References References 2. bridge two or more distinct groups (e.g., liason, I Idea of centrality comes from social networks interpreter); literature [7]. 3. be a source of important ideas, knowledge, or I Many flavors of centrality... judgments (e.g., supreme court decisions, an 1. Many are topological and quasi-dynamical; employee who ‘knows where everything is’). 2. Some are based on dynamics (e.g., traffic).
    [Show full text]
  • Patterns of Iran's Research Collaboration in the Field Of
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by UNL | Libraries University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Library Philosophy and Practice (e-journal) Libraries at University of Nebraska-Lincoln May 2019 Patterns of Iran’s Research Collaboration in the field of Pharmacology and Pharmacy: A Bibliometric Study Mehdi Ansari Kermanshah University of Medical Sciences, [email protected] Abbas Pardakhty Kermanshah University of Medical Sciences, [email protected] Oranus Tajedini Shahid Bahonar University of Kerman, [email protected] Ali Sadatmoosavi Kermanshah University of Medical Sciences, [email protected] Ali Akbar Khasseh Payame Noor University, [email protected] Follow this and additional works at: https://digitalcommons.unl.edu/libphilprac Part of the Library and Information Science Commons Ansari, Mehdi; Pardakhty, Abbas; Tajedini, Oranus; Sadatmoosavi, Ali; and Khasseh, Ali Akbar, "Patterns of Iran’s Research Collaboration in the field of Pharmacology and Pharmacy: A Bibliometric Study" (2019). Library Philosophy and Practice (e-journal). 2326. https://digitalcommons.unl.edu/libphilprac/2326 Patterns of Iran’s Research Collaboration in the field of Pharmacology and Pharmacy: A Bibliometric Study Mehdi Ansari Pharmaceutics Research Centre, Institute of Neuropharmacology, Kerman University of Medical Sciences, Kerman, Iran. Abbas Pardakhty Pharmaceutics Research Center, Neuropharmacology Institute, Kerman University of Medical Sciences, Kerman, Iran. Oranus Tajedini Department of Knowledge and Information Science, Shahid Bahonar University of Kerman, Kerman, Iran. Ali Sadatmoosavi (Corresponding author) Neuroscience Research Center, Kerman University of Medical Sciences, Kerman, Iran. Email: [email protected] Ali Akbar Khasseh Assistant Professor, Department of Knowledge and Information Science, Payame Noor University, Tehran, Iran.
    [Show full text]
  • Centralities in Large Networks: Algorithms and Observations
    Centralities in Large Networks: Algorithms and Observations U Kang Spiros Papadimitriou∗ Jimeng Sun Hanghang Tong SCS, CMU Google IBM T.J. Watson IBM T.J. Watson Abstract and so on. Many of these networks reach billions of nodes Node centrality measures are important in a large number of and edges requiring terabytes of storage. graph applications, from search and ranking to social and biological network analysis. In this paper we study node 1.1 Challenges for Large Scale Centralities Measuring centrality for very large graphs, up to billions of nodes and centrality in very large graphs poses two key challenges. edges. Various definitions for centrality have been proposed, First, some definitions of centrality have inherently high ranging from very simple (e.g., node degree) to more elab- computational complexity. For example, shortest-path or orate. However, measuring centrality in billion-scale graphs random walk betweenness [6, 25] have complexity at least 3 poses several challenges. Many of the “traditional” defini- O(n ) where n is the number of nodes in a graph. Further- tions such as closeness and betweenness were not designed more, some of the faster estimation algorithms require oper- with scalability in mind. Therefore, it is very difficult, if ations, which are not amenable to parallelization, such as all- not impossible, to compute them both accurately and effi- sources breadth-first search. Finally, it may not be straight- ciently. In this paper, we propose centrality measures suit- forward or even possible to develop accurate approximation able for very large graphs, as well as scalable methods to schemes. In summary, centrality measures should ideally be effectively compute them.
    [Show full text]