Applied Network Science最新文献

{"title":"Investigating the effect of selective exposure, audience fragmentation, and echo-chambers on polarization in dynamic media ecosystems","authors":"Nicholas Rabb, Lenore Cowen, Jan P. de Ruiter","doi":"10.1007/s41109-023-00601-3","DOIUrl":"https://doi.org/10.1007/s41109-023-00601-3","url":null,"abstract":"Abstract The degree of polarization in many societies has become a pressing concern in media studies. Typically, it is argued that the internet and social media have created more media producers than ever before, allowing individual, biased media consumers to expose themselves only to what already confirms their beliefs, leading to polarized echo-chambers that further deepen polarization. This work introduces extensions to the recent Cognitive Cascades model of Rabb et al. to study this dynamic, allowing for simulation of information spread between media and networks of variably biased citizens. Our results partially confirm the above polarization logic, but also reveal several important enabling conditions for polarization to occur: (1) the distribution of media belief must be more polarized than the population; (2) the population must be at least somewhat persuadable to changing their belief according to new messages they hear; and finally, (3) the media must statically continue to broadcast more polarized messages rather than, say, adjust to appeal more to the beliefs of their current subscribers. Moreover, and somewhat counter-intuitively, under these conditions we find that polarization is more likely to occur when media consumers are exposed to more diverse messages, and that polarization occurred most often when there were low levels of echo-chambers and fragmentation. These results suggest that polarization is not simply due to biased individuals responding to an influx of media sources in the digital age, but also a consequence of polarized media conditions within an information ecosystem that supports more diverse exposure than is typically thought.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135291145","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":"From co-location patterns to an informal social network of gig economy workers","authors":"Gustavo Pilatti, Cristian Candia, Alessandra Montini, Flávio L. Pinheiro","doi":"10.1007/s41109-023-00603-1","DOIUrl":"https://doi.org/10.1007/s41109-023-00603-1","url":null,"abstract":"Abstract The labor market has transformed with the advent of the gig economy, characterized by short-term and flexible work arrangements facilitated by online platforms. As this trend becomes increasingly prevalent, it presents unique opportunities and challenges. In this manuscript, we comprehensively characterize the social networks of gig economy workers in each of the 15 cities studied. Our analysis reveals a scaling relationship between networks and the city population. In particular, we note the high level of modularity of the networks, and we argue that it results from the natural specialization of couriers along different areas of the cities. Furthermore, we show that degree and betweenness centrality is positively correlated with income but not with tenure. Our findings shed new light on the social organization of the gig economy workers and provide valuable insights for the management and design of gig economy platforms.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":" 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135243034","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 Twitter network and discourse analysis of the Rana Plaza collapse","authors":"Kai Bergermann, Margitta Wolter","doi":"10.1007/s41109-023-00587-y","DOIUrl":"https://doi.org/10.1007/s41109-023-00587-y","url":null,"abstract":"Abstract Ten years after the collapse of the Rana Plaza textile factory in Dhaka, Bangladesh that killed over 1000 factory workers, the event has become a symbol for the desolate working conditions in fast fashion producer countries in the global south. We analyze the global Twitter discourse on this event over a three week window around the collapse date over the years 2013–2022 by a mixture of network-theoretic quantitative and discourse-theoretic qualitative methods. In particular, key communicators and the community structure of the discourse participants are identified using a multilayer network modeling approach and the interpretative patterns of the key communicator’s tweets of all years are analyzed using the sociology of knowledge approach to discourse. This combination of quantitative and qualitative methods reveals that the discourse is separated into three phases: reporting, reprocessing, and commemoration. These phases can be identified by the temporal evolution, network-structural properties, and the contentual analysis of the discourse. After the negotiation of the interpretative framework in the reprocessing phase, subsequent years are characterized by its commemorative repetition as well as resulting demands by different international actor groups despite highly fluctuating participants.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"94 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135480546","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":"Short- and long-term temporal network prediction based on network memory","authors":"Li Zou, Alberto Ceria, Huijuan Wang","doi":"10.1007/s41109-023-00597-w","DOIUrl":"https://doi.org/10.1007/s41109-023-00597-w","url":null,"abstract":"Abstract Temporal networks are networks whose topology changes over time. Two nodes in a temporal network are connected at a discrete time step only if they have a contact/interaction at that time. The classic temporal network prediction problem aims to predict the temporal network one time step ahead based on the network observed in the past of a given duration. This problem has been addressed mostly via machine learning algorithms, at the expense of high computational costs and limited interpretation of the underlying mechanisms that form the networks. Hence, we propose to predict the connection of each node pair one step ahead based on the connections of this node pair itself and of node pairs that share a common node with this target node pair in the past. The concrete design of our two prediction models is based on the analysis of the memory property of real-world physical networks, i.e., to what extent two snapshots of a network at different times are similar in topology (or overlap). State-of-the-art prediction methods that allow interpretation are considered as baseline models. In seven real-world physical contact networks, our methods are shown to outperform the baselines in both prediction accuracy and computational complexity. They perform better in networks with stronger memory. Importantly, our models reveal how the connections of different types of node pairs in the past contribute to the connection estimation of a target node pair. Predicting temporal networks like physical contact networks in the long-term future beyond short-term i.e., one step ahead is crucial to forecast and mitigate the spread of epidemics and misinformation on the network. This long-term prediction problem has been seldom explored. Therefore, we propose basic methods that adapt each aforementioned prediction model to address classic short-term network prediction problem for long-term network prediction task. The prediction quality of all adapted models is evaluated via the accuracy in predicting each network snapshot and in reproducing key network properties. The prediction based on one of our models tends to have the highest accuracy and lowest computational complexity.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135433014","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":"Semisupervised regression in latent structure networks on unknown manifolds","authors":"Aranyak Acharyya, Joshua Agterberg, Michael W. Trosset, Youngser Park, Carey E. Priebe","doi":"10.1007/s41109-023-00598-9","DOIUrl":"https://doi.org/10.1007/s41109-023-00598-9","url":null,"abstract":"Abstract Random graphs are increasingly becoming objects of interest for modeling networks in a wide range of applications. Latent position random graph models posit that each node is associated with a latent position vector, and that these vectors follow some geometric structure in the latent space. In this paper, we consider random dot product graphs, in which an edge is formed between two nodes with probability given by the inner product of their respective latent positions. We assume that the latent position vectors lie on an unknown one-dimensional curve and are coupled with a response covariate via a regression model. Using the geometry of the underlying latent position vectors, we propose a manifold learning and graph embedding technique to predict the response variable on out-of-sample nodes, and we establish convergence guarantees for these responses. Our theoretical results are supported by simulations and an application to Drosophila brain data.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"6 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135480184","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":"Decentralizing the lightning network: a score-based recommendation strategy for the autopilot system","authors":"Mohammad Saleh Mahdizadeh, Behnam Bahrak, Mohammad Sayad Haghighi","doi":"10.1007/s41109-023-00602-2","DOIUrl":"https://doi.org/10.1007/s41109-023-00602-2","url":null,"abstract":"Abstract The fundamental objective of the Lightning Network is to establish a decentralized platform for scaling the Bitcoin network and facilitating high-throughput micropayments. However, this network has gradually deviated from its decentralized topology since its operational inception, and its resources have quickly shifted towards centralization. The evolution of the network and the changes in its topology have been critically reviewed and criticized due to its increasing centralization. This study delves into the network’s topology and the reasons behind its centralized evolution. We explain the incentives of various participating nodes in the network and propose a score-based strategy for the Lightning Autopilot system, which is responsible for automatically establishing new payment channels for the nodes joining the network. Our study demonstrates that utilizing the proposed strategy could significantly aid in reducing the network’s centralization. This strategy is grounded in qualitative labeling of network nodes based on topological and protocol features, followed by the creation of a scoring and recommendation model. Results of the experiments indicate that in the evolved network using the proposed strategy, concentration indicators such as the Gini coefficient can decrease by up to 17%, and channels ownership of the top 1% of hubs decrease by 27% compared to other autopilot strategies. Moreover, through simulated targeted attacks on hubs and channels, it is shown that by adopting the proposed strategy, the network’s resilience is increased compared to the existing autopilot strategies for evolved networks. The proposed method from this research can also be integrated into operational Lightning clients and potentially replace the current recommendation methods used in Lightning Autopilot.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136022602","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":"Intersection of random spanning trees in complex networks","authors":"András London, András Pluhár","doi":"10.1007/s41109-023-00600-4","DOIUrl":"https://doi.org/10.1007/s41109-023-00600-4","url":null,"abstract":"Abstract In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023). A simple formula was derived for the size of the minimum expected intersection of two spanning trees chosen uniformly at random. Monte Carlo experiments were run for real networks. In this paper, we provide a broader context and motivations for the concept, discussing its game theoretic origins, examples, its applications to network optimization problems, and its potential use in quantifying the resilience and modular structure of complex networks.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135859013","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":"Threshold sensitivity of the production network topology","authors":"Eszter Molnár, Dénes Csala","doi":"10.1007/s41109-023-00599-8","DOIUrl":"https://doi.org/10.1007/s41109-023-00599-8","url":null,"abstract":"Abstract Industries today are tightly interconnected, necessitating a systematic perspective in understanding the complexity of relations. Employing network science, the literature constructs dense production networks to address this challenge. However, handling this high density involves carefully choosing the level of pruning to retain as much information as possible. Yet, current research lacks comprehensive insight into the extent of distortion the data removal produces in the network structure. Our paper aims to examine how this widespread thresholding method changes the production network’s topology. We do this by studying the network topology and centrality metrics under various thresholds on inter-industry networks derived from the US input-output accounts. We find that altering even minor threshold values significantly reshapes the network’s structure. Core industries serving as hubs are also affected. Hence, research using the production network framework to explain the propagation of local shocks and disturbances should also take into account that even low-value monetary transactions contribute to the interrelatedness and complexity of production networks.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135481748","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":"Link prediction for ex ante influence maximization on temporal networks","authors":"Eric Yanchenko, Tsuyoshi Murata, Petter Holme","doi":"10.1007/s41109-023-00594-z","DOIUrl":"https://doi.org/10.1007/s41109-023-00594-z","url":null,"abstract":"Abstract Influence maximization (IM) is the task of finding the most important nodes in order to maximize the spread of influence or information on a network. This task is typically studied on static or temporal networks where the complete topology of the graph is known. In practice, however, the seed nodes must be selected before observing the future evolution of the network. In this work, we consider this realistic ex ante setting where p time steps of the network have been observed before selecting the seed nodes. Then the influence is calculated after the network continues to evolve for a total of $$T&gt;p$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>T</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mi>p</mml:mi> </mml:mrow> </mml:math> time steps. We address this problem by using statistical, non-negative matrix factorization and graph neural networks link prediction algorithms to predict the future evolution of the network, and then apply existing influence maximization algorithms on the predicted networks. Additionally, the output of the link prediction methods can be used to construct novel IM algorithms. We apply the proposed methods to eight real-world and synthetic networks to compare their performance using the susceptible-infected (SI) diffusion model. We demonstrate that it is possible to construct quality seed sets in the ex ante setting as we achieve influence spread within 87% of the optimal spread on seven of eight network. In many settings, choosing seed nodes based only historical edges provides results comparable to the results treating the future graph snapshots as known. The proposed heuristics based on the link prediction model are also some of the best-performing methods. These findings indicate that, for these eight networks under the SI model, the latent process which determines the most influential nodes may not have large temporal variation. Thus, knowing the future status of the network is not necessary to obtain good results for ex ante IM.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135860704","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":"Exploring the association between network centralities and passenger flows in metro systems","authors":"Athanasios Kopsidas, Aristeides Douvaras, Konstantinos Kepaptsoglou","doi":"10.1007/s41109-023-00583-2","DOIUrl":"https://doi.org/10.1007/s41109-023-00583-2","url":null,"abstract":"Abstract Network science offers valuable tools for planning and managing public transportation systems, with measures such as network centralities proposed as complementary predictors of ridership. This paper explores the relationship between different cases of passenger flows at metro stations and network centralities within both metro and alternative public transport (substitute) networks; such an association can be useful for managing metro system operations when disruptions occur. For that purpose, linear regression and non-parametric machine learning models are developed and compared. The Athens metro system is used as a testbed for developing the proposed methodology. The findings of this study can be used for deriving medium-term ridership estimates in cases of metro disruptions, as the proposed methodology can support contingency plans for both platform and rail track disruptions.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136060683","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}