Intelligent Social Network
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
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. -
Examination of the Use of Online and Offline Networks by Housing Social Movement Organizations
University of Kentucky UKnowledge Theses and Dissertations--Sociology Sociology 2013 Examination of the Use of Online and Offline Networksy b Housing Social Movement Organizations Jessica N. Kropczynski University of Kentucky, [email protected] Right click to open a feedback form in a new tab to let us know how this document benefits ou.y Recommended Citation Kropczynski, Jessica N., "Examination of the Use of Online and Offline Networksy b Housing Social Movement Organizations" (2013). Theses and Dissertations--Sociology. 11. https://uknowledge.uky.edu/sociology_etds/11 This Doctoral Dissertation is brought to you for free and open access by the Sociology at UKnowledge. It has been accepted for inclusion in Theses and Dissertations--Sociology by an authorized administrator of UKnowledge. For more information, please contact [email protected]. STUDENT AGREEMENT: I represent that my thesis or dissertation and abstract are my original work. Proper attribution has been given to all outside sources. I understand that I am solely responsible for obtaining any needed copyright permissions. I have obtained and attached hereto needed written permission statements(s) from the owner(s) of each third-party copyrighted matter to be included in my work, allowing electronic distribution (if such use is not permitted by the fair use doctrine). I hereby grant to The University of Kentucky and its agents the non-exclusive license to archive and make accessible my work in whole or in part in all forms of media, now or hereafter known. I agree that the document mentioned above may be made available immediately for worldwide access unless a preapproved embargo applies. -
Army Acquisition Workforce Dependency on E-Mail for Formal
ARMY ACQUISITION WORKFORCE DEPENDENCY ON E-MAIL FOR FORMAL WORK COORDINATION: FINDINGS AND OPPORTUNITIES FOR WORKFORCE PERFORMANCE IMPROVEMENT THROUGH E-MAIL-BASED SOCIAL NETWORK ANALYSIS KENNETH A. LORENTZEN May 2013 PUBLISHED BY THE DEFENSE ACQUISITION UNIVERSITY PRESS PROJECT ADVISOR: BOB SKERTIC CAPITAL AND NORTHEAST REGION, DAU THE SENIOR SERVICE COLLEGE FELLOWSHIP PROGRAM ABERDEEN PROVING GROUND, MD PAGE LEFT BLANK INTENTIONALLY .ARMY ACQUISITION WORKFORCE DEPENDENCY ON E-MAIL FOR FORMAL WORK COORDINATION: FINDINGS AND OPPORTUNITIES FOR WORKFORCE PERFORMANCE IMPROVEMENT THROUGH E-MAIL-BASED SOCIAL NETWORK ANALYSIS KENNETH A. LORENTZEN May 2013 PUBLISHED BY THE DEFENSE ACQUISITION UNIVERSITY PRESS PROJECT ADVISOR: BOB SKERTIC CAPITAL AND NORTHEAST REGION, DAU THE SENIOR SERVICE COLLEGE FELLOWSHIP PROGRAM ABERDEEN PROVING GROUND, MD PAGE LEFT BLANK INTENTIONALLY ii Table of Contents Table of Contents ............................................................................................................................ ii List of Figures ................................................................................................................................ vi Abstract ......................................................................................................................................... vii Chapter 1—Introduction ................................................................................................................. 1 Background and Motivation ................................................................................................. -
NET GAINS: a Handbook for Network Builders Seeking Social Change
NET GAINS: A Handbook for Network Builders Seeking Social Change By Peter Plastrik and Madeleine Taylor Version 1.0 (2006) 470 266 501 091 216 133 205 126 172 279 374 256 471 261 289 449 208 331 375 049 145 033 520 223 371 204 543 330 146 053 307 379 134 050 313 066 163 190 005 583 429 556 105 574 253 472 122 235 068 036 523 578 326 070 109 478 351 442 164 149 518 173 455 554 555 344 388 505 249 347 303 550 221 348 244 548 295 304 198 343 077 462 423 288 572 391 337 352 498 345 502 495 380 476 101 052 377 039 023 004 219 334 359 137 338 406 220 019 506 531 257 088 366 084 282 130 420 035 245 489 569 265 060 034 547 044 188 422 155 140 046 229 128 180 376 113 016 108 479 093 100 526 210 512 268 541 010 513 020 381 069 018 287 535 403 458 008 096 516 362 030 390 353 329 277 270 196 340 129 327 358 297 199 300 397 097 165 525 444 561 110 029 530 262 315 318 349 545 319 209 552 519 365 132 350 370 271 183 047 085 316 538 385 500 012 217 201 336 546 532 116 152 083 461 003 346 368 141 162 465 027 285 342 150 264 477 312 437 514 515 473 206 102 160 224 354 487 045 082 378 014 042 509 124 071 228 054 425 521 167 232 158 138 490 320 484 230 043 492 022 557 233 067 112 412 499 384 450 212 467 251 065 333 537 169 446 443 493 576 179 213 428 031 207 231 468 272 426 177 170 117 115 485 195 432 563 111 339 396 533 176 383 559 148 570 236 246 041 299 087 127 328 363 293 411 291 174 438 094 568 092 222 399 226 184 508 292 294 241 413 431 322 564 580 234 587 369 317 079 577 308021 120 240 286 488 355 135 258 539 252 191 356 273 389 187 392 464 051 551 -
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. -
The Vessel Schedule Recovery Problem Disruption Management in Liner Shipping
Downloaded from orbit.dtu.dk on: Oct 05, 2021 The Vessel Schedule Recovery Problem Disruption management in liner shipping Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Vaaben, Bo; Pisinger, David; Dirksen, Jakob Publication date: 2012 Link back to DTU Orbit Citation (APA): Brouer, B. D., Plum, C. E. M., Vaaben, B., Pisinger, D., & Dirksen, J. (2012). The Vessel Schedule Recovery Problem: Disruption management in liner shipping. Abstract from 25th European Conference on Operations Research, Vilnius, Lithuania. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. TECHNICAL SESSIONS model and give an algorithm for scheduling multilayer divisible com- Monday, 8:30-10:00 putations. The algorithm is tested experimentally. Structures of the obtained schedules and performance of such applications are studied. MA-01 2 - Scheduling malleable tasks with arbitrary processing Monday, 8:30-10:00 speed functions RB-Alfa Maciej Machowiak, Poznan University of Technology, Poland, [email protected], Mikhail Y. -
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. -
Understanding Individuals' Attachment to Social Networking Sites
Understanding Individuals’ Attachment to Social Networking Sites: An Empirical Investigation of Three Theories by Eric T. K. Lim M.Sc. (Information Systems), National University of Singapore, 2007 B.Comm. (Hons.), Nanyang Technological University, 2003 Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in the Segal Graduate School Beedie School of Business Eric T. K. Lim 2013 SIMON FRASER UNIVERSITY Spring 2013 Approval Name: Eric T. K. Lim Degree: Doctor of Philosophy (Business Administration) Title of Thesis: Understanding Individuals’ Attachment to Social Networking Sites: An Empirical Investigation of Three Theories Examining Committee: Chair: Dr. Tom Lawrence Professor, Academic Director, PhD Program Dr. Dianne Cyr Senior Supervisor Professor Dr. Andrew Gemino Co-Supervisor Professor Dr. Leyland Pitt Internal Examiner Professor Dr. Matthew Lee External Examiner Chair Professor Department of Information Systems College of Business City University of Hong Kong Date Defended/Approved: March 27, 2013 ii Partial Copyright Licence iii Ethics Statement iv Abstract Social Networking Sites (SNSs) are a pervasive phenomenon in today’s society. With greater connectivity and interactivity enabled via web technologies, SNSs provide communication platforms for individuals to bridge geographical and temporal differences when making friends, sharing experiences, socializing with others and much more. This thesis therefore endeavors to shed light on this problem by decomposing members’ motives for participating within SNSs into identity-based, bond-based and comparison- based attachments. Each of these forms of attachment in turn affects members’ cooperative and competitive mentality towards participation within SNSs. In addition, it is further posited in this thesis that members’ identity-based, bond-based and comparison- based attachment within SNSs can be induced through the presence of deindividuation, personalization and tournament technologies respectively. -
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. -
(EDEN) Conference Proceedings
European Distance and E-Learning Network (EDEN) Conference Proceedings EDEN Open Classroom 2011 Conference Never Waste a Crisis! Inclusive Excellence, Innovative Technologies and Transformed Schools as Autonomous Learning Organisations EDEN Open Classroom 2011 Conference Ellinogermaniki Agogi Athens, Greece 27-29 October 2011 ELECTRONIC PROCEEDINGS Edited by Sofoklis Sotiriou and András Szűcs on behalf of the European Distance and E-Learning Network European Distance and E-Learning Network, 2011 European Distance and E-Learning Network (EDEN) Conference Proceedings EDEN Open Classroom 2011 Conference Athens, Greece Published by the European Distance and E-Learning Network Editors: Sofoklis Sotiriou András Szűcs Editorial co-ordination: Anna Zoakou Anna Wagner EDEN Secretariat, c/o Budapest University of Technology and Economics H-1111 Budapest, Egry J. u. 1, Hungary Tel: (36) 1 463 1628, 463 2537 E-mail: mailto:[email protected] http://www.eden-online.org Conference organised in collaboration with Ellinogermaniki Agogi Copyright 2011 European Distance and E-Learning Network and the Authors All Rights Reserved No part of the material protected by this copyright may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any storage or retrieval system, without written permission from the copyright owners. ISBN 978-963-87914-7-4 Acknowledgement and thanks are given to the Programme and Evaluation Committee Morte Flate Paulsen, President of EDEN, Professor of Online -
A Dynamic Multidimensional Visualization Method for Social Networks
PsychNology Journal, 2008 Volume 6, Number 3, 291 – 320 SIM: A dynamic multidimensional visualization method for social networks Maria Chiara Caschera*¨, Fernando Ferri¨ and Patrizia Grifoni¨ ¨CNR-IRPPS, National Research Council, Institute of Research on Population and Social Policies, Rome (Italy) ABSTRACT Visualization plays an important role in social networks analysis to explore and investigate individual and groups behaviours. Therefore, different approaches have been proposed for managing networks patterns and structures according to the visualization purposes. This paper presents a method of social networks visualization devoted not only to analyse individual and group social networking but also aimed to stimulate the second-one. This method provides (using a hybrid visualization approach) both an egocentric as well as a global point of view. Indeed, it is devoted to explore the social network structure, to analyse social aggregations and/or individuals and their evolution. Moreover, it considers and integrates features such as real-time social network elements locations in local areas. Multidimensionality consists of social phenomena, their evolution during the time, their individual characterization, the elements social position, and their spatial location. The proposed method was evaluated using the Social Interaction Map (SIM) software module in the scenario of planning and managing a scientific seminars cycle. This method enables the analysis of the topics evolution and the participants’ scientific interests changes using a temporal layers sequence for topics. This knowledge provides information for planning next conference and events, to extend and modify main topics and to analyse research interests trends. Keywords: Social network visualization, Spatial representation of social information, Map based visualization. -
Graph Theory and Social Networks Spring 2014 Notes
Graph Theory and Social Networks Spring 2014 Notes Kimball Martin March 14, 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 Figure 1). 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.