Discrimination reveals reconstructability of multiplex networks from partial observations.
Ontology highlight
ABSTRACT:
SUBMITTER: Wu M
PROVIDER: S-EPMC9243819 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Undetected infections fuel the dissemination of many infectious agents. However, identification of unobserved infectious individuals remains challenging due to limited observations of infections and imperfect knowledge of key transmission parameters. Here, we use an ensemble Bayesian inference method to infer unobserved infections using partial observations. The ensemble inference method can represent uncertainty in model parameters and update model states using all ensemble members collectively. We perform extensive experiments in both model-generated and real-world networks in which individuals have differential but unknown transmission rates. The ensemble method outperforms several alternative approaches for a variety of network structures and observation rates, despite that the model is mis-specified. Additionally, the computational complexity of this algorithm scales almost linearly with the number of nodes in the network and the number of observations, respectively, exhibiting the potential to apply to large-scale networks. The inference method may support decision-making under uncertainty and be adapted for use for other dynamical models in networks.
| S-EPMC10434926 | biostudies-literature
Project description:National stay-at-home orders, or lockdowns, were imposed in several countries to drastically reduce the social interactions mainly responsible for the transmission of the SARS-CoV-2 virus. Despite being essential to slow down the COVID-19 pandemic, these containment measures are associated with an economic burden. In this work, we propose a network approach to model the implementation of a partial lockdown, breaking the society into disconnected components, or partitions. Our model is composed by two main ingredients: a multiplex network representing human contacts within different contexts, formed by a Household layer, a Work layer, and a Social layer including generic social interactions, and a Susceptible-Infected-Recovered process that mimics the epidemic spreading. We compare different partition strategies, with a twofold aim: reducing the epidemic outbreak and minimizing the economic cost associated to the partial lockdown. We also show that the inclusion of unconstrained social interactions dramatically increases the epidemic spreading, while different kinds of restrictions on social interactions help in keeping the benefices of the network partition.Supplementary informationThe online version contains supplementary material available at 10.1007/s41109-021-00366-7.
| S-EPMC8012750 | biostudies-literature
Project description:In many cooperative networks, such as alliance and trade networks, abrupt and intense changes to the state of the system (which we call "shocks"), can substantially change the network. We examine how such shocks affect multiplex networks via an agent-based model, in which agents add, drop, or change ties to increase their utility. At a certain time-point, some agents are "shocked" by changing (increasing or decreasing) the cost associated with tie-formation or tie-maintenance. Our model makes several improvements to previous models, including (a) only a fraction of nodes are shocked to simulate small wars or scattered tariff increases or decreases and (b) agents can make both utility-maximizing decisions and randomly rewire ties to explore the utility landscape. Interestingly, we find that randomly rewiring ties increases the utility of agents, for reasons similar to simulated annealing in physics. Furthermore, we create a novel metric to determine how networks change after a shock and find that the size of a shock and noise significantly changes the network, but only when agents' incentives for tie-formation are sufficiently high. Together, these results suggest that adding more realism to cooperation network models can give nuanced understanding to network shocks.
| S-EPMC6134050 | biostudies-literature
Project description:Imaging studies help us understand the important role of brainstem and midbrain regions in human trigeminal pain processing without solving the question of how these regions actually interact. In the current study, we describe this connectivity and its dynamics during nociception with a novel analytical approach called Partial Similarity (PS). We developed PS specifically to estimate the communication between individual hubs of the network in contrast to the overall communication within that network. Partial Similarity works on trial-to-trial variance of neuronal activity acquired with functional magnetic resonance imaging. It discovers direct communication between two hubs considering the remainder of the network as confounds. A similar method to PS is Representational Similarity, which works with ordinary correlations and does not consider any external influence on the communication between two hubs. Particularly the combination of Representational Similarity and Partial Similarity analysis unravels brainstem dynamics involved in trigeminal pain using the spinal trigeminal nucleus (STN)-the first relay station of peripheral trigeminal input-as a seed region. The combination of both methods can be valuable tools in discovering the network dynamics in fMRI and an important instrument for future insight into the nature of various neurological diseases like primary headaches.
| S-EPMC7563756 | biostudies-literature
Project description:One of the most important challenges in network science is to quantify the information encoded in complex network structures. Disentangling randomness from organizational principles is even more demanding when networks have a multiplex nature. Multiplex networks are multilayer systems of [Formula: see text] nodes that can be linked in multiple interacting and co-evolving layers. In these networks, relevant information might not be captured if the single layers were analyzed separately. Here we demonstrate that such partial analysis of layers fails to capture significant correlations between weights and topology of complex multiplex networks. To this end, we study two weighted multiplex co-authorship and citation networks involving the authors included in the American Physical Society. We show that in these networks weights are strongly correlated with multiplex structure, and provide empirical evidence in favor of the advantage of studying weighted measures of multiplex networks, such as multistrength and the inverse multiparticipation ratio. Finally, we introduce a theoretical framework based on the entropy of multiplex ensembles to quantify the information stored in multiplex networks that would remain undetected if the single layers were analyzed in isolation.
| S-EPMC4048161 | biostudies-literature
Project description:We develop graphlet analysis for multiplex networks and discuss how this analysis can be extended to multilayer and multilevel networks as well as to graphs with node and/or link categorical attributes. The analysis has been adapted for two typical examples of multiplexes: economic trade data represented as a 957-plex network and 75 social networks each represented as a 12-plex network. We show that wedges (open triads) occur more often in economic trade networks than in social networks, indicating the tendency of a country to produce/trade of a product in local structure of triads which are not closed. Moreover, our analysis provides evidence that the countries with small diversity tend to form correlated triangles. Wedges also appear in the social networks, however the dominant graphlets in social networks are triangles (closed triads). If a multiplex structure indicates a strong tie, the graphlet analysis provides another evidence for the concepts of strong/weak ties and structural holes. In contrast to Granovetter's seminal work on the strength of weak ties, in which it has been documented that the wedges with only strong ties are absent, here we show that for the analyzed 75 social networks, the wedges with only strong ties are not only present but also significantly correlated.
| S-EPMC7002705 | biostudies-literature
Project description:We study evolutionary game dynamics on structured populations in which individuals take part in several layers of networks of interactions simultaneously. This multiplex of interdependent networks accounts for the different kind of social ties each individual has. By coupling the evolutionary dynamics of a Prisoner's Dilemma game in each of the networks, we show that the resilience of cooperative behaviors for extremely large values of the temptation to defect is enhanced by the multiplex structure. Furthermore, this resilience is intrinsically related to a non-trivial organization of cooperation across the network layers, thus providing a new way out for cooperation to survive in structured populations.
| S-EPMC3431544 | biostudies-other
Project description:The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These interactions have two key features. First, they have a heterogeneous nature, and second, they have different strengths that are weighted based on their degree of intimacy, trustworthiness, service exchange or influence among individuals. These networks are known as multiplex networks. To our knowledge, none of the previous shortest path definitions on social interactions have properly reflected these features. In this work, we introduce a new distance measure in multiplex networks based on the concept of Pareto efficiency taking both heterogeneity and weighted nature of relations into account. We then model the problem of finding the whole set of paths as a form of multiple objective decision making and propose an exact algorithm for that. The method is evaluated on five real-world datasets to test the impact of considering weights and multiplexity in the resulting shortest paths. As an application to find the most influential nodes, we redefine the concept of betweenness centrality based on the proposed shortest paths and evaluate it on a real-world dataset from two-layer trade relation among countries between years 2000 and 2015.
| S-EPMC5438413 | biostudies-literature
Project description:The advances in understanding complex networks have generated increasing interest in dynamical processes occurring on them. Pattern formation in activator-inhibitor systems has been studied in networks, revealing differences from the classical continuous media. Here we study pattern formation in a new framework, namely multiplex networks. These are systems where activator and inhibitor species occupy separate nodes in different layers. Species react across layers but diffuse only within their own layer of distinct network topology. This multiplicity generates heterogeneous patterns with significant differences from those observed in single-layer networks. Remarkably, diffusion-induced instability can occur even if the two species have the same mobility rates; condition which can never destabilize single-layer networks. The instability condition is revealed using perturbation theory and expressed by a combination of degrees in the different layers. Our theory demonstrates that the existence of such topology-driven instabilities is generic in multiplex networks, providing a new mechanism of pattern formation.
| S-EPMC4455352 | biostudies-literature
Project description:Optimal percolation is the problem of finding the minimal set of nodes whose removal from a network fragments the system into non-extensive disconnected clusters. The solution to this problem is important for strategies of immunization in disease spreading, and influence maximization in opinion dynamics. Optimal percolation has received considerable attention in the context of isolated networks. However, its generalization to multiplex networks has not yet been considered. Here we show that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system. We reach this conclusion by extending many of the methods for finding approximate solutions of the optimal percolation problem from single-layer to multiplex networks, and performing a systematic analysis on synthetic and real-world multiplex networks.
| S-EPMC5691044 | biostudies-literature