The Effect of Graph Layout on Inference from Social Network Data
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Networkx Tutorial
5.03.2020 tutorial NetworkX tutorial Source: https://github.com/networkx/notebooks (https://github.com/networkx/notebooks) Minor corrections: JS, 27.02.2019 Creating a graph Create an empty graph with no nodes and no edges. In [1]: import networkx as nx In [2]: G = nx.Graph() By definition, a Graph is a collection of nodes (vertices) along with identified pairs of nodes (called edges, links, etc). In NetworkX, nodes can be any hashable object e.g. a text string, an image, an XML object, another Graph, a customized node object, etc. (Note: Python's None object should not be used as a node as it determines whether optional function arguments have been assigned in many functions.) Nodes The graph G can be grown in several ways. NetworkX includes many graph generator functions and facilities to read and write graphs in many formats. To get started though we'll look at simple manipulations. You can add one node at a time, In [3]: G.add_node(1) add a list of nodes, In [4]: G.add_nodes_from([2, 3]) or add any nbunch of nodes. An nbunch is any iterable container of nodes that is not itself a node in the graph. (e.g. a list, set, graph, file, etc..) In [5]: H = nx.path_graph(10) file:///home/szwabin/Dropbox/Praca/Zajecia/Diffusion/Lectures/1_intro/networkx_tutorial/tutorial.html 1/18 5.03.2020 tutorial In [6]: G.add_nodes_from(H) Note that G now contains the nodes of H as nodes of G. In contrast, you could use the graph H as a node in G. -
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 -
Chapter 4 Research Methodology
The impact of E-marketing practices on market performance of small business enterprises. An empirical investigation. Item Type Thesis Authors El-Gohary, Hatem O.A.S. Rights <a rel="license" href="http://creativecommons.org/licenses/ by-nc-nd/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by- nc-nd/3.0/88x31.png" /></a><br />The University of Bradford theses are licenced under a <a rel="license" href="http:// creativecommons.org/licenses/by-nc-nd/3.0/">Creative Commons Licence</a>. Download date 26/09/2021 11:58:39 Link to Item http://hdl.handle.net/10454/4308 Chapter 4 Research Methodology 4.1 Introduction:- This chapter discusses the methodology used to conduct the research study as well as the issues related to the chosen research methodology when investigating the different factors affecting the adoption of E-Marketing by industrial and trading UK SBEs, the different forms, tools and levels of implementation of E-Marketing by these enterprises as well as the relationship between E-Marketing adoption and marketing performance of these SBEs. Through this discussion the steps that were taken to address the research design, the data collection and analysis methods used to conduct the research study will be illustrated. These issues are addressed in light of the basic research objectives and the relevant research questions discussed in chapter one and the research framework discussed in chapter seven. Firstly it discusses some possible research designs and methodologies and provides a brief review of the literature of research methodologies, research strategies and research methods implemented in the fields of E-Marketing and SBEs. -
Quantifying Anomia: Development of a Scale
ABSTRACT QUANTIFYING ANOMIA: DEVELOPMENT OF A SCALE Anomie refers to a weakening of cultural values and social norms. One interpretation is that anomie exists because of moral deregulation when normative rules begin deteriorating, while another suggests that it is a product of insufficient means to reach goals, forcing individuals to seek deviant modalities and paths (Agnew, 1980). While multiple scales have been developed in an attempt to measure the construct, the purpose of this study was to build upon and combine scales from 1956 to 2011 to produce an instrument that quantifies anomie/anomia using factor analyses. Four scales of anomia were compiled and administered to 416 Fresno State undergraduate students. The findings suggest that the final anomia scale has good internal consistency and correlates with materialism, happiness, and social desirability. However, no expected significant differences were found across gender, age, income, marital status, and race/ethnicity. Anthony Yang August 2015 QUANTIFYING ANOMIA: DEVELOPMENT OF A SCALE by Anthony Yang A thesis submitted in partial fulfillment of the requirements for the degree of Master of Arts in Psychology in the College of Science and Mathematics California State University, Fresno August 2015 APPROVED For the Department of Psychology: We, the undersigned, certify that the thesis of the following student meets the required standards of scholarship, format, and style of the university and the student's graduate degree program for the awarding of the master's degree. Anthony Yang Thesis Author Robert Levine (Chair) Psychology Constance Jones Psychology Deborah Helsel Sociology For the University Graduate Committee: Dean, Division of Graduate Studies AUTHORIZATION FOR REPRODUCTION OF MASTER’S THESIS X I grant permission for the reproduction of this thesis in part or in its entirety without further authorization from me, on the condition that the person or agency requesting reproduction absorbs the cost and provides proper acknowledgment of authorship. -
Graphprism: Compact Visualization of Network Structure
GraphPrism: Compact Visualization of Network Structure Sanjay Kairam, Diana MacLean, Manolis Savva, Jeffrey Heer Stanford University Computer Science Department {skairam, malcdi, msavva, jheer}@cs.stanford.edu GraphPrism Connectivity ABSTRACT nodeRadius 7.9 strokeWidth 1.12 charge -242 Visual methods for supporting the characterization, com- gravity 0.65 linkDistance 20 parison, and classification of large networks remain an open Transitivity updateGraph Close Controls challenge. Ideally, such techniques should surface useful 0 node(s) selected. structural features { such as effective diameter, small-world properties, and structural holes { not always apparent from Density either summary statistics or typical network visualizations. In this paper, we present GraphPrism, a technique for visu- Conductance ally summarizing arbitrarily large graphs through combina- tions of `facets', each corresponding to a single node- or edge- specific metric (e.g., transitivity). We describe a generalized Jaccard approach for constructing facets by calculating distributions of graph metrics over increasingly large local neighborhoods and representing these as a stacked multi-scale histogram. MeetMin Evaluation with paper prototypes shows that, with minimal training, static GraphPrism diagrams can aid network anal- ysis experts in performing basic analysis tasks with network Created by Sanjay Kairam. Visualization using D3. data. Finally, we contribute the design of an interactive sys- Figure 1: GraphPrism and node-link diagrams for tem using linked selection between GraphPrism overviews the largest component of a co-authorship graph. and node-link detail views. Using a case study of data from a co-authorship network, we illustrate how GraphPrism fa- compactly summarizing networks of arbitrary size. Graph- cilitates interactive exploration of network data. -
Graph Simplification and Interaction
Graph Clarity, Simplification, & Interaction http://i.imgur.com/cW19IBR.jpg https://www.reddit.com/r/CableManagement/ Today • Today’s Reading: Lombardi Graphs – Bezier Curves • Today’s Reading: Clustering/Hierarchical edge Bundling – Definition of Betweenness Centrality • Emergency Management Graph Visualization – Sean Kim’s masters project • Reading for Tuesday & Homework 3 • Graph Interaction Brainstorming Exercise "Lombardi drawings of graphs", Duncan, Eppstein, Goodrich, Kobourov, Nollenberg, Graph Drawing 2010 • Circular arcs • Perfect angular resolution (edges for equal angles at vertices) • Arcs only intersect 2 vertices (at endpoints) • (not required to be crossing free) • Vertices may be constrained to lie on circle or concentric circles • People are more patient with aesthetically pleasing graphs (will spend longer studying to learn/draw conclusions) • What about relaxing the circular arc requirement and allowing Bezier arcs? • How does it scale to larger data? • Long curved arcs can be much harder to follow • Circular layout of nodes is often very good! • Would like more pseudocode Cubic Bézier Curve • 4 control points • Curve passes through first & last control point • Curve is tangent at P0 to (P1-P0) and at P3 to (P3-P2) http://www.e-cartouche.ch/content_reg/carto http://www.webreference.com/dla uche/graphics/en/html/Curves_learningObject b/9902/bezier.html 2.html “Force-directed Lombardi-style graph drawing”, Chernobelskiy et al., Graph Drawing 2011. • Relaxation of the Lombardi Graph requirements • “straight-line segments -
Constraint Graph Drawing
Constrained Graph Drawing Dissertation zur Erlangung des akademischen Grades des Doktors der Naturwissenschaften vorgelegt von Barbara Pampel, geb. Schlieper an der Universit¨at Konstanz Mathematisch-Naturwissenschaftliche Sektion Fachbereich Informatik und Informationswissenschaft Tag der mundlichen¨ Prufung:¨ 14. Juli 2011 1. Referent: Prof. Dr. Ulrik Brandes 2. Referent: Prof. Dr. Michael Kaufmann II Teile dieser Arbeit basieren auf Ver¨offentlichungen, die aus der Zusammenar- beit mit anderen Wissenschaftlerinnen und Wissenschaftlern entstanden sind. Zu allen diesen Inhalten wurden wesentliche Beitr¨age geleistet. Kapitel 3 (Bachmaier, Brandes, and Schlieper, 2005; Brandes and Schlieper, 2009) Kapitel 4 (Brandes and Pampel, 2009) Kapitel 6 (Brandes, Cornelsen, Pampel, and Sallaberry, 2010b) Zusammenfassung Netzwerke werden in den unterschiedlichsten Forschungsgebieten zur Repr¨asenta- tion relationaler Daten genutzt. Durch geeignete mathematische Methoden kann man diese Netzwerke als Graphen darstellen. Ein Graph ist ein Gebilde aus Kno- ten und Kanten, welche die Knoten verbinden. Hierbei k¨onnen sowohl die Kan- ten als auch die Knoten weitere Informationen beinhalten. Diese Informationen k¨onnen den einzelnen Elementen zugeordnet sein, sich aber auch aus Anordnung und Verteilung der Elemente ergeben. Mit Algorithmen (strukturierten Reihen von Arbeitsanweisungen) aus dem Gebiet des Graphenzeichnens kann man die unterschiedlichsten Informationen aus verschiedenen Forschungsbereichen visualisieren. Graphische Darstellungen k¨onnen das -
Chronic Juvenile Offenders Final Results from the Skillman Aftercare Experiment
If you have issues viewing or accessing this file contact us at NCJRS.gov. ------------------------- --- -- -- - "- 'R'"-A KlO-'- ,.,-- .. ' - . ':'-' '.: . ,': :", ': ".' ".: R:I.. ~· .. ,.: ... :. ~ .... '.~, . ' ....'. " Chronic Juvenile Offenders Final Results from The Skillman Aftercare Experiment Peter W. Greenwood, Elizabeth Piper Deschenes, John Adams The research described in this report was supported by The Skillman Foundatiqn, Grant No. 91-296. Library of Congress Cataloging In Publication Data Greenwood, Peter W. Chronic juvenile offenders : fmal results from the Skillman aftercare experiment I Peter W. Greenwood, Elizabeth Piper Deschenes, John Adams. p. em. "Supported by The Skillman Foundation." "MR-220-SKF." Includes bibliographical references (p. ). ISBN 0-8330-1477-3 1. Juvenile delinquents-Rehabilitation-Michigan-Detroit. 2. Juvenile delinquents-Rehabilitation-Pennsylvania-Pittsburgh. 3. Social work with juvenile delinquents-Michigan -Detroit. 4. Social work with juvenile delinquents-Pennsylvania-Pittsburgh. I. Deschenes, Elizabeth Piper, 1953- ll. Adams, Jolm. 1956- HV9106.D5G74 1994 364.3'6'Q974886-dc20 9340155 CIP RAND is a nonprofit institution that seeks to improve public policy through research and analysis. RAND's publications do not necessarily reflect the opinions or policies of its research sponsors. Published 1993 by RAND 1700 Main Street, P.O. Box 2138, Santa Monica, CA 90407-2138 To obtain information about RAND studies or to order documents, call Distribution Services, (310) 451-7002 • Chronic Ju~{)enile Offeltders Final Results from The Skillman • Aftercare Experiment Peter W. Greenwood, Elizabeth Piper Deschenes, John Adams Supported by The Skillman Foundation •••• < ."'" •••• , ;- ." 151575 U.S. Department of Justice Nationallnstltule of Justice This document has been reproduced exactly as received from the person or organization originating it. Points of view or opinions stated in this document are those of the authors and do not necessarily represent the official position or policies of the National Institute 01 Justice. -
Chapter 18 Spectral Graph Drawing
Chapter 18 Spectral Graph Drawing 18.1 Graph Drawing and Energy Minimization Let G =(V,E)besomeundirectedgraph.Itisoftende- sirable to draw a graph, usually in the plane but possibly in 3D, and it turns out that the graph Laplacian can be used to design surprisingly good methods. n Say V = m.Theideaistoassignapoint⇢(vi)inR to the vertex| | v V ,foreveryv V ,andtodrawaline i 2 i 2 segment between the points ⇢(vi)and⇢(vj). Thus, a graph drawing is a function ⇢: V Rn. ! 821 822 CHAPTER 18. SPECTRAL GRAPH DRAWING We define the matrix of a graph drawing ⇢ (in Rn) as a m n matrix R whose ith row consists of the row vector ⇥ n ⇢(vi)correspondingtothepointrepresentingvi in R . Typically, we want n<m;infactn should be much smaller than m. Arepresentationisbalanced i↵the sum of the entries of every column is zero, that is, 1>R =0. If a representation is not balanced, it can be made bal- anced by a suitable translation. We may also assume that the columns of R are linearly independent, since any basis of the column space also determines the drawing. Thus, from now on, we may assume that n m. 18.1. GRAPH DRAWING AND ENERGY MINIMIZATION 823 Remark: Agraphdrawing⇢: V Rn is not required to be injective, which may result in! degenerate drawings where distinct vertices are drawn as the same point. For this reason, we prefer not to use the terminology graph embedding,whichisoftenusedintheliterature. This is because in di↵erential geometry, an embedding always refers to an injective map. The term graph immersion would be more appropriate. -
Investigate the Relationship Between Socio-Economic Class and Tendency to Delinquency Among Students of Rey City in Tehran
INTERNATIONAL JOURNAL OF ENVIRONMENTAL & SCIENCE EDUCATION 2017, VOL. 12, NO. 4, 851-864 OPEN ACCESS Investigate the relationship between socio-economic class and tendency to delinquency among students of Rey city in Tehran Dr. Abdolreza Bagheri Bonjar Faculty member of Shahed University ABSTRACT Delinquency is a social phenomenon and has social context though biological factors, psychological, geographical, ethnic, racial and other items in the forming and occurring type of delinquency play an important role, explain the issue is on the basis of the social environment, limiting attitude of sociology scope in particular, the performance of the smallest and the most important social institution ie family that plays an important role in cooperation and homogeneous of normative behaviors of individuals with social environment. This study is conducted aimed to investigate the relationship between socio-economic class and delinquency rate with survey method. The sample population consisted of 260 students of Rey that its data is collected using a questionnaire. In this study to show the relationship between socioeconomic class and delinquency, several views is used such as Merton, Weber, and.., research findings indicate that there is a significant relationship between social class and delinquency meanwhile variables of social class (job and income and education) have had inverse relationship with delinquency, the more the rate of job and income and education of individual is high, the delinquency rate decreases. KEYWORDS ARTICLE HISTORY socio-economic class, tendency to delinquency, students Received 10 March 2017 Revised 18 April 2017 Accepted 12 May 2017 Introduction Delinquency of children and adolescents is the complex social issues and problems of today's world. -
Social Network Analysis As a Valuable Tool for Understanding Tourists’ Multi-Attraction Travel † Behavioral Intention to Revisit and Recommend
sustainability Article Social Network Analysis as a Valuable Tool for Understanding Tourists’ Multi-Attraction Travel y Behavioral Intention to Revisit and Recommend Deukhee Park 1, Gyehee Lee 2,* , Woo Gon Kim 1 and Taegoo Terry Kim 3 1 International Center for Hospitality Research & Development, Dedman School of Hospitality, Florida State University, Tallahassee, FL 32306, USA; [email protected] (D.P.); [email protected] (W.G.K.) 2 College of Hotel and Tourism, Kyung Hee University, 26 Kyungheedae-ro, Dongdaemun-gu, Seoul 02447, Korea 3 Center for Converging Humanities, Kyung Hee University, 26 Kyungheedae-ro, Dongdaemun-gu, Seoul 02447, Korea; [email protected] * Correspondence: [email protected]; Tel.: +82-2-961-0863 This paper is excerpted from the doctor’s thesis of the first author (2015). y Received: 15 February 2019; Accepted: 18 April 2019; Published: 29 April 2019 Abstract: In order to better understand tourists’ multi-attraction travel behavior, the present study developed a research model by combining the social network analysis technique with the structural equation model. The object of this study was to examine the structural relationships among destination image, tourists’ multi-attraction travel behavior patterns, tourists’ satisfaction, and their behavioral intentions. The data were gathered via an online survey using the China panel system. A total of 468 respondents who visited multiple attractions while in Seoul, Korea, were used for actual analysis. The results showed that all hypotheses are supported. Specifically, destination image was an important antecedent to multi-attraction travel behavior indicated by density and degree indices. In addition, the present study confirmed that density and degree centrality, the indicators of tourists’ multi-attraction travel behavior, were positively related to tourist satisfaction. -
Graph Drawing by Stochastic Gradient Descent
1 Graph Drawing by Stochastic Gradient Descent Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman Abstract—A popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input. We present an algorithm to minimize its energy function, known as stress, by using stochastic gradient descent (SGD) to move a single pair of vertices at a time. Our results show that SGD can reach lower stress levels faster and more consistently than majorization, without needing help from a good initialization. We then show how the unique properties of SGD make it easier to produce constrained layouts than previous approaches. We also show how SGD can be directly applied within the sparse stress approximation of Ortmann et al. [1], making the algorithm scalable up to large graphs. Index Terms—Graph drawing, multidimensional scaling, constraints, relaxation, stochastic gradient descent F 1 INTRODUCTION RAPHS are a common data structure, used to describe to the shortest path distance between vertices i and j, with w = d−2 G everything from social networks to food webs, from ij ij to offset the extra weight given to longer paths metabolic pathways to internet traffic. Any set of pairwise due to squaring the difference [3]. relationships between entities can be described by a graph, This definition was popularized for graph layout by and the ever increasing amount of data being collected Kamada and Kawai [4] who minimized the function using means that visualizing graphs for exploratory analysis has a localized 2D Newton-Raphson method, while within the become an important task. MDS community Kruskal [5] originally used gradient de- Node-link diagrams are an intuitive representation of scent [6].