ترغب بنشر مسار تعليمي؟ اضغط هنا

Hypergraph reconstruction from network data

102   0   0.0 ( 0 )
 نشر من قبل Jean-Gabriel Young
 تاريخ النشر 2020
والبحث باللغة English




اسأل ChatGPT حول البحث

Networks can describe the structure of a wide variety of complex systems by specifying which pairs of entities in the system are connected. While such pairwise representations are flexible, they are not necessarily appropriate when the fundamental interactions involve more than two entities at the same time. Pairwise representations nonetheless remain ubiquitous, because higher-order interactions are often not recorded explicitly in network data. Here, we introduce a Bayesian approach to reconstruct latent higher-order interactions from ordinary pairwise network data. Our method is based on the principle of parsimony and only includes higher-order structures when there is sufficient statistical evidence for them. We demonstrate its applicability to a wide range of datasets, both synthetic and empirical.



قيم البحث

اقرأ أيضاً

Most empirical studies of complex networks do not return direct, error-free measurements of network structure. Instead, they typically rely on indirect measurements that are often error-prone and unreliable. A fundamental problem in empirical network science is how to make the best possible estimates of network structure given such unreliable data. In this paper we describe a fully Bayesian method for reconstructing networks from observational data in any format, even when the data contain substantial measurement error and when the nature and magnitude of that error is unknown. The method is introduced through pedagogical case studies using real-world example networks, and specifically tailored to allow straightforward, computationally efficient implementation with a minimum of technical input. Computer code implementing the method is publicly available.
It is common for people to access multiple social networks, for example, using phone, email, and social media. Together, the multi-layer social interactions form a integrated social network. How can we extend well developed knowledge about single-lay er networks, including vertex centrality and community structure, to such heterogeneous structures? In this paper, we approach these challenges by proposing a principled framework of network composition based on a unified dynamical process. Mathematically, we consider the following abstract problem: Given multi-layer network data and additional parameters for intra and inter-layer dynamics, construct a (single) weighted network that best integrates the joint process. We use transformations of dynamics to unify heterogeneous layers under a common dynamics. For inter-layer compositions, we will consider several cases as the inter-layer dynamics plays different roles in various social or technological networks. Empirically, we provide examples to highlight the usefulness of this framework for network analysis and network design.
Over the last two decades, alongside the increased availability of large network datasets, we have witnessed the rapid rise of network science. For many systems, however, the data we have access to is not a direct description of the underlying networ k. More and more, we see the drive to study networks that have been inferred or reconstructed from non-network data---in particular, using time series data from the nodes in a system to infer likely connections between them. Selecting the most appropriate technique for this task is a challenging problem in network science. Different reconstruction techniques usually have different assumptions, and their performance varies from system to system in the real world. One way around this problem could be to use several different reconstruction techniques and compare the resulting networks. However, network comparison is also not an easy problem, as it is not obvious how best to quantify the differences between two networks, in part because of the diversity of tools for doing so. The netrd Python package seeks to address these two parallel problems in network science by providing, to our knowledge, the most extensive collection of both network reconstruction techniques and network comparison techniques (often referred to as graph distances) in a single library (https://github.com/netsiphd/netrd). In this article, we detail the two main functionalities of the netrd package. Along the way, we describe some of its other useful features. This package builds on commonly used Python packages and is already a widely used resource for network scientists and other multidisciplinary researchers. With ongoing open-source development, we see this as a tool that will continue to be used by all sorts of researchers to come.
120 - Yi Li , Asieh Ahani , Haimao Zhan 2021
The forecasting of political, economic, and public health indicators using internet activity has demonstrated mixed results. For example, while some measures of explicitly surveyed public opinion correlate well with social media proxies, the opportun ity for profitable investment strategies to be driven solely by sentiment extracted from social media appears to have expired. Nevertheless, the internets space of potentially predictive input signals is combinatorially vast and will continue to invite careful exploration. Here, we combine unemployment related search data from Google Trends with economic language on Twitter to attempt to nowcast and forecast: 1. State and national unemployment claims for the US, and 2. Consumer confidence in G7 countries. Building off of a recently developed search-query-based model, we show that incorporating Twitter data improves forecasting of unemployment claims, while the original method remains marginally better at nowcasting. Enriching the input signal with temporal statistical features (e.g., moving average and rate of change) further reduces errors, and improves the predictive utility of the proposed method when applied to other economic indices, such as consumer confidence.
We deal with the problem of automatically generating social networks by analyzing and assessing smartphone usage and interaction data. We start by assigning weights to the different types of interactions such as messaging, email, phone calls, chat an d physical proximity. Next, we propose a ranking algorithm which recognizes the pattern of interaction taking into account the changes in the collected data over time. Both algorithms are based on recent findings from social network research.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا