Abstracts for Sunbelt XXXIV

Total Page:16

File Type:pdf, Size:1020Kb

Load more

Meta-analysis on school level variables in a co-evolving network analyses of adolescent friendship and smoking behaviour McAneney, H., Cochrane, G., Higgins, K., McCann, J., & Kee, F. (2014). Meta-analysis on school level variables in a co-evolving network analyses of adolescent friendship and smoking behaviour. 354. Poster session presented at XXXIV Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA), St Pete Beach, United States. Document Version: Publisher's PDF, also known as Version of record Queen's University Belfast - Research Portal: Link to publication record in Queen's University Belfast Research Portal Publisher rights Copyright the authors 2014. General rights Copyright for the publications made accessible via the Queen's University Belfast Research Portal is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The Research Portal is Queen's institutional repository that provides access to Queen's research output. Every effort has been made to ensure that content in the Research Portal does not infringe any person's rights, or applicable UK laws. If you discover content in the Research Portal that you believe breaches copyright or violates any law, please contact [email protected]. Download date:05. Oct. 2021 Abstracts for Sunbelt XXXIV International Network for Social Network Analysis TradeWinds Island Resorts, St. Pete Beach, FL February 18 - 23, 2014 Abstracts for Sunbelt XXXIV 1 2-Mode Networks WED.PM1 2-Mode Networks WED.PM1 Communities in Multi-Mode and Multi-Level Networks: Some Insights from Synthetic Data David Melamed, University of South Carolina, Department of Sociology Contact: [email protected] The literature on discovering communities in networks, or densely connected subsets of vertices within the network, has exploded in the past decade (Fortunato, 2010). Almost all of this research, however, identifies communities in one-mode networks (e.g., person-to-person networks). Very little research has examined the identification of community structures in multi-mode or multi-level networks (c.f., Barber, 2007; Mucha et al., 2010; Melamed et al. 2013). In an effort to address this shortcoming in the literature, we describe how to generalize three commonly used algorithms for the identification of communities in one-mode networks to multi-mode and multi-level networks: Girvan and Newman’s (2002) betweenness-based algorithm, Newman’s (2006) spectral partitioning, and simulated annealing (e.g., Kirkpatrick 1984). To evaluate the algorithms, we rely on extensive network simulations. Results of the simulations reveal that spectral partitioning does not perform as well as the other algorithms. Results also indicate that the algorithms are more effective on denser networks – having more information to exploit aids the identification of the underlying community structure. We conclude with a discussion of directions for further research, including other community detection algorithms that would benefit from generalization to multi-mode and multi-level networks. 2-Mode Networks WED.PM1 Professions as skill structures: Institutionalizing knowledge of data science Philipp Brandt, Columbia University Contact: [email protected] This study explores the relationship between skill densities and the emergence of professions. A method is developed using skills mentioned in job descriptions that are representative of a certain profession. These skills serve as features in a logistic classifier that is trained to identify job descriptions mentioning skills of a certain profession regardless of the specific title. This method is applied to a series of cases, including the canonical cases of legal and social work, Abstracts for Sunbelt XXXIV 2 medicine, and the pseudo--profession of project management. The method achieves a precision of around 90 to 95 percent for proper professions, but much lower scores for pseudo- professions. These results confirm theories differentiating expert work from other types by having a formalized knowledge base. The proper professions are then transformed into a position--skills co--occurrence network to analyze the meso--structure of expert knowledge. "Data science" is studied as the focal case of successful professionalization. It is compared to legal work as the baseline and risk analysts as counterfactual case. Community detection analyses indicate similar modularity scores for all cases, but accounting for densities within and between concrete clusters reveals higher centralization of failing professions and closure in the case of successfully institutionalized and institutionalizing professions. This study contributes a new methodological strategy that overcomes existing limitations to quantitatively study professional labor with traditional data by proposing a classifier for unstructured data. Substantively, block models show that the informal knowledge structure of a profession varies independent of it's degree of formal organization. Abstracts for Sunbelt XXXIV 3 Centrality in Social Networks WED.PM1 Centrality in Social Networks WED.PM1 Defining Network Positions Ulrik Brandes, Unversity of Konstanz Contact: [email protected] As part of a grander scheme to advance the methodology of network analysis, a precise notion of position is proposed. The definition is sufficiently general to integrate a range of network- analytic concepts (e.g., social capital, centrality, role, or brokerage) into a framework of positional comparison. Since they are retained as special cases, previous methods are not replaced but related in novel ways, with certain gaps filled in. By explicating otherwise hidden assumptions and unwitting decisions, the framework also points to the loci for substantive theory and interpretation fallacies. Examples demonstrate that, despite its abstract look and feel, the approach is rather practical. Centrality in Social Networks WED.PM1 Growth, Stability, Change and Inequality in Dynamic Ego Networks David Hachen, University of Notre Dame, Omar Lizardo Contact: [email protected] It is well-known that in social networks there is inequality in vertex degree with some people having much larger ego networks than others. However there is debate about how such inequalities emerge and why some people have more social ties than others. With fine-grained temporal data on the formation and decay of social ties, we distinguish between four ego network traits related to degree: cumulative degree, effective degree, active degree, and churn. After conceptually and operationally distinguishing between these four traits, we focus on effective degree, the number of people a person could interact with at a given point in time. Using behavioral data on social ties gathered from analyses of communication events (texts and voice calls) of 161 students during their first academic year at the University of Notre Dame, we map out how student’s ego networks involving other ND students grow, stabilize and change over 39 weeks. Analyses reveal that (1) after an initial growth period, effective degree stabilizes, (2) when it stabilizes, effective degree evidences inequality, and (3) the most important predictor of this inequality is how outgoing a student is, measured by an extroversion scale administered prior to a student’s arrival at ND. These findings call into Abstracts for Sunbelt XXXIV 4 question preferential attachment models of growth in vertex degree that stipulate that inequality in degree occurs through an endogenous popularity tournament process. Instead an exogenous factor, a person’s capacity to be sociable, predicts initial effective degree, and because effective degree is fairly stable, a student’s effective degree at the end of their first academic year. Centrality in Social Networks WED.PM1 Some properties and extensions of PN centrality Martin Everett, University of Manchester, Stephen Borgatti Contact: [email protected] Recently Everett and Borgatti have proposed a new centrality measure, PN centrality for networks that contain positive and negative ties. We examine the performance of PN centrality and give extreme examples which highlight its potential. In addition we look at some of the parameters that are fixed to normalize the measure and suggest alternatives which may prove useful for different types of data. Finally we suggest some related alternatives which are part of the same family but use different underlying assumptions. Centrality in Social Networks WED.PM1 Subgroup Centrality: Methods and Examples Jocelyn Bell, United States Military Academy Contact: [email protected] In a social network consisting of nodes with different attributes or community groupings, identifiable subgroups emerge that intra- and inter-relate. We present a method for calculating centrality measures with respect to subgroups defined by these nodal attributes. For example, using the attribute of sex, we can ask questions such as “which women are most influential over the men?” or “which men help sustain the communication of the group of women?” Often, traditional centrality measures fall short of answering such questions. Our subgroup centrality measuring method uncovers previously hidden network features, as evidenced by our discussion and analysis of a classic social network. Abstracts for Sunbelt XXXIV 5 Collective Actions and Social Movements WED.PM1
Recommended publications
  • A Python Library to Model and Analyze Diffusion Processes Over Complex Networks

    A Python Library to Model and Analyze Diffusion Processes Over Complex Networks

    International Journal of Data Science and Analytics (2018) 5:61–79 https://doi.org/10.1007/s41060-017-0086-6 APPLICATIONS NDlib: a python library to model and analyze diffusion processes over complex networks Giulio Rossetti2 · Letizia Milli1,2 · Salvatore Rinzivillo2 · Alina Sîrbu1 · Dino Pedreschi1 · Fosca Giannotti2 Received: 19 October 2017 / Accepted: 11 December 2017 / Published online: 20 December 2017 © Springer International Publishing AG, part of Springer Nature 2017 Abstract Nowadays the analysis of dynamics of and on networks represents a hot topic in the social network analysis playground. To support students, teachers, developers and researchers, in this work we introduce a novel framework, namely NDlib,an environment designed to describe diffusion simulations. NDlib is designed to be a multi-level ecosystem that can be fruitfully used by different user segments. For this reason, upon NDlib, we designed a simulation server that allows remote execution of experiments as well as an online visualization tool that abstracts its programmatic interface and makes available the simulation platform to non-technicians. Keywords Social network analysis software · Epidemics · Opinion dynamics 1 Introduction be modeled as networks and, as such, analyzed. Undoubt- edly, such pervasiveness has produced an amplification in the In the last decades, social network analysis, henceforth SNA, visibility of network analysis studies thus making this com- has received increasing attention from several heterogeneous plex and interesting field one of the most widespread among fields of research. Such popularity was certainly due to the higher education centers, universities and academies. Given flexibility offered by graph theory: a powerful tool that the exponential diffusion reached by SNA, several tools were allows reducing countless phenomena to a common ana- developed to make it approachable to the wider audience pos- lytical framework whose basic bricks are nodes and their sible.
  • Evolving Networks and Social Network Analysis Methods And

    Evolving Networks and Social Network Analysis Methods And

    DOI: 10.5772/intechopen.79041 ProvisionalChapter chapter 7 Evolving Networks andand SocialSocial NetworkNetwork AnalysisAnalysis Methods and Techniques Mário Cordeiro, Rui P. Sarmento,Sarmento, PavelPavel BrazdilBrazdil andand João Gama Additional information isis available atat thethe endend ofof thethe chapterchapter http://dx.doi.org/10.5772/intechopen.79041 Abstract Evolving networks by definition are networks that change as a function of time. They are a natural extension of network science since almost all real-world networks evolve over time, either by adding or by removing nodes or links over time: elementary actor-level network measures like network centrality change as a function of time, popularity and influence of individuals grow or fade depending on processes, and events occur in net- works during time intervals. Other problems such as network-level statistics computation, link prediction, community detection, and visualization gain additional research impor- tance when applied to dynamic online social networks (OSNs). Due to their temporal dimension, rapid growth of users, velocity of changes in networks, and amount of data that these OSNs generate, effective and efficient methods and techniques for small static networks are now required to scale and deal with the temporal dimension in case of streaming settings. This chapter reviews the state of the art in selected aspects of evolving social networks presenting open research challenges related to OSNs. The challenges suggest that significant further research is required in evolving social networks, i.e., existent methods, techniques, and algorithms must be rethought and designed toward incremental and dynamic versions that allow the efficient analysis of evolving networks. Keywords: evolving networks, social network analysis 1.
  • Homophily and Long-Run Integration in Social Networks∗

    Homophily and Long-Run Integration in Social Networks∗

    Homophily and Long-Run Integration in Social Networks∗ Yann Bramoulléy Sergio Currariniz Matthew O. Jacksonx Paolo Pin{ Brian W. Rogersk January 19, 2012 Abstract We study network formation in which nodes enter sequentially and form connections through a combination of random meetings and network-based search, as in Jackson and Rogers (2007). We focus on the impact of agents' heterogeneity on link patterns when connections are formed under type-dependent biases. In particular, we are concerned with how the local neighborhood of a node evolves as the node ages. We provide a surprising general result on long-run in- tegration whereby the composition of types in a node's neighborhood approaches the global type distribution, provided that the search part of the meeting process is unbiased. Integration, however, occurs only for suciently old nodes, while the aggregate distribution of connections still reects the bias of the random process. For a special case of the model, we analyze the form of these biases with regard to type-based degree distributions and group-level homophily patterns. Finally, we illustrate aspects of the model with an empirical application to data on citations in physics journals. JEL Codes: A14, D85, I21. ∗Following the suggestion of JET editors, this paper draws from two working papers developed independently: Bramoullé and Rogers (2010) and Currarini, Jackson and Pin (2010b). We gratefully acknowledge nancial support from the NSF under grant SES-0961481 and we thank Vincent Boucher for his research assistance. We also thank Habiba Djebbari, Andrea Galeotti, Sanjeev Goyal, James Moody, Betsy Sinclair, Bruno Strulovici, and Adrien Vigier, as well as numerous seminar participants.
  • Evolving Neural Networks Using Behavioural Genetic Principles

    Evolving Neural Networks Using Behavioural Genetic Principles

    Evolving Neural Networks Using Behavioural Genetic Principles Maitrei Kohli A dissertation submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy Department of Computer Science & Information Systems Birkbeck, University of London United Kingdom March 2017 0 Declaration This thesis is the result of my own work, except where explicitly acknowledged in the text. Maitrei Kohli …………………. 1 ABSTRACT Neuroevolution is a nature-inspired approach for creating artificial intelligence. Its main objective is to evolve artificial neural networks (ANNs) that are capable of exhibiting intelligent behaviours. It is a widely researched field with numerous successful methods and applications. However, despite its success, there are still open research questions and notable limitations. These include the challenge of scaling neuroevolution to evolve cognitive behaviours, evolving ANNs capable of adapting online and learning from previously acquired knowledge, as well as understanding and synthesising the evolutionary pressures that lead to high-level intelligence. This thesis presents a new perspective on the evolution of ANNs that exhibit intelligent behaviours. The novel neuroevolutionary approach presented in this thesis is based on the principles of behavioural genetics (BG). It evolves ANNs’ ‘general ability to learn’, combining evolution and ontogenetic adaptation within a single framework. The ‘general ability to learn’ was modelled by the interaction of artificial genes, encoding the intrinsic properties of the ANNs, and the environment, captured by a combination of filtered training datasets and stochastic initialisation weights of the ANNs. Genes shape and constrain learning whereas the environment provides the learning bias; together, they provide the ability of the ANN to acquire a particular task.
  • Albert-László Barabási with Emma K

    Albert-László Barabási with Emma K

    Network Science Class 5: BA model Albert-László Barabási With Emma K. Towlson, Sebastian Ruf, Michael Danziger and Louis Shekhtman www.BarabasiLab.com Section 1 Introduction Section 1 Hubs represent the most striking difference between a random and a scale-free network. Their emergence in many real systems raises several fundamental questions: • Why does the random network model of Erdős and Rényi fail to reproduce the hubs and the power laws observed in many real networks? • Why do so different systems as the WWW or the cell converge to a similar scale-free architecture? Section 2 Growth and preferential attachment BA MODEL: Growth ER model: the number of nodes, N, is fixed (static models) networks expand through the addition of new nodes Barabási & Albert, Science 286, 509 (1999) BA MODEL: Preferential attachment ER model: links are added randomly to the network New nodes prefer to connect to the more connected nodes Barabási & Albert, Science 286, 509 (1999) Network Science: Evolving Network Models Section 2: Growth and Preferential Sttachment The random network model differs from real networks in two important characteristics: Growth: While the random network model assumes that the number of nodes is fixed (time invariant), real networks are the result of a growth process that continuously increases. Preferential Attachment: While nodes in random networks randomly choose their interaction partner, in real networks new nodes prefer to link to the more connected nodes. Barabási & Albert, Science 286, 509 (1999) Network Science: Evolving Network Models Section 3 The Barabási-Albert model Origin of SF networks: Growth and preferential attachment (1) Networks continuously expand by the GROWTH: addition of new nodes add a new node with m links WWW : addition of new documents PREFERENTIAL ATTACHMENT: (2) New nodes prefer to link to highly the probability that a node connects to a node connected nodes.
  • Mining Evolving Network Processes

    Mining Evolving Network Processes

    Mining evolving network processes Misael Mongiov`ı, Petko Bogdanov, Ambuj K. Singh Email:[email protected], [email protected], [email protected] Abstract—Processes within real world networks evolve accord- NZ Cricket Players ing to the underlying graph structure. A bounty of examples New New India India Zealand Zealand exists in diverse network genres: botnet communication growth, NCT NCT moving traffic jams [25], information foraging [37] in document NCT NCT networks (WWW and Wikipedia), and spread of viral memes Cricket Cricket or opinions in social networks. The network structure in all the Pages Pages Sri Sri above examples remains relatively fixed, while the shape, size and Pakistan Pakistan Lanka Lanka NCT NCT NCT position of the affected network regions change gradually with NCT 2011 Cricket World Cup time. Traffic jams grow, move, shrink and eventually disappear. 28/3 29/3 Finals Schedule Public attention shifts among current hot topics inducing a similar New India Zealand India shift of highly accessed Wikipedia articles. Discovery of such NCT NCT NCT smoothly evolving network processes has the potential to expose India NCT the intrinsic mechanisms of complex network dynamics, enable Cricket Cricket new data-driven models and improve network design. Pages Pages Cricket Sri Sri Pakistan Pakistan Pages Lanka Lanka We introduce the novel problem of Mining smoothly evolving NCT NCT NCT NCT processes (MINESMOOTH) in networks with dynamic real-valued node/edge weights. We show that ensuring smooth transitions in 30/3 - 31/3 1/4 - 4/4 5/4 the solution is NP-hard even on restricted network structures such as trees.
  • On Community Structure in Complex Networks: Challenges and Opportunities

    On Community Structure in Complex Networks: Challenges and Opportunities

    On community structure in complex networks: challenges and opportunities Hocine Cherifi · Gergely Palla · Boleslaw K. Szymanski · Xiaoyan Lu Received: November 5, 2019 Abstract Community structure is one of the most relevant features encoun- tered in numerous real-world applications of networked systems. Despite the tremendous effort of a large interdisciplinary community of scientists working on this subject over the past few decades to characterize, model, and analyze communities, more investigations are needed in order to better understand the impact of community structure and its dynamics on networked systems. Here, we first focus on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms. We discuss modularity and the use of modularity maximization as the basis for community detection. Then, we follow with an overview of the Stochastic Block Model and its different variants as well as inference of community structures from such models. Next, we focus on time evolving networks, where existing nodes and links can disappear, and in parallel new nodes and links may be introduced. The extraction of communities under such circumstances poses an interesting and non-trivial problem that has gained considerable interest over Hocine Cherifi LIB EA 7534 University of Burgundy, Esplanade Erasme, Dijon, France E-mail: hocine.cherifi@u-bourgogne.fr Gergely Palla MTA-ELTE Statistical and Biological Physics Research Group P´azm´any P. stny. 1/A, Budapest, H-1117, Hungary E-mail: [email protected] Boleslaw K. Szymanski Department of Computer Science & Network Science and Technology Center Rensselaer Polytechnic Institute 110 8th Street, Troy, NY 12180, USA E-mail: [email protected] Xiaoyan Lu Department of Computer Science & Network Science and Technology Center Rensselaer Polytechnic Institute 110 8th Street, Troy, NY 12180, USA E-mail: [email protected] arXiv:1908.04901v3 [physics.soc-ph] 6 Nov 2019 2 Cherifi, Palla, Szymanski, Lu the last decade.
  • Defining and Identifying Cograph Communities in Complex Networks

    Defining and Identifying Cograph Communities in Complex Networks

    Home Search Collections Journals About Contact us My IOPscience Defining and identifying cograph communities in complex networks This content has been downloaded from IOPscience. Please scroll down to see the full text. 2015 New J. Phys. 17 013044 (http://iopscience.iop.org/1367-2630/17/1/013044) View the table of contents for this issue, or go to the journal homepage for more Download details: IP Address: 136.186.1.81 This content was downloaded on 18/05/2015 at 13:56 Please note that terms and conditions apply. New J. Phys. 17 (2015) 013044 doi:10.1088/1367-2630/17/1/013044 PAPER Defining and identifying cograph communities in complex networks OPEN ACCESS Songwei Jia1, Lin Gao1, Yong Gao2, James Nastos2, Yijie Wang3, Xindong Zhang1 and Haiyang Wang1 RECEIVED 1 School of Computer Science and Technology, Xidian University, Xi’an 710071, People’s Republic of China 14 July 2014 2 Department of Computer Science, University of British Columbia Okanagan, Kelowna, British Columbia, V1V 1V7 Canada ACCEPTED FOR PUBLICATION 3 Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX 77843, USA 11 December 2014 PUBLISHED E-mail: [email protected] 20 January 2015 Keywords: complex networks, community dection, centrality Content from this work may be used under the terms of the Creative Abstract Commons Attribution 3.0 licence. Community or module detection is a fundamental problem in complex networks. Most of the tradi- Any further distribution of tional algorithms available focus only on vertices in a subgraph that are densely connected among this work must maintain attribution to the author themselves while being loosely connected to the vertices outside the subgraph, ignoring the topologi- (s) and the title of the cal structure of the community.
  • Evolving Network Model: a Novel Approach to Disease Simulation

    Evolving Network Model: a Novel Approach to Disease Simulation

    Evolving Network Model: A Novel Approach to Disease Simulation Ayla Safran Supervised by Dr. Dylan Shepardson A thesis submitted to the department of Mathematics and Statistics in partial fulfillment of the requirements for the degree of Bachelor of Arts with Honors. Department of Mathematics and Statistics Mount Holyoke College May 2018 Acknowledgments The completion of this project would not have been possible without the support of my advisor, Dylan Shepardson. You gave me the opportunity to partake in this project, and have pushed me to become a more capable, independent researcher during its course. Thank you so much for everything. I would also like to thank Chaitra Gopalappa and Buyannemekh Munkhbat, with whom the project began. I am excited to see where your future work with this project takes you. Finally, I would like to thank the Four College Biomath Consortium for supporting my research process, and the Mount Holyoke College Mathematics and Statistics department for giving me an academic home over the past three years. I am extremely sad to be leaving, but also excited to come back in the future as an alumna! Contents 1 Abstract 1 2 Introduction 3 3 Graph Theory Background 8 3.1 Graph Theory Definitions . .8 3.2 Important Network Properties . 10 3.2.1 Degree Distribution and Average Degree . 10 3.2.2 Graph Density . 12 3.2.3 Clustering Coefficient . 12 3.2.4 Average Path Length and Diameter . 13 3.2.5 Spectral Graph Theory . 16 3.3 Types of Networks . 16 3.3.1 Random Networks (Erd}os-R´enyi) .
  • Controllability of Social Networks and the Strategic Use of Random Information

    Controllability of Social Networks and the Strategic Use of Random Information

    Controllability of Social Networks and the Strategic Use of Random Information Marco Cremonini1, Francesca Casamassima2, 1 University of Milan, Italy 2 Sogetel, Italy * [email protected] Abstract This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a time-varying adaptive network, and considers two well-known strategies for influencing social contexts. One is the selection of few influencers for manipulating their actions in order to drive the whole network to a certain behavior; the other, instead, drives the network behavior acting on the state of a large subset of ordinary, scarcely influencing users. The two approaches have been studied in terms of network and diffusion effects. The network effect is analyzed through the changes induced on network average degree and clustering coefficient, while the diffusion effect is based on two ad-hoc metrics defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of arXiv:1807.07761v1 [cs.SI] 20 Jul 2018 agent interests. The results, obtained through simulations on synthetic networks, show a rich dynamics and strong effects on the communication structure and on the distribution of knowledge and skills, supporting our hypothesis that the strategic use of random information could represent a realistic approach to social network controllability, and that with both strategies, in principle, the control effect could be remarkable.
  • Node-Link Network Visualizations

    Node-Link Network Visualizations

    Watson Health Cognitive Visualization Lab Perspective on Network Visualization Cody Dunne November 5, 2015 [email protected] ibm.biz/cogvislab Perspectives on Network Visualization Agenda Introduction Node-Link Composite Alternate Coordinated Discussion Cody Dunne, PhD – Cognitive Visualization RSM Web: ibm.biz/codydunne Email: [email protected] My research focuses on information visualization, visual analytics, and cognitive computing. My goal is to design and build interactive visualization systems for users to effectively help them reach their goals. Epidemiology & network type group overlap dynamic networks overviews Specifically I want to make data discovery, cleaning, exploration, and sharing results as fluid and easy and accessible as possible. While at IBM I have been involved in many projects to this end collaborating with teams across the organization, with more coming! I received a PhD and M.S. in Computer Science under Ben Shneiderman at the University of Maryland Human news term computer network literature exploration Computer Interaction Lab, and a B.A. in Computer Science occurrence traffic and Mathematics from Cornell College. I contribute to NodeXL and have worked at Microsoft Research and NIST. Network Visualization in IBM To name only a few TED WDA-LS WDA WGA Alchemy Twitter i2 Designers IOC Epidemics Network Visualization in IBM Services exposing network data (many more coming) Node-Link Network Visualizations Introduction Node-Link Composite Alternate Coordinated Discussion Layout Algorithms Matter Immense variation in layout readability and speed Hachul & Jünger, 2006 Readability Metrics for Layouts Algorithm Understanding Talk from the Graph Summit 2015: ibm.biz/gs_rm_slides ibm.biz/gs_rm_video Dunne C, Ross SI, Shneiderman B and Martino M (2015), "Readability metric feedback for aiding node-link visualization designers", IBM Journal of Research and Development.
  • Evolution of a Large Online Social Network Haibo Hu* and Xiaofan Wang Complex Networks and Control Lab, Shanghai Jiao Tong University, Shanghai 200240, China

    Evolution of a Large Online Social Network Haibo Hu* and Xiaofan Wang Complex Networks and Control Lab, Shanghai Jiao Tong University, Shanghai 200240, China

    Evolution of a large online social network Haibo Hu* and Xiaofan Wang Complex Networks and Control Lab, Shanghai Jiao Tong University, Shanghai 200240, China Abstract: Although recently there are extensive research on the collaborative networks and online communities, there is very limited knowledge about the actual evolution of the online social networks (OSN). In the letter, we study the structural evolution of a large online virtual community. We find that the scale growth of the OSN shows non-trivial S shape which may provide a proper exemplification for Bass diffusion model. We reveal that the evolutions of many network properties, such as density, clustering, heterogeneity and modularity, show non-monotone feature, and shrink phenomenon occurs for the path length and diameter of the network. Furthermore, the OSN underwent a transition from degree assortativity characteristic of collaborative networks to degree disassortativity characteristic of many OSNs. Our study has revealed the evolutionary pattern of interpersonal interactions in a specific population and provided a valuable platform for theoretical modeling and further analysis. PACS: 89.65.-s, 87.23.Ge, 89.75.Hc Keywords: Social networking site; Online social network; Complex network; Structural evolution; Assortativity-disassortativity transition 1. Introduction Recently networks have constituted a fundamental framework for analyzing and modeling complex systems [1]. Social networks are typical examples of complex networks. A social network consists of all the people–friends, family, colleague and others–with whom one shares a social relationship, say friendship, commerce, or others. Traditional social network study can date back about half a century, focusing on interpersonal interactions in small groups due to the difficulty in obtaining large data sets [2].