Computational Social Networks最新文献

{"title":"Controllability of social networks and the strategic use of random information.","authors":"Marco Cremonini,&nbsp;Francesca Casamassima","doi":"10.1186/s40649-017-0046-2","DOIUrl":"https://doi.org/10.1186/s40649-017-0046-2","url":null,"abstract":"<p><strong>Background: </strong>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.</p><p><strong>Methods: </strong>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 which are defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of agent interests.</p><p><strong>Results: </strong>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.</p><p><strong>Conclusions: </strong>These findings support 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.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"10"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0046-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35678314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Measuring the value of accurate link prediction for network seeding.","authors":"Yijin Wei,&nbsp;Gwen Spencer","doi":"10.1186/s40649-017-0037-3","DOIUrl":"https://doi.org/10.1186/s40649-017-0037-3","url":null,"abstract":"<p><strong>Merging two classic questions: </strong>The influence-maximization literature seeks small sets of individuals whose structural placement in the social network can drive large cascades of behavior. Optimization efforts to find the best <i>seed set</i> often assume perfect knowledge of the network topology. Unfortunately, social network links are rarely known in an exact way. When do seeding strategies based on less-than-accurate link prediction provide valuable insight?</p><p><strong>Our contribution: </strong>We introduce optimized-against-a-sample ([Formula: see text]) performance to measure the value of optimizing seeding based on a noisy observation of a network. Our computational study investigates [Formula: see text] under several threshold-spread models in synthetic and real-world networks. Our focus is on measuring the value of imprecise link information. The level of investment in link prediction that is strategic appears to depend closely on spread model: in some parameter ranges investments in improving link prediction can pay substantial premiums in cascade size. For other ranges, such investments would be wasted. Several trends were remarkably consistent across topologies.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0037-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35677792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Computation and analysis of temporal betweenness in a knowledge mobilization network.","authors":"Amir Afrasiabi Rad,&nbsp;Paola Flocchini,&nbsp;Joanne Gaudet","doi":"10.1186/s40649-017-0041-7","DOIUrl":"https://doi.org/10.1186/s40649-017-0041-7","url":null,"abstract":"<p><strong>Background: </strong>Highly dynamic social networks, where connectivity continuously changes in time, are becoming more and more pervasive. Knowledge mobilization, which refers to the use of knowledge toward the achievement of goals, is one of the many examples of dynamic social networks. Despite the wide use and extensive study of dynamic networks, their temporal component is often neglected in social network analysis, and statistical measures are usually performed on static network representations. As a result, measures of importance (like betweenness centrality) typically do not reveal the temporal role of the entities involved. Our goal is to contribute to fill this limitation by proposing a form of temporal betweenness measure (foremost betweenness).</p><p><strong>Methods: </strong>Our method is analytical as well as experimental: we design an algorithm to compute foremost betweenness, and we apply it to a case study to analyze a knowledge mobilization network.</p><p><strong>Results: </strong>We propose a form of temporal betweenness measure (foremost betweenness) to analyze a knowledge mobilization network and we introduce, for the first time, an algorithm to compute exact foremost betweenness. We then show that this measure, which explicitly takes time into account, allows us to detect centrality roles that were completely hidden in the classical statistical analysis. In particular, we uncover nodes whose static centrality was negligible, but whose temporal role might instead be important to accelerate mobilization flow in the network. We also observe the reverse behavior by detecting nodes with high static centrality, whose role as temporal bridges is instead very low.</p><p><strong>Conclusion: </strong>In this paper, we focus on a form of temporal betweenness designed to detect accelerators in dynamic networks. By revealing potentially important temporal roles, this study is a first step toward a better understanding of the impact of time in social networks and opens the road to further investigation.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"5"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0041-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35677793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Effect of direct reciprocity and network structure on continuing prosperity of social networking services.","authors":"Kengo Osaka,&nbsp;Fujio Toriumi,&nbsp;Toshihauru Sugawara","doi":"10.1186/s40649-017-0038-2","DOIUrl":"https://doi.org/10.1186/s40649-017-0038-2","url":null,"abstract":"<p><strong>Background: </strong>Social networking services (SNSs) are widely used as communicative tools for a variety of purposes. SNSs rely on the users' individual activities associated with some cost and effort, and thus it is not known why users voluntarily continue to participate in SNSs. Because the structures of SNSs are similar to that of the public goods (PG) game, some studies have focused on why voluntary activities emerge as an optimal strategy by modifying the PG game. However, their models do not include direct reciprocity between users, even though reciprocity is a key mechanism that evolves and sustains cooperation in human society.</p><p><strong>Proposed methods: </strong>We developed an abstract SNS model called the reciprocity rewards and meta-rewards games that include direct reciprocity by extending the existing models. Then, we investigated how direct reciprocity in an SNS facilitates cooperation that corresponds to participation in SNS by posting articles and comments and how the structure of the networks of users exerts an influence on the strategies of users using the reciprocity rewards game.</p><p><strong>Experimental results: </strong>We run reciprocity rewards games on various complex networks and an instance network of Facebook and found that two types of stable cooperation emerged. First, reciprocity slightly improves the rate of cooperation in complete graphs but the improvement is insignificant because of the instability of cooperation. However, this instability can be avoided by making two assumptions: high degree of fun, i.e. articles are read with high probability, and different attitudes to reciprocal and non-reciprocal agents. We then propose the concept of half free riders to explain what strategy sustains cooperation-dominant situations. Second, we indicate that a certain WS network structure affects users' optimal strategy and facilitates stable cooperation without any extra assumptions. We give a detailed analysis of the different characteristics of the two types of cooperation-dominant situations and the effect of the memory of reciprocal agents on cooperation.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"2"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0038-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35678202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Coevolution of a multilayer node-aligned network whose layers represent different social relations.","authors":"Ashwin Bahulkar, Boleslaw K Szymanski, Kevin Chan, Omar Lizardo","doi":"10.1186/s40649-017-0047-1","DOIUrl":"10.1186/s40649-017-0047-1","url":null,"abstract":"<p><strong>Background: </strong>We examine the coevolution of three-layer node-aligned network of university students. The first layer is defined by nominations based on perceived prominence collected from repeated surveys during the first four semesters; the second is a behavioral layer representing actual students' interactions based on records of mobile calls and text messages; while the third is a behavioral layer representing potential face-to-face interactions suggested by bluetooth collocations.</p><p><strong>Methods: </strong>We address four interrelated questions. First, we ask whether the formation or dissolution of a link in one of the layers precedes or succeeds the formation or dissolution of the corresponding link in another layer (temporal dependencies). Second, we explore the causes of observed temporal dependencies between the layers. For those temporal dependencies that are confirmed, we measure the predictive capability of such dependencies. Third, we observe the progress towards nominations and the stages that lead to them. Finally, we examine whether the differences in dissolution rates of symmetric (undirected) versus asymmetric (directed) links co-exist in all layers.</p><p><strong>Results: </strong>We find strong patterns of reciprocal temporal dependencies between the layers. In particular, the creation of an edge in either behavioral layer generally precedes the formation of a corresponding edge in the nomination layer. Conversely, the decay of a link in the nomination layer generally precedes a decline in the intensity of communication and collocation. Finally, nodes connected by asymmetric nomination edges have lower overall communication and collocation volumes and more asymmetric communication flows than the nodes linked by symmetric edges.</p><p><strong>Conclusion: </strong>We find that creation and dissolution of cognitively salient contacts have temporal dependencies with communication and collocation behavior.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"11"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5732614/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35677790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Online network organization of Barcelona en Comú, an emergent movement-party.","authors":"Pablo Aragón,&nbsp;Helena Gallego,&nbsp;David Laniado,&nbsp;Yana Volkovich,&nbsp;Andreas Kaltenbrunner","doi":"10.1186/s40649-017-0044-4","DOIUrl":"https://doi.org/10.1186/s40649-017-0044-4","url":null,"abstract":"<p><p>The emerging grassroots party Barcelona en Comú won the 2015 Barcelona City Council election. This candidacy was devised by activists involved in the Spanish 15M movement to transform citizen outrage into political change. On the one hand, the 15M movement was based on a decentralized structure. On the other hand, political science literature postulates that parties develop oligarchical leadership structures. This tension motivates to examine whether Barcelona en Comú preserved a decentralized structure or adopted a conventional centralized organization. In this study we develop a computational methodology to characterize the online network organization of every party in the election campaign on Twitter. Results on the network of retweets reveal that, while traditional parties are organized in a single cluster, for Barcelona en Comú two well-defined groups co-exist: a centralized cluster led by the candidate and party accounts, and a decentralized cluster with the movement activists. Furthermore, results on the network of replies also shows a dual structure: a cluster around the candidate receiving the largest attention from other parties, and another with the movement activists exhibiting a higher predisposition to dialogue with other parties.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"8"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0044-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35677795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Stance and influence of Twitter users regarding the Brexit referendum.","authors":"Miha Grčar,&nbsp;Darko Cherepnalkoski,&nbsp;Igor Mozetič,&nbsp;Petra Kralj Novak","doi":"10.1186/s40649-017-0042-6","DOIUrl":"https://doi.org/10.1186/s40649-017-0042-6","url":null,"abstract":"<p><p>Social media are an important source of information about the political issues, reflecting, as well as influencing, public mood. We present an analysis of Twitter data, collected over 6 weeks before the Brexit referendum, held in the UK in June 2016. We address two questions: what is the relation between the Twitter mood and the referendum outcome, and who were the most influential Twitter users in the pro- and contra-Brexit camps? First, we construct a stance classification model by machine learning methods, and are then able to predict the stance of about one million UK-based Twitter users. The demography of Twitter users is, however, very different from the demography of the voters. By applying a simple age-adjusted mapping to the overall Twitter stance, the results show the prevalence of the pro-Brexit voters, something unexpected by most of the opinion polls. Second, we apply the Hirsch index to estimate the influence, and rank the Twitter users from both camps. We find that the most productive Twitter users are not the most influential, that the pro-Brexit camp was four times more influential, and had considerably larger impact on the campaign than the opponents. Third, we find that the top pro-Brexit communities are considerably more polarized than the contra-Brexit camp. These results show that social media provide a rich resource of data to be exploited, but accumulated knowledge and lessons learned from the opinion polls have to be adapted to the new data sources.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"6"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0042-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35678322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Using attractiveness model for actors ranking in social media networks.","authors":"Ziyaad Qasem,&nbsp;Marc Jansen,&nbsp;Tobias Hecking,&nbsp;H Ulrich Hoppe","doi":"10.1186/s40649-017-0040-8","DOIUrl":"https://doi.org/10.1186/s40649-017-0040-8","url":null,"abstract":"<p><strong>Background: </strong>Influential actors detection in social media such as Twitter or Facebook can play a major role in gathering opinions on particular topics, improving the marketing efficiency, predicting the trends, etc.</p><p><strong>Proposed methods: </strong>This work aims to extend our formally defined <i>T</i> measure to present a new measure aiming to recognize the actor's influence by the strength of attracting new important actors into a networked community. Therefore, we propose a model of the actor's influence based on the attractiveness of the actor in relation to the number of other attractors with whom he/she has established connections over time.</p><p><strong>Results and conclusions: </strong>Using an empirically collected social network for the underlying graph, we have applied the above-mentioned measure of influence in order to determine optimal seeds in a simulation of influence maximization. We study our extended measure in the context of information diffusion because this measure is based on a model of actors who attract others to be active members in a community. This corresponds to the idea of the IC simulation model which is used to identify the most important spreaders in a set of actors.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"3"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0040-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35678318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Steering opinion dynamics via containment control.","authors":"Pietro DeLellis,&nbsp;Anna DiMeglio,&nbsp;Franco Garofalo,&nbsp;Francesco Lo Iudice","doi":"10.1186/s40649-017-0048-0","DOIUrl":"https://doi.org/10.1186/s40649-017-0048-0","url":null,"abstract":"<p><p>In this paper, we model the problem of influencing the opinions of groups of individuals as a containment control problem, as in many practical scenarios, the control goal is not full consensus among all the individual opinions, but rather their containment in a certain range, determined by a set of leaders. As in classical bounded confidence models, we consider individuals affected by the confirmation bias, thus tending to influence and to be influenced only if their opinions are sufficiently close. However, here we assume that the confidence level, modeled as a proximity threshold, is not constant and uniform across the individuals, as it depends on their opinions. Specifically, in an extremist society, the most radical agents (i.e., those with the most extreme opinions) have a higher appeal and are capable of influencing nodes with very diverse opinions. The opposite happens in a moderate society, where the more connected (i.e., influential) nodes are those with an average opinion. In three artificial societies, characterized by different levels of extremism, we test through extensive simulations the effectiveness of three alternative containment strategies, where leaders have to select the set of followers they try to directly influence. We found that, when the network size is small, a stochastic time-varying pinning strategy that does not rely on information on the network topology proves to be more effective than static strategies where this information is leveraged, while the opposite happens for large networks where the relevance of the topological information is prevalent.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"12"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0048-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35677788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hierarchical community detection via rank-2 symmetric nonnegative matrix factorization.","authors":"Rundong Du,&nbsp;Da Kuang,&nbsp;Barry Drake,&nbsp;Haesun Park","doi":"10.1186/s40649-017-0043-5","DOIUrl":"https://doi.org/10.1186/s40649-017-0043-5","url":null,"abstract":"<p><strong>Background: </strong>Community discovery is an important task for revealing structures in large networks. The massive size of contemporary social networks poses a tremendous challenge to the scalability of traditional graph clustering algorithms and the evaluation of discovered communities.</p><p><strong>Methods: </strong>We propose a divide-and-conquer strategy to discover hierarchical community structure, nonoverlapping within each level. Our algorithm is based on the highly efficient rank-2 symmetric nonnegative matrix factorization. We solve several implementation challenges to boost its efficiency on modern computer architectures, specifically for very sparse adjacency matrices that represent a wide range of social networks.</p><p><strong>Conclusions: </strong>Empirical results have shown that our algorithm has competitive overall efficiency and leading performance in minimizing the average normalized cut, and that the nonoverlapping communities found by our algorithm recover the ground-truth communities better than state-of-the-art algorithms for overlapping community detection. In addition, we present a new dataset of the DBLP computer science bibliography network with richer meta-data and verifiable ground-truth knowledge, which can foster future research in community finding and interpretation of communities in large networks.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"4 1","pages":"7"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-017-0043-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35677791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}