DOCSLIB.ORG

Three Easy Ways to Export Your Facebook and Twitter Network As a Graph

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Three Easy Ways to Export Your Facebook and Twitter Network As a Graph Three easy ways to export your Facebook and twitter network as a graph. Beatriz Patraca (egolab-GRAFO) There are many applications that allow its users to visualize their own network directly from Facebook or twitter, but with the following three tools you can select algorithms, play with the usual measures and change colours and sizes. Netvizz NodeXL Gephi 1. Netvizz + Gephi • Netvizz: Facebook app by Bernhard Rieder (professor at University of Amsterdam) allows you to create gdf files (a simple text format that specifies an undirected graph) from your relationships of either your personal network or the groups you are a member of. • These files can then be analyzed and visualized using graph visualization software such as GUESS or the powerful and very easy to use Gephi platform. Netvizz + Gephi Gephi is a tool to explore and understand graphs. As in Photoshop (but for graphs), the user interacts with the representation, manipulates the structures, shapes and colours to reveal hidden properties. http://gephi.org Case study #Yosoy132enelextranjero (facebook group) On may 23rd,2012, a student movement from different universities in the country asked the media to fully inform citizens abaut the presidential contest in Mexico. “#yosoy132 en el extranjero” an extension of such group, is formed by mexican citizens abroad who support the struggle for the democratization of Mexico and Mexican mass media. Netvizz + Gephi Sign in to a Facebook account Search for “netvizz” application Netvizz 2390 nodes 7991 edges gdf file: save as... Gephi • In the Gephi menu bar go to File Menu and Open the .gdf file • Run a layout. You can see the layout properties below. • Ranking modules allows to configure node’s color and size. • Choose the ranking tab in the top left module and choose Degree from the menu. Gephi Go to the filters in the top right module and open the topology folder. Drag the degree range filter in to the Queries and drop it to drag filter here. Click on degree range to activate the filter. It shows a range slider and the chart that represents the data, the degree distribution here. In my case Nodes with a degree inferior to 20 are now hidden. Now: 187 nodes 7.7% visible 1611 edges 20.16% visible Gephi • Statics: Click the statistics tab in the top right module. Click run next to average path length. • Return to ranking in the top left module and choose a rank parameter from the dropdown menu: “betweenness centrality” Gephi Play with the options and measures(size, colour, range, modularity, betweenness, outdegree, labs) At the very top left click on the preview tab. Gephi • The community detection algorithm created a “Modularity class” for each node, wich we’ll use to colorize the communities. • Locate the partition module on the left panel and click on the refresh button to populate list. Gephi (betweenness) Gephi (modularity) 2. NodeXL • NodeXL is a free, open-source template for Microsoft® Excel® 2007 and 2010 that makes easier to explore network graphs. With NodeXL, you can enter a network edge list in a worksheet, click a button and see your graph, all in the familiar environment of the Excel window. • Download the template from NodeXL site. http://nodexl.codeplex.com/ Case study • This study is a part of a most complex analysis of users’ perception of Mexican identity in the Social Networking Sites. • With the Hashtag # YoamoMéxico we proceeded to make a netnography of interactions occurring within a span of 16 hours. #YOAMOMEXICO • 1326 interactions (tweets, RT and mentions of #YoamoMéxico • 1260 users, 360 links. NodeXL From Twitter search network Import data and term networks NodeXL • NodeXL network metrics NodeXL • You can display nodes with subgraph images sorted by network attributes: • Also you can see the degree measure for each node: @mayraying (137) @prawana (81) @pacoutrilla (29) NodeXL 3. NodeXL + Gephi • You can export graph data from the workbook and play with your network in another platform (like pajek or gephi) NodeXL + Gephi EXPORT IMPORT NodeXL + Gephi Filtered network: 375 nodes. NodeXL + Gephi Betweenness Thanks! • References: • http://nodexl.codeplex.com/ • http://gephi.org/ • http://www.peteraldhous.com/CAR/Aldhous_ CAR2011_NodeXL.pdf • https://gephi.org/2010/quick-start-tutorial/ .
Load more

Recommended publications
  • 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]
  • Networks in Nature: Dynamics, Evolution, and Modularity
    Networks in Nature: Dynamics, Evolution, and Modularity Sumeet Agarwal Merton College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Hilary 2012 2 To my entire social network; for no man is an island Acknowledgements Primary thanks go to my supervisors, Nick Jones, Charlotte Deane, and Mason Porter, whose ideas and guidance have of course played a major role in shaping this thesis. I would also like to acknowledge the very useful sug- gestions of my examiners, Mark Fricker and Jukka-Pekka Onnela, which have helped improve this work. I am very grateful to all the members of the three Oxford groups I have had the fortune to be associated with: Sys- tems and Signals, Protein Informatics, and the Systems Biology Doctoral Training Centre. Their companionship has served greatly to educate and motivate me during the course of my time in Oxford. In particular, Anna Lewis and Ben Fulcher, both working on closely related D.Phil. projects, have been invaluable throughout, and have assisted and inspired my work in many different ways. Gabriel Villar and Samuel Johnson have been col- laborators and co-authors who have helped me to develop some of the ideas and methods used here. There are several other people who have gener- ously provided data, code, or information that has been directly useful for my work: Waqar Ali, Binh-Minh Bui-Xuan, Pao-Yang Chen, Dan Fenn, Katherine Huang, Patrick Kemmeren, Max Little, Aur´elienMazurie, Aziz Mithani, Peter Mucha, George Nicholson, Eli Owens, Stephen Reid, Nico- las Simonis, Dave Smith, Ian Taylor, Amanda Traud, and Jeffrey Wrana.
    [Show full text]
  • Modularity in Static and Dynamic Networks
    Modularity in static and dynamic networks Sarah F. Muldoon University at Buffalo, SUNY OHBM – Brain Graphs Workshop June 25, 2017 Outline 1. Introduction: What is modularity? 2. Determining community structure (static networks) 3. Comparing community structure 4. Multilayer networks: Constructing multitask and temporal multilayer dynamic networks 5. Dynamic community structure 6. Useful references OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Introduction: What is Modularity? OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon What is Modularity? Modularity (Community Structure) • A module (community) is a subset of vertices in a graph that have more connections to each other than to the rest of the network • Example social networks: groups of friends Modularity in the brain: • Structural networks: communities are groups of brain areas that are more highly connected to each other than the rest of the brain • Functional networks: communities are groups of brain areas with synchronous activity that is not synchronous with other brain activity OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The Brain is Modular Structural networks: cortical thickness correlations sensorimotor/spatial strategic/executive mnemonic/emotion olfactocentric auditory/language visual processing Chen et al. (2008) Cereb Cortex OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The Brain is Modular • Functional networks: resting state fMRI He et al. (2009) PLOS One OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The
    [Show full text]
  • Multidimensional Network Analysis
    Universita` degli Studi di Pisa Dipartimento di Informatica Dottorato di Ricerca in Informatica Ph.D. Thesis Multidimensional Network Analysis Michele Coscia Supervisor Supervisor Fosca Giannotti Dino Pedreschi May 9, 2012 Abstract This thesis is focused on the study of multidimensional networks. A multidimensional network is a network in which among the nodes there may be multiple different qualitative and quantitative relations. Traditionally, complex network analysis has focused on networks with only one kind of relation. Even with this constraint, monodimensional networks posed many analytic challenges, being representations of ubiquitous complex systems in nature. However, it is a matter of common experience that the constraint of considering only one single relation at a time limits the set of real world phenomena that can be represented with complex networks. When multiple different relations act at the same time, traditional complex network analysis cannot provide suitable an- alytic tools. To provide the suitable tools for this scenario is exactly the aim of this thesis: the creation and study of a Multidimensional Network Analysis, to extend the toolbox of complex network analysis and grasp the complexity of real world phenomena. The urgency and need for a multidimensional network analysis is here presented, along with an empirical proof of the ubiquity of this multifaceted reality in different complex networks, and some related works that in the last two years were proposed in this novel setting, yet to be systematically defined. Then, we tackle the foundations of the multidimensional setting at different levels, both by looking at the basic exten- sions of the known model and by developing novel algorithms and frameworks for well-understood and useful problems, such as community discovery (our main case study), temporal analysis, link prediction and more.
    [Show full text]
  • A Network Approach to Define Modularity of Components In
    A Network Approach to Define Modularity of Components Manuel E. Sosa1 Technology and Operations Management Area, in Complex Products INSEAD, 77305 Fontainebleau, France Modularity has been defined at the product and system levels. However, little effort has e-mail: [email protected] gone into defining and quantifying modularity at the component level. We consider com- plex products as a network of components that share technical interfaces (or connections) Steven D. Eppinger in order to function as a whole and define component modularity based on the lack of Sloan School of Management, connectivity among them. Building upon previous work in graph theory and social net- Massachusetts Institute of Technology, work analysis, we define three measures of component modularity based on the notion of Cambridge, Massachusetts 02139 centrality. Our measures consider how components share direct interfaces with adjacent components, how design interfaces may propagate to nonadjacent components in the Craig M. Rowles product, and how components may act as bridges among other components through their Pratt & Whitney Aircraft, interfaces. We calculate and interpret all three measures of component modularity by East Hartford, Connecticut 06108 studying the product architecture of a large commercial aircraft engine. We illustrate the use of these measures to test the impact of modularity on component redesign. Our results show that the relationship between component modularity and component redesign de- pends on the type of interfaces connecting product components. We also discuss direc- tions for future work. ͓DOI: 10.1115/1.2771182͔ 1 Introduction The need to measure modularity has been highlighted implicitly by Saleh ͓12͔ in his recent invitation “to contribute to the growing Previous research on product architecture has defined modular- field of flexibility in system design” ͑p.
    [Show full text]
  • Task-Dependent Evolution of Modularity in Neural Networks1
    Task-dependent evolution of modularity in neural networks1 Michael Husk¨ en, Christian Igel, and Marc Toussaint Institut fur¨ Neuroinformatik, Ruhr-Universit¨at Bochum, 44780 Bochum, Germany Telephone: +49 234 32 25558, Fax: +49 234 32 14209 fhuesken,igel,[email protected] Connection Science Vol 14, No 3, 2002, p. 219-229 Abstract. There exist many ideas and assumptions about the development and meaning of modu- larity in biological and technical neural systems. We empirically study the evolution of connectionist models in the context of modular problems. For this purpose, we define quantitative measures for the degree of modularity and monitor them during evolutionary processes under different constraints. It turns out that the modularity of the problem is reflected by the architecture of adapted systems, although learning can counterbalance some imperfection of the architecture. The demand for fast learning systems increases the selective pressure towards modularity. 1 Introduction The performance of biological as well as technical neural systems crucially depends on their ar- chitectures. In case of a feed-forward neural network (NN), architecture may be defined as the underlying graph constituting the number of neurons and the way these neurons are connected. Particularly one property of architectures, modularity, has raised a lot of interest among researchers dealing with biological and technical aspects of neural computation. It appears to be obvious to emphasise modularity in neural systems because the vertebrate brain is highly modular both in an anatomical and in a functional sense. It is important to stress that there are different concepts of modules. `When a neuroscientist uses the word \module", s/he is usually referring to the fact that brains are structured, with cells, columns, layers, and regions which divide up the labour of information processing in various ways' 1This paper is a revised and extended version of the GECCO 2001 Late-Breaking Paper by Husk¨ en, Igel, & Toussaint (2001).
    [Show full text]
  • Analyzing Social Media Network for Students in Presidential Election 2019 with Nodexl
    ANALYZING SOCIAL MEDIA NETWORK FOR STUDENTS IN PRESIDENTIAL ELECTION 2019 WITH NODEXL Irwan Dwi Arianto Doctoral Candidate of Communication Sciences, Airlangga University Corresponding Authors: [email protected] Abstract. Twitter is widely used in digital political campaigns. Twitter as a social media that is useful for building networks and even connecting political participants with the community. Indonesia will get a demographic bonus starting next year until 2030. The number of productive ages that will become a demographic bonus if not recognized correctly can be a problem. The election organizer must seize this opportunity for the benefit of voter participation. This study aims to describe the network structure of students in the 2019 presidential election. The first debate was held on January 17, 2019 as a starting point for data retrieval on Twitter social media. This study uses data sources derived from Twitter talks from 17 January 2019 to 20 August 2019 with keywords “#pilpres2019 OR #mahasiswa since: 2019-01-17”. The data obtained were analyzed by the communication network analysis method using NodeXL software. Our Analysis found that Top Influencer is @jokowi, as well as Top, Mentioned also @jokowi while Top Tweeters @okezonenews and Top Replied-To @hasmi_bakhtiar. Jokowi is incumbent running for re-election with Ma’ruf Amin (Senior Muslim Cleric) as his running mate against Prabowo Subianto (a former general) and Sandiaga Uno as his running mate (former vice governor). This shows that the more concentrated in the millennial generation in this case students are presidential candidates @jokowi. @okezonenews, the official twitter account of okezone.com (MNC Media Group).
    [Show full text]
  • Social Network Analysis and Information Propagation: a Case Study Using Flickr and Youtube Networks
    International Journal of Future Computer and Communication, Vol. 2, No. 3, June 2013 Social Network Analysis and Information Propagation: A Case Study Using Flickr and YouTube Networks Samir Akrouf, Laifa Meriem, Belayadi Yahia, and Mouhoub Nasser Eddine, Member, IACSIT 1 makes decisions based on what other people do because their Abstract—Social media and Social Network Analysis (SNA) decisions may reflect information that they have and he or acquired a huge popularity and represent one of the most she does not. This concept is called ″herding″ or ″information important social and computer science phenomena of recent cascades″. Therefore, analyzing the flow of information on years. One of the most studied problems in this research area is influence and information propagation. The aim of this paper is social media and predicting users’ influence in a network to analyze the information diffusion process and predict the became so important to make various kinds of advantages influence (represented by the rate of infected nodes at the end of and decisions. In [2]-[3], the marketing strategies were the diffusion process) of an initial set of nodes in two networks: enhanced with a word-of-mouth approach using probabilistic Flickr user’s contacts and YouTube videos users commenting models of interactions to choose the best viral marketing plan. these videos. These networks are dissimilar in their structure Some other researchers focused on information diffusion in (size, type, diameter, density, components), and the type of the relationships (explicit relationship represented by the contacts certain special cases. Given an example, the study of Sadikov links, and implicit relationship created by commenting on et.al [6], where they addressed the problem of missing data in videos), they are extracted using NodeXL tool.
    [Show full text]
  • Deep Generative Modeling in Network Science with Applications to Public Policy Research
    Working Paper Deep Generative Modeling in Network Science with Applications to Public Policy Research Gavin S. Hartnett, Raffaele Vardavas, Lawrence Baker, Michael Chaykowsky, C. Ben Gibson, Federico Girosi, David Kennedy, and Osonde Osoba RAND Health Care WR-A843-1 September 2020 RAND working papers are intended to share researchers’ latest findings and to solicit informal peer review. They have been approved for circulation by RAND Health Care but have not been formally edted. Unless otherwise indicated, working papers can be quoted and cited without permission of the author, provided the source is clearly referred to as a working paper. RAND’s R publications do not necessarily reflect the opinions of its research clients and sponsors. ® is a registered trademark. CORPORATION For more information on this publication, visit www.rand.org/pubs/working_papers/WRA843-1.html Published by the RAND Corporation, Santa Monica, Calif. © Copyright 2020 RAND Corporation R® is a registered trademark Limited Print and Electronic Distribution Rights This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited. Permission is given to duplicate this document for personal use only, as long as it is unaltered and complete. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial use. For information on reprint and linking permissions, please visit www.rand.org/pubs/permissions.html. The RAND Corporation is a research organization that develops solutions to public policy challenges to help make communities throughout the world safer and more secure, healthier and more prosperous.
    [Show full text]
  • Random Graph Models of Social Networks
    Colloquium Random graph models of social networks M. E. J. Newman*†, D. J. Watts‡, and S. H. Strogatz§ *Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501; ‡Department of Sociology, Columbia University, 1180 Amsterdam Avenue, New York, NY 10027; and §Department of Theoretical and Applied Mechanics, Cornell University, Ithaca, NY 14853-1503 We describe some new exactly solvable models of the structure of actually connected by a very short chain of intermediate social networks, based on random graphs with arbitrary degree acquaintances. He found this chain to be of typical length of distributions. We give models both for simple unipartite networks, only about six, a result which has passed into folklore by means such as acquaintance networks, and bipartite networks, such as of John Guare’s 1990 play Six Degrees of Separation (10). It has affiliation networks. We compare the predictions of our models to since been shown that many networks have a similar small- data for a number of real-world social networks and find that in world property (11–14). some cases, the models are in remarkable agreement with the data, It is worth noting that the phrase ‘‘small world’’ has been used whereas in others the agreement is poorer, perhaps indicating the to mean a number of different things. Early on, sociologists used presence of additional social structure in the network that is not the phrase both in the conversational sense of two strangers who captured by the random graph. discover that they have a mutual friend—i.e., that they are separated by a path of length two—and to refer to any short path social network is a set of people or groups of people, between individuals (8, 9).
    [Show full text]
  • Navigating Networks by Using Homophily and Degree
    Navigating networks by using homophily and degree O¨ zgu¨r S¸ ims¸ek* and David Jensen Department of Computer Science, University of Massachusetts, Amherst, MA 01003 Edited by Peter J. Bickel, University of California, Berkeley, CA, and approved July 11, 2008 (received for review January 16, 2008) Many large distributed systems can be characterized as networks We show that, across a wide range of synthetic and real-world where short paths exist between nearly every pair of nodes. These networks, EVN performs as well as or better than the best include social, biological, communication, and distribution net- previous algorithms. More importantly, in the majority of cases works, which often display power-law or small-world structure. A where previous algorithms do not perform well, EVN synthesizes central challenge of distributed systems is directing messages to whatever homophily and degree information can be exploited to specific nodes through a sequence of decisions made by individual identify much shorter paths than any previous method. nodes without global knowledge of the network. We present a These results have implications for understanding the func- probabilistic analysis of this navigation problem that produces a tioning of current and prospective distributed systems that route surprisingly simple and effective method for directing messages. messages by using local information. These systems include This method requires calculating only the product of the two social networks routing messages, referral systems for finding measures widely used to summarize all local information. It out- informed experts, and also technological systems for routing performs prior approaches reported in the literature by a large messages on the Internet, ad hoc wireless networking, and margin, and it provides a formal model that may describe how peer-to-peer file sharing.
    [Show full text]
  • Ensemble-Based Community Detection in Multilayer Networks
    ENSEMBLE-BASED COMMUNITY DETECTION IN MULTILAYER NETWORKS Andrea Tagarelli, Alessia Amelio, Francesco Gullo The 2017 European Conference on Machine Learning & Principles and Practice of Knowledge Discovery in DataBases Experimental evaluation Datasets • Our experimental evaluation was mainly conducted on seven real-world multilayer network datasets Experimental evaluation Datasets • We also resorted to a synthetic multilayer network generator, mLFR Benchmark, mainly for our evaluation of efficiency of the M-EMCD method • We used mLFR to create a multilayer network with 1 million of nodes, setting other available parameters as follows: • 10 layers, • average degree 30, • maximum degree 100, • mixing at 20% , • layer mixing 2. Experimental evaluation Competing methods • flattening methods • apply a community detection method on the flattened graph of the input multilayer network • it is a weighted multigraph having V as set of nodes, the set of edges, and edge weights that express the number of layers on which two nodes are connected • Nerstrand algorithm1 1 D. LaSalle and G. Karypis, "Multi-threaded modularity based graph clustering using the multilevel paradigm", J. Parallel Distrib. Comput., 76:66–80, 2015. Experimental evaluation Competing methods • aggregation methods • detect a community structure separately for each network layer, after that an aggregation mechanism is used to obtain the final community structure • Principal Modularity Maximization (PMM)2 • frequent pAttern mining-BAsed Community discoverer in mUltidimensional networkS (ABACUS)3 2 L. Tang, X. Wang, and H. Liu, “Uncovering groups via heterogeneous interaction analysis,” in Proc. ICDM, 2009, pp. 503–512. 3 M. Berlingerio, F. Pinelli, and F. Calabrese, "ABACUS: frequent pattern mining-based community discovery in multidimensional networks", Data Min.
    [Show full text]