Homophily, Transitivity, and Preferential Attachment
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Group-In-A-Box Layout for Multi-Faceted Analysis of Communities
2011 IEEE International Conference on Privacy, Security, Risk, and Trust, and IEEE International Conference on Social Computing Group-In-a-Box Layout for Multi-faceted Analysis of Communities Eduarda Mendes Rodrigues*, Natasa Milic-Frayling †, Marc Smith‡, Ben Shneiderman§, Derek Hansen¶ * Dept. of Informatics Engineering, Faculty of Engineering, University of Porto, Portugal [email protected] † Microsoft Research, Cambridge, UK [email protected] ‡ Connected Action Consulting Group, Belmont, California, USA [email protected] § Dept. of Computer Science & Human-Computer Interaction Lab University of Maryland, College Park, Maryland, USA [email protected] ¶ College of Information Studies & Center for the Advanced Study of Communities and Information University of Maryland, College Park, Maryland, USA [email protected] Abstract—Communities in social networks emerge from One particularly important aspect of social network interactions among individuals and can be analyzed through a analysis is the detection of communities, i.e., sub-groups of combination of clustering and graph layout algorithms. These individuals or entities that exhibit tight interconnectivity approaches result in 2D or 3D visualizations of clustered among the wider population. For example, Twitter users who graphs, with groups of vertices representing individuals that regularly retweet each other’s messages may form cohesive form a community. However, in many instances the vertices groups within the Twitter social network. In a network have attributes that divide individuals into distinct categories visualization they would appear as clusters or sub-graphs, such as gender, profession, geographic location, and similar. It often colored distinctly or represented by a different vertex is often important to investigate what categories of individuals shape in order to convey their group identity. -
Joint Estimation of Preferential Attachment and Node Fitness In
www.nature.com/scientificreports OPEN Joint estimation of preferential attachment and node fitness in growing complex networks Received: 15 April 2016 Thong Pham1, Paul Sheridan2 & Hidetoshi Shimodaira1 Accepted: 09 August 2016 Complex network growth across diverse fields of science is hypothesized to be driven in the main by Published: 07 September 2016 a combination of preferential attachment and node fitness processes. For measuring the respective influences of these processes, previous approaches make strong and untested assumptions on the functional forms of either the preferential attachment function or fitness function or both. We introduce a Bayesian statistical method called PAFit to estimate preferential attachment and node fitness without imposing such functional constraints that works by maximizing a log-likelihood function with suitably added regularization terms. We use PAFit to investigate the interplay between preferential attachment and node fitness processes in a Facebook wall-post network. While we uncover evidence for both preferential attachment and node fitness, thus validating the hypothesis that these processes together drive complex network evolution, we also find that node fitness plays the bigger role in determining the degree of a node. This is the first validation of its kind on real-world network data. But surprisingly the rate of preferential attachment is found to deviate from the conventional log-linear form when node fitness is taken into account. The proposed method is implemented in the R package PAFit. The study of complex network evolution is a hallmark of network science. Research in this discipline is inspired by empirical observations underscoring the widespread nature of certain structural features, such as the small-world property1, a high clustering coefficient2, a heavy tail in the degree distribution3, assortative mixing patterns among nodes4, and community structure5 in a multitude of biological, societal, and technological networks6–11. -
Analysis of Social Networks with Missing Data (Draft: Do Not Cite)
Analysis of social networks with missing data (Draft: do not cite) G. Kossinets∗ Department of Sociology, Columbia University, New York, NY 10027. (Dated: February 4, 2003) We perform sensitivity analyses to assess the impact of missing data on the struc- tural properties of social networks. The social network is conceived of as being generated by a bipartite graph, in which actors are linked together via multiple interaction contexts or affiliations. We discuss three principal missing data mecha- nisms: network boundary specification (non-inclusion of actors or affiliations), survey non-response, and censoring by vertex degree (fixed choice design). Based on the simulation results, we propose remedial techniques for some special cases of network data. I. INTRODUCTION Social network data is often incomplete, which means that some actors or links are missing from the dataset. In a normal social setting, much of the incompleteness arises from the following main sources: the so called boundary specification problem (BSP); respondent inaccuracy; non-response in network surveys; or may be inadvertently introduced via study design (Table I). Although missing data is abundant in empirical studies, little research has been conducted on the possible effect of missing links or nodes on the measurable properties of networks at large.1 In particular, a revision of the original work done primarily in the 1970-80s [4, 17, 21] seems necessary in the light of recent advances that brought new classes of networks to the attention of the interdisciplinary research community [1, 3, 30, 37, 40, 41]. Let us start with a few examples from the literature to illustrate different incarnations of missing data in network research. -
Graph Theory and Social Networks Spring 2014 Notes
Graph Theory and Social Networks Spring 2014 Notes Kimball Martin April 30, 2014 Introduction Graph theory is a branch of discrete mathematics (more specifically, combinatorics) whose origin is generally attributed to Leonard Euler's solution of the K¨onigsberg bridge problem in 1736. At the time, there were two islands in the river Pregel, and 7 bridges connecting the islands to each other and to each bank of the river. As legend goes, for leisure, people would try to find a path in the city of K¨onigsberg which traversed each of the 7 bridges exactly once (see Figure1). Euler represented this abstractly as a graph∗, and showed by elementary means that no such path exists. Figure 1: The Seven Bridges of K¨onigsberg (Source: Wikimedia Commons) Intuitively, a graph is just a set of objects which are connected in some way. The objects are called vertices or nodes. Pictorially, we usually draw the vertices as circles, and draw a line between two vertices if they are connected or related (in whatever context we have in mind). These lines are called edges or links. Here are a few examples of abstract graphs. This is a graph with 8 vertices connected in a circle. ∗In this course, graph does not mean the graph of a function, as in calculus. It is unfortunate, but these two very basic objects in mathematics have the same name. 1 Graph Theory/Social Networks Introduction Kimball Martin (Spring 2014) 1 2 8 3 7 4 6 5 This is a graph on 5 vertices, where all pairs of vertices are connected. -
Graph Theory and Social Networks - Part I
Graph Theory and Social Networks - part I ! EE599: Social Network Systems ! Keith M. Chugg Fall 2014 1 © Keith M. Chugg, 2014 Overview • Summary • Graph definitions and properties • Relationship and interpretation in social networks • Examples © Keith M. Chugg, 2014 2 References • Easley & Kleinberg, Ch 2 • Focus on relationship to social nets with little math • Barabasi, Ch 2 • General networks with some math • Jackson, Ch 2 • Social network focus with more formal math © Keith M. Chugg, 2014 3 Graph Definition 24 CHAPTER 2. GRAPHS A A • G= (V,E) • V=set of vertices B B C D C D • E=set of edges (a) A graph on 4 nodes. (b) A directed graph on 4 nodes. Figure 2.1: Two graphs: (a) an undirected graph, and (b) a directed graph. Modeling of networks Easley & Kleinberg • will be undirected unless noted otherwise. Graphs as Models of Networks. Graphs are useful because they serve as mathematical Vertex is a person (ormodels ofentity) network structures. With this in mind, it is useful before going further to replace • the toy examples in Figure 2.1 with a real example. Figure 2.2 depicts the network structure of the Internet — then called the Arpanet — in December 1970 [214], when it had only 13 sites. Nodes represent computing hosts, and there is an edge joining two nodes in this picture Edge represents a relationshipif there is a direct communication link between them. Ignoring the superimposed map of the • U.S. (and the circles indicating blown-up regions in Massachusetts and Southern California), the rest of the image is simply a depiction of this 13-node graph using the same dots-and-lines style that we saw in Figure 2.1. -
A Note on the Importance of Collaboration Graphs
Int. J. of Mathematical Sciences and Applications, Vol. 1, No. 3, September 2011 Copyright Mind Reader Publications www.journalshub.com A Note on the Importance of Collaboration Graphs V.Yegnanarayanan1 and G.K.Umamaheswari2 1Senior Professor, Department of Mathematics, Velammal Engineering College,Ambattur-Red Hills Road, Chennai - 600 066, India. Email id:[email protected] 2Research Scholar, Research and Development Centre, Bharathiar University, Coimbatore-641046, India. Abstract Numerous challenging problems in graph theory has attracted the attention and imagination of researchers from physics, computer science, engineering, biology, social science and mathematics. If we put all these different branches one into basket, what evolves is a new science called “Network Science”. It calls for a solid scientific foundation and vigorous analysis. Graph theory in general and the collaboration graphs, in particular are well suited for this task. In this paper, we give a overview of the importance of collaboration graphs with its interesting background. Also we study one particular type of collaboration graph and list a number of open problems. Keywords :collaboration graph, network science, erdos number AMS subject Classification: 05XX, 68R10 1. Introduction In the past decade, graph theory has gone through a remarkable shift and a profound transformation. The change is in large part due to the humongous amount of information that we are confronted with. A main way to sort through massive data sets is to build and examine the network formed by interrelations. For example, Google’s successful web search algorithms are based on the www graph, which contains all web pages as vertices and hyperlinks as edges. -
Synthetic Graph Generation for Data-Intensive HPC Benchmarking: Background and Framework
ORNL/TM-2013/339 Synthetic Graph Generation for Data-Intensive HPC Benchmarking: Background and Framework October 2013 Prepared by Joshua Lothian, Sarah Powers, Blair D. Sullivan, Matthew Baker, Jonathan Schrock, Stephen W. Poole DOCUMENT AVAILABILITY Reports produced after January 1, 1996, are generally available free via the U.S. Department of Energy (DOE) Information Bridge: Web Site: http://www.osti.gov/bridge Reports produced before January 1, 1996, may be purchased by members of the public from the following source: National Technical Information Service 5285 Port Royal Road Springfield, VA 22161 Telephone: 703-605-6000 (1-800-553-6847) TDD: 703-487-4639 Fax: 703-605-6900 E-mail: [email protected] Web site: http://www.ntis.gov/support/ordernowabout.htm Reports are available to DOE employees, DOE contractors, Energy Technology Data Ex- change (ETDE), and International Nuclear Information System (INIS) representatives from the following sources: Office of Scientific and Technical Information P.O. Box 62 Oak Ridge, TN 37831 Telephone: 865-576-8401 Fax: 865-576-5728 E-mail: [email protected] Web site:http://www.osti.gov/contact.html This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or other- wise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof. -
Preferential Attachment Model with Degree Bound and Its Application to Key Predistribution in WSN
Preferential Attachment Model with Degree Bound and its Application to Key Predistribution in WSN Sushmita Rujy and Arindam Palz y Indian Statistical Institute, Kolkata, India. Email: [email protected] z TCS Innovation Labs, Kolkata, India. Email: [email protected] Abstract—Preferential attachment models have been widely particularly those in the military domain [14]. The resource studied in complex networks, because they can explain the constrained nature of sensors restricts the use of public key formation of many networks like social networks, citation methods to secure communication. Key predistribution [7] networks, power grids, and biological networks, to name a few. Motivated by the application of key predistribution in wireless is a widely used symmetric key management technique in sensor networks (WSN), we initiate the study of preferential which cryptographic keys are preloaded in sensor networks attachment with degree bound. prior to deployment. Sensor nodes find out the common keys Our paper has two important contributions to two different using a shared key discovery phase. Messages are encrypted areas. The first is a contribution in the study of complex by the source node using the shared key and decrypted at the networks. We propose preferential attachment model with degree bound for the first time. In the normal preferential receiving node using the same key. attachment model, the degree distribution follows a power law, The number of keys in each node is to be minimized, in with many nodes of low degree and a few nodes of high degree. order to reduce storage space. Direct communication between In our scheme, the nodes can have a maximum degree dmax, any pair of nodes help in quick and easy transmission of where dmax is an integer chosen according to the application. -
Bellwethers and the Emergence of Trends in Online Communities
Bellwethers and the Emergence of Trends in Online Communities Yasuaki Sakamoto ([email protected]) Elliot Sadlon ([email protected]) Jeffrey V. Nickerson ([email protected]) Center for Decision Technologies Howe School of Technology Management, Stevens Institute of Technology Castle Point on Hudson, Hoboken, NJ 07030 USA Abstract Group-level phenomena, such as trends and congestion, are difficult to predict as behaviors at the group-level typically di- verge from simple aggregates of behaviors at the individual- level. In the present work, we examine the processes by which collective decisions emerge by analyzing how some arti- cles gain vast popularity in a community-based website, Digg. Through statistical analyses and computer simulations of hu- man voting processes under varying social influences, we show that users’ earlier choices have some influence on the later choices of others. Moreover, the present results suggest that there are special individuals who attract followers and guide the development of trends in online social networks. Keywords: Trends, trendsetters, group behavior, social influ- ence, social networks. Figure 1: A snapshot of Digg homepage. Background An individual’s decisions are often influenced by the context the social (Levine, Resnick, & Higgins, 1993) and distributed or the environment in which the decisions are made. For ex- (Hutchins, 1995) nature of learning and thinking in cognitive ample, preferences between two choices can change when a science (Goldstone & Janssen, 2005; Harnad & Dror, 2006). third option is introduced (Tversky, 1972). At the same time, The past work in collective behavior tends to focus on peo- an individual’s actions alter the environments. By modifying ple’s behavior in controlled laboratory experiments (Gureckis their surroundings, humans indirectly communicate to one & Goldstone, 2006), following the tradition of research in in- another and influence one another’s cognition. -
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. -
Information Thermodynamics and Reducibility of Large Gene Networks
Supplementary Information: Information Thermodynamics and Reducibility of Large Gene Networks Swarnavo Sarkar#, Joseph B. Hubbard, Michael Halter, and Anne L. Plant* National Institute of Standards and Technology, Gaithersburg, MD 20899, USA #[email protected] *[email protected] S1. Generating model GRNs All the model GRNs presented in the main text were generated using the NetworkX package (version 2.5) for Python. Specifically, the barabasi_albert_graph function was used to create graphs using the Barabási-Albert preferential attachment model [1]. The barabasi_albert_graph(n, m) function requires two inputs: (1) the number of nodes in the graph, �, and (2) the number of edges connecting a new node to existing nodes in the graph, �, and produces an undirected graph. The documentation for the barabasi_albert_graph functiona fully describes the algorithm for generating the graphs from the inputs � and �. We then convert the undirected Barabási-Albert graph into a directed one. In the NetworkX graph object, an undirected edge between nodes �! and �" is equivalent to a directed edge from �! to �" and also a directed edge from �" to �!. We transformed the undirected Barabási-Albert graphs into directed graphs by deleting any edge from �! to �" when the node numbers constituting the edge satisfy the condition, � > �. This deletion results in every node in the graph having the same in-degree, �, without any constraint on the out-degree. The final graph object, � = (�, �), contains vertices numbered from 0 to � − 1, and each directed edge �! → �" in the set � is such that � < �. A source node �! can only send information to node numbers higher than itself. Hence, the non-trivial values in the loss field, �(� → �), (as shown in figures 2b and 2c) are confined within the upper diagonal, � < �. -
Applications of Network Science to Education Research: Quantifying Knowledge and the Development of Expertise Through Network Analysis
education sciences Commentary Applications of Network Science to Education Research: Quantifying Knowledge and the Development of Expertise through Network Analysis Cynthia S. Q. Siew Department of Psychology, National University of Singapore, Singapore 117570, Singapore; [email protected] Received: 31 January 2020; Accepted: 3 April 2020; Published: 8 April 2020 Abstract: A fundamental goal of education is to inspire and instill deep, meaningful, and long-lasting conceptual change within the knowledge landscapes of students. This commentary posits that the tools of network science could be useful in helping educators achieve this goal in two ways. First, methods from cognitive psychology and network science could be helpful in quantifying and analyzing the structure of students’ knowledge of a given discipline as a knowledge network of interconnected concepts. Second, network science methods could be relevant for investigating the developmental trajectories of knowledge structures by quantifying structural change in knowledge networks, and potentially inform instructional design in order to optimize the acquisition of meaningful knowledge as the student progresses from being a novice to an expert in the subject. This commentary provides a brief introduction to common network science measures and suggests how they might be relevant for shedding light on the cognitive processes that underlie learning and retrieval, and discusses ways in which generative network growth models could inform pedagogical strategies to enable meaningful long-term conceptual change and knowledge development among students. Keywords: education; network science; knowledge; learning; expertise; development; conceptual representations 1. Introduction Cognitive scientists have had a long-standing interest in quantifying cognitive structures and representations [1,2]. The empirical evidence from cognitive psychology and psycholinguistics demonstrates that the structure of cognitive systems influences the psychological processes that operate within them.