Introduction to Social Media
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Facing the Future: European Research Infrastructures for the Humanities and Social Sciences
Facing the Future: European Research Infrastructures for the Humanities and Social Sciences Adrian Duşa, Dietrich Nelle, Günter Stock, and Gert G. Wagner (Eds.) Facing the Future: European Research Infrastructures for the Humanities and Social Sciences E d i t o r s : Adrian Duşa (SCI-SWG), Dietrich Nelle (BMBF), Günter Stock (ALLEA), and Gert. G. Wagner (RatSWD) ISBN 978-3-944417-03-5 1st edition © 2014 SCIVERO Verlag, Berlin SCIVERO is a trademark of GWI Verwaltungsgesellschaft für Wissenschaftspoli- tik und Infrastrukturentwicklung Berlin UG (haftungsbeschränkt). This book documents the results of the conference Facing the Future: European Research Infrastructure for Humanities and Social Sciences (November 21/22 2013, Berlin), initiated by the Social and Cultural Innovation Strategy Work- ing Group of ESFRI (SCI-SWG) and the German Federal Ministry of Education and Research (BMBF), and hosted by the European Federation of Academies of Sciences and Humanities (ALLEA) and the German Data Forum (RatSWD). Thanks and appreciation are due to all authors, speakers and participants of the conference, and all involved institutions, in particular the German Federal Ministry of Education and Research (BMBF). The ministry funded the conference and this subsequent publication as part of the Union of the German Academies of Sciences and Humanities’ project “Survey and Analysis of Basic Humanities and Social Science Research at the Science Academies Related Research Insti- tutes of Europe”. The views expressed in this publication are exclusively the opinions of the authors and not those of the German Federal Ministry of Education and Research. Editing: Dominik Adrian, Camilla Leathem, Thomas Runge, Simon Wolff Layout and graphic design: Thomas Runge Contents Preface . -
Extracting Insights from Differences: Analyzing Node-Aligned Social
Extracting Insights from Differences: Analyzing Node-aligned Social Graphs by Srayan Datta A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Science and Engineering) in The University of Michigan 2019 Doctoral Committee: Associate Professor Eytan Adar, Chair Associate Professor Mike Cafarella Assistant Professor Danai Koutra Associate Professor Clifford Lampe Srayan Datta [email protected] ORCID iD: 0000-0002-5800-830X c Srayan Datta 2019 To my family and friends ii ACKNOWLEDGEMENTS There are several people who made this dissertation possible, first among this long list is my adviser, Eytan Adar. Pursuing a doctoral program after just finishing un- dergraduate studies can be a daunting task but Eytan made it easy with his patience, kindness, and guidance. I learned a lot from our collaborations and idle conversations and I am very grateful for that. I would like to extend my thanks to the rest of my thesis committee, Mike Ca- farella, Danai Koutra and Cliff Lampe for their suggestions and constructive feed- back. I would also like to thank the following faculty members, Daniel Romero, Ceren Budak, Eric Gilbert and David Jurgens for their long insightful conversations and suggestions about some of my projects. I would like to thank all of friends and colleagues who helped (as a co-author or through critique) or supported me through this process. This is an enormous list but I am especially thankful to Chanda Phelan, Eshwar Chandrasekharan, Sam Carton, Cristina Garbacea, Shiyan Yan, Hari Subramonyam, Bikash Kanungo, and Ram Srivatasa. I would like to thank my parents for their unwavering support and faith in me. -
Network Analysis with Nodexl
Social data: Advanced Methods – Social (Media) Network Analysis with NodeXL A project from the Social Media Research Foundation: http://www.smrfoundation.org About Me Introductions Marc A. Smith Chief Social Scientist Connected Action Consulting Group [email protected] http://www.connectedaction.net http://www.codeplex.com/nodexl http://www.twitter.com/marc_smith http://delicious.com/marc_smith/Paper http://www.flickr.com/photos/marc_smith http://www.facebook.com/marc.smith.sociologist http://www.linkedin.com/in/marcasmith http://www.slideshare.net/Marc_A_Smith http://www.smrfoundation.org http://www.flickr.com/photos/library_of_congress/3295494976/sizes/o/in/photostream/ http://www.flickr.com/photos/amycgx/3119640267/ Collaboration networks are social networks SNA 101 • Node A – “actor” on which relationships act; 1-mode versus 2-mode networks • Edge B – Relationship connecting nodes; can be directional C • Cohesive Sub-Group – Well-connected group; clique; cluster A B D E • Key Metrics – Centrality (group or individual measure) D • Number of direct connections that individuals have with others in the group (usually look at incoming connections only) E • Measure at the individual node or group level – Cohesion (group measure) • Ease with which a network can connect • Aggregate measure of shortest path between each node pair at network level reflects average distance – Density (group measure) • Robustness of the network • Number of connections that exist in the group out of 100% possible – Betweenness (individual measure) F G • -
Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs
LETTER Communicated by Mika Rubinov Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs Yu Wang Eshwar Ghumare [email protected] Laboratory for Cognitive Neurology, Department of Neurosciences, KU Leuven, Leuven 3000, Belgium Rik Vandenberghe [email protected] Laboratory for Cognitive Neurology, Department of Neurosciences, KU Leuven, Leuven 3000, Belgium, and Alzheimer Research Centre, KU Leuven, Leuven Institute for Neuroscience and Disease, KU Leuven, Leuven 3000, Belgium Patrick Dupont [email protected] Laboratory for Cognitive Neurology, Department of Neurosciences, KU Leuven, Leuven 3000, Belgium; Alzheimer Research Centre, KU Leuven, Leuven Institute for Neuroscience and Disease, KU Leuven, Leuven 3000, Belgium; and Medical Imaging Research Center, KU Leuven and University Hospitals Leuven, Leuven 3000, Belgium Binary undirected graphs are well established, but when these graphs are constructed, often a threshold is applied to a parameter describing the connection between two nodes. Therefore, the use of weighted graphs is more appropriate. In this work, we focus on weighted undirected graphs. This implies that we have to incorporate edge weights in the graph mea- sures, which require generalizations of common graph metrics. After re- viewing existing generalizations of the clustering coefficient and the local efficiency, we proposed new generalizations for these graph measures. To be able to compare different generalizations, a number of essential and useful properties were defined that ideally should be satisfied. We ap- plied the generalizations to two real-world networks of different sizes. As a result, we found that not all existing generalizations satisfy all es- sential properties. Furthermore, we determined the best generalization for the clustering coefficient and local efficiency based on their properties and the performance when applied to two networks. -
Scale- Free Networks in Cell Biology
Scale- free networks in cell biology Réka Albert, Department of Physics and Huck Institutes of the Life Sciences, Pennsylvania State University Summary A cell’s behavior is a consequence of the complex interactions between its numerous constituents, such as DNA, RNA, proteins and small molecules. Cells use signaling pathways and regulatory mechanisms to coordinate multiple processes, allowing them to respond to and adapt to an ever-changing environment. The large number of components, the degree of interconnectivity and the complex control of cellular networks are becoming evident in the integrated genomic and proteomic analyses that are emerging. It is increasingly recognized that the understanding of properties that arise from whole-cell function require integrated, theoretical descriptions of the relationships between different cellular components. Recent theoretical advances allow us to describe cellular network structure with graph concepts, and have revealed organizational features shared with numerous non-biological networks. How do we quantitatively describe a network of hundreds or thousands of interacting components? Does the observed topology of cellular networks give us clues about their evolution? How does cellular networks’ organization influence their function and dynamical responses? This article will review the recent advances in addressing these questions. Introduction Genes and gene products interact on several level. At the genomic level, transcription factors can activate or inhibit the transcription of genes to give mRNAs. Since these transcription factors are themselves products of genes, the ultimate effect is that genes regulate each other's expression as part of gene regulatory networks. Similarly, proteins can participate in diverse post-translational interactions that lead to modified protein functions or to formation of protein complexes that have new roles; the totality of these processes is called a protein-protein interaction network. -
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. -
Livro De Resumos EDITORA DA UNIVERSIDADE FEDERAL DE SERGIPE
Organizadores: Carlos Alexandre Borges Garcia Marcus Eugênio Oliveira Lima Livro de Resumos EDITORA DA UNIVERSIDADE FEDERAL DE SERGIPE COORDENADORA DO PROGRAMA EDITORIAL Messiluce da Rocha Hansen COORDENADOR GRÁFICO DA EDITORA UFS Germana Gonçalves de Araújo PROJETO GRÁFICO E EDITORAÇÃO ELETRÔNICA Alisson Vitório de Lima FOTOGRAFIAS Disponibilizadas sob licença Creative Commons, ou de domínio público. Adilson Andrade - Foto da página X; FICHA CATALOGRÁFICA ELABORADA PELA BIBLIOTECA CENTRAL UNIVERSIDADE FEDERAL DE SERGIPE Encontro de Pós-Graduação (8. : 2016 : São Cristóvão, SE) Livro de resumos [recurso eletrônico] : VIII Encontro de Pós-Graduação / organizadores: Carlos Alexandre Borges Garcia, Marcus Eugênio Oliveira Lima. – São Cristóvão : Editora UFS : Universidade E56l Federal de Sergipe, Programa de Pós-Graduação, 2016. 353 p. ISBN 978-85-7822-550-6 1. Pós-graduação – Congresso. I. Universidade Federal de Sergipe. II. Garcia, Carlos Alexandre Borges. III. Lima, Marcus Eugênio Oliveira. CDU 378.046-021.68 Cidade Universitária “Prof. José Aloísio de Campos” CEP 49.100-000 – São Cristóvão - SE. Telefone: 3194 - 6922/6923. e-mail: [email protected] http://livraria.ufs.br/ Este portfólio, ou parte dele, não pode ser reproduzido por qualquer meio sem autorização escrita da Editora. Organizadores: Carlos Alexandre Borges Garcia Marcus Eugênio Oliveira Lima Livro de Resumos UFS São Cristóvão/SE - 2016 Ciências Agrárias A (des)realização da estratégia democrático-popular: Uma análise a partir da realidade do movimento dos trabalhadores rurais sem terra (MST) e do Partido dos Trabalhadores (PT) Autor: SOUSA, Ronilson Barboza de. Orientador: RAMOS FILHO, Eraldo da Silva. A referente tese de doutorado, que vem sendo desenvolvida, tem como objetivo analisar o processo de realização da estratégia democrático-popular, adotada pelo Movimento dos Trabalhadores Rurais Sem Terra (MST) e pelo Partido dos Trabalhadores (PT), especial- mente na luta pela terra e pela reforma agrária. -
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. -
The Role of Homophily Yohsuke Murase 1, Hang-Hyun Jo 2,3,4, János Török5,6,7, János Kertész6,5,4 & Kimmo Kaski4,8
www.nature.com/scientificreports OPEN Structural transition in social networks: The role of homophily Yohsuke Murase 1, Hang-Hyun Jo 2,3,4, János Török5,6,7, János Kertész6,5,4 & Kimmo Kaski4,8 We introduce a model for the formation of social networks, which takes into account the homophily or Received: 17 August 2018 the tendency of individuals to associate and bond with similar others, and the mechanisms of global and Accepted: 27 February 2019 local attachment as well as tie reinforcement due to social interactions between people. We generalize Published: xx xx xxxx the weighted social network model such that the nodes or individuals have F features and each feature can have q diferent values. Here the tendency for the tie formation between two individuals due to the overlap in their features represents homophily. We fnd a phase transition as a function of F or q, resulting in a phase diagram. For fxed q and as a function of F the system shows two phases separated at Fc. For F < Fc large, homogeneous, and well separated communities can be identifed within which the features match almost perfectly (segregated phase). When F becomes larger than Fc, the nodes start to belong to several communities and within a community the features match only partially (overlapping phase). Several quantities refect this transition, including the average degree, clustering coefcient, feature overlap, and the number of communities per node. We also make an attempt to interpret these results in terms of observations on social behavior of humans. In human societies homophily, the tendency of similar individuals getting associated and bonded with each other, is known to be a prime tie formation factor between a pair of individuals1. -
Comm 645 Handout – Nodexl Basics
COMM 645 HANDOUT – NODEXL BASICS NodeXL: Network Overview, Discovery and Exploration for Excel. Download from nodexl.codeplex.com Plugin for social media/Facebook import: socialnetimporter.codeplex.com Plugin for Microsoft Exchange import: exchangespigot.codeplex.com Plugin for Voson hyperlink network import: voson.anu.edu.au/node/13#VOSON-NodeXL Note that NodeXL requires MS Office 2007 or 2010. If your system does not support those (or you do not have them installed), try using one of the computers in the PhD office. Major sections within NodeXL: • Edges Tab: Edge list (Vertex 1 = source, Vertex 2 = destination) and attributes (Fig.1→1a) • Vertices Tab: Nodes and attribute (nodes can be imported from the edge list) (Fig.1→1b) • Groups Tab: Groups of nodes defined by attribute, clusters, or components (Fig.1→1c) • Groups Vertices Tab: Nodes belonging to each group (Fig.1→1d) • Overall Metrics Tab: Network and node measures & graphs (Fig.1→1e) Figure 1: The NodeXL Interface 3 6 8 2 7 9 13 14 5 12 4 10 11 1 1a 1b 1c 1d 1e Download more network handouts at www.kateto.net / www.ognyanova.net 1 After you install the NodeXL template, a new NodeXL tab will appear in your Excel interface. The following features will be available in it: Fig.1 → 1: Switch between different data tabs. The most important two tabs are "Edges" and "Vertices". Fig.1 → 2: Import data into NodeXL. The formats you can use include GraphML, UCINET DL files, and Pajek .net files, among others. You can also import data from social media: Flickr, YouTube, Twitter, Facebook (requires a plugin), or a hyperlink networks (requires a plugin). -
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. -
Clustering Coefficient
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, “Networks: An Introduction” Part 8: Small-World Network Model 2 Small World-Phenomenon l Milgram’s experiment § Given a target individual - stockbroker in Boston - pass the message to a person you know on a first name basis who you think is closest to the target l Outcome § 20% of the the chains were completed § Average chain length of completed trials ~ 6.5 l Dodds, Muhamad and Watts have repeated this experiment using e-mail communications § Completion rate is lower, average chain length is lower too 3 Small World-Phenomenon l Are these numbers accurate? § What bias do the uncompleted chains introduce? inter-country intra-country Source: An Experimental Study of Search in Global Social Networks: Peter Sheridan Dodds, Roby Muhamad, and 4 Duncan J. Watts (8 August 2003); Science 301 (5634), 827. Clustering in real networks l What would you expect if networks were completely cliquish? § Friends of my friends are also my friends § What happens to small paths? l Real-world networks (e.g., social networks) exhibit high levels of transitivity/clustering § But they also exhibit short paths too 5 Clustering coefficient l The network models that we have seen until now (random graph, configuration model and preferential attachment) do not show any significant clustering coefficient § For instance the random graph model has a clustering coefficient of c/n-1, which vanishes in