{"title":"A study on the influential neighbors to maximize information diffusion in online social networks","authors":"Hyoungshick Kim, K. Beznosov, Eiko Yoneki","doi":"10.1186/s40649-015-0013-8","DOIUrl":"https://doi.org/10.1186/s40649-015-0013-8","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-015-0013-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65734412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Power and loyalty defined by proximity to influential relations","authors":"Dror Fidler","doi":"10.1186/s40649-014-0009-9","DOIUrl":"https://doi.org/10.1186/s40649-014-0009-9","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-014-0009-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65734282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A strategic model for network formation","authors":"Omid Atabati, Babak Farzad","doi":"10.1186/s40649-014-0008-x","DOIUrl":"https://doi.org/10.1186/s40649-014-0008-x","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-014-0008-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65734209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis and control of information diffusion dictated by user interest in generalized networks.","authors":"Eleni Stai, Vasileios Karyotis, Symeon Papavassiliou","doi":"10.1186/s40649-015-0025-4","DOIUrl":"https://doi.org/10.1186/s40649-015-0025-4","url":null,"abstract":"<p><p>The diffusion of useful information in generalized networks, such as those consisting of wireless physical substrates and social network overlays is very important for theoretical and practical applications. Contrary to previous works, we focus on the impact of user interest and its features (e.g., interest periodicity) on the dynamics and control of diffusion of useful information within such complex wireless-social systems. By considering the impact of temporal and topical variations of users interests, e.g., seasonal periodicity of interest in summer vacation advertisements which spread more effectively during Spring-Summer months, we develop an epidemic-based mathematical framework for modeling and analyzing such information dissemination processes and use three indicative operational scenarios to demonstrate the solutions and results that can be obtained by the corresponding differential equation-based formalism. We then develop an optimal control framework subject to the above information diffusion modeling that allows controlling the trade-off between information propagation efficiency and the associated cost, by considering and leveraging on the impact that user interests have on the diffusion processes. By analysis and extensive simulations, significant outcomes are obtained on the impact of each network layer and the associated interest parameters on the dynamics of useful information diffusion. Furthermore, several behavioral properties of the optimal control of the useful information diffusion with respect to the number of infected/informed nodes and the evolving user interest are shown through analysis and verified via simulations. Specifically, a key finding is that low interest-related diffusion can be aided by utilizing proper optimal controls. Our work in this paper paves the way towards this user-centered information diffusion framework.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"2 1","pages":"18"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-015-0025-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35754748","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":"Cascade source inference in networks: a Markov chain Monte Carlo approach.","authors":"Xuming Zhai, Weili Wu, Wen Xu","doi":"10.1186/s40649-015-0017-4","DOIUrl":"https://doi.org/10.1186/s40649-015-0017-4","url":null,"abstract":"<p><p>Cascades of information, ideas, rumors, and viruses spread through networks. Sometimes, it is desirable to find the source of a cascade given a snapshot of it. In this paper, source inference problem is tackled under Independent Cascade (IC) model. First, the #P-completeness of source inference problem is proven. Then, a Markov chain Monte Carlo algorithm is proposed to find a solution. It is worth noting that our algorithm is designed to handle large networks. In addition, the algorithm does not rely on prior knowledge of when the cascade started. Finally, experiments on real social network are conducted to evaluate the performance. Under all experimental settings, our algorithm identified the true source with high probability.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"2 1","pages":"17"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-015-0017-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35755724","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}
Mahdi Abed Salman, Cyrille Bertelle, Eric Sanlaville
{"title":"Network characteristics emerging from agent interactions in balanced distributed system.","authors":"Mahdi Abed Salman, Cyrille Bertelle, Eric Sanlaville","doi":"10.1186/s40649-015-0019-2","DOIUrl":"https://doi.org/10.1186/s40649-015-0019-2","url":null,"abstract":"<p><p>A distributed computing system behaves like a complex network, the interactions between nodes being essential information exchanges and migrations of jobs or services to execute. These actions are performed by software agents, which behave like the members of social networks, cooperating and competing to obtain knowledge and services. The load balancing consists in distributing the load evenly between system nodes. It aims at enhancing the resource usage. A load balancing strategy specifies scenarios for the cooperation. Its efficiency depends on quantity, accuracy, and distribution of available information. Nevertheless, the distribution of information on the nodes, together with the initial network structure, may create different logical network structures. In this paper, different load balancing strategies are tested on different network structures using a simulation. The four tested strategies are able to distribute evenly the load so that the system reaches a steady state (the mean response time of the jobs is constant), but it is shown that a given strategy indeed behaves differently according to structural parameters and information spreading. Such a study, devoted to distributed computing systems (DCSs), can be useful to understand and drive the behavior of other complex systems.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"2 1","pages":"10"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-015-0019-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35678313","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":"Analyzing the longitudinal impact of proximity, location, and personality on smartphone usage","authors":"L. Meng, Shu Liu, A. Striegel","doi":"10.1186/s40649-014-0006-z","DOIUrl":"https://doi.org/10.1186/s40649-014-0006-z","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-014-0006-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65734137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Polarization of coalitions in an agent-based model of political discourse","authors":"Philip Leifeld","doi":"10.1186/s40649-014-0007-y","DOIUrl":"https://doi.org/10.1186/s40649-014-0007-y","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-014-0007-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65734158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Influence-based community partition for social networks","authors":"Zaixin Lu, Yuqing Zhu, Wei Li, Weili Wu, Xiuzhen Cheng","doi":"10.1186/s40649-014-0001-4","DOIUrl":"https://doi.org/10.1186/s40649-014-0001-4","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-014-0001-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65733949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}