Social Network Analysis and Mining最新文献

In private capital investment, limited partners (LPs) and general partners (GPs) frequently encounter the challenge of finding suitable counterparts amid limited information, a process often hindered by market inefficiencies. This article addresses this issue by exploring the micro-level mechanisms that shape private capital networks, employing temporal exponential random graph models. Our findings uncover activity and popularity effects, persistence mechanisms, and homophily in preferences concerning region, strategy, and industry. These factors jointly shape the dynamically evolving network structure across asset classes and the hybrid network with all asset classes, revealing a shared network formation process. This article offers practical insights into the matching problem within the private capital market.

Despite the increasing popularity and societal relevance of mobile instant messenger services (MIMSs) such as WhatsApp, Telegram and Signal, the vast majority of the research on social media is focused on the "traditional" social media platforms such as Twitter (X) and Facebook, mostly due to the difficulty of accessing MIMSs data. Consequently, little is known about even the most basic topological features of societal-scale instant messenger networks. To overcome this knowledge gap, we employ the innovative approach of data donation by respondents of a high-quality probability-based panel in the Netherlands (the LISS panel) to collect user data while preserving their privacy. Focusing on WhatsApp as the most popular MIMS, this study collects the first measurement of MIMS usage on a national probability sample, focusing on degree distributions as a key feature of network topology. We find that the degree distribution of contacts is best approximated by a log-normal distribution, while the distribution of group membership is best approximated by the exponential distribution. At the individual level, we find that predictors of degree derived from the literature on extended networks mostly replicate.

Supplementary information: The online version contains supplementary material available at 10.1007/s13278-025-01550-8.

We address the problem of estimating causal effects from observational data in the presence of network confounding, a setting where both treatment assignment and observed outcomes of individuals may be influenced by their neighbors within a network structure, resulting in network interference. Traditional causal inference methods often fail to account for these dependencies, leading to biased estimates. To tackle this challenge, we introduce a novel matching-based approach that utilizes principles from hyperdimensional computing to effectively encode and incorporate structural network information. This enables more accurate identification of comparable individuals, thereby improving the reliability of causal effect estimates. Through extensive empirical evaluation on multiple benchmark datasets, we demonstrate that our method either outperforms or performs on par with existing state-of-the-art approaches, including several recent deep learning-based models that are significantly more computationally intensive. In addition to its strong empirical performance, our method offers substantial practical advantages, achieving nearly an order-of-magnitude reduction in runtime without compromising accuracy, making it particularly well-suited for large-scale or time-sensitive applications.

Multivariate count time series arise in a wide range of applications, including the number of COVID-19 cases recorded each week in different counties of the Republic of Ireland. In this example, it is natural to view the counties as nodes in a network, with edges between counties reflecting proximity. One could then model disease spread on a network through a regression model. Often Gaussian errors are assumed for such a model, but for count data this assumption may not be natural. With this motivating example in mind, we develop a model with the following features. We assume that the time series occur on the nodes of a known underlying network where the edges dictate the form of a structural vector autoregression model. In contrast to using a full vector autoregressive model, the network assumption is a means of imposing sparsity. Moreover we aim for a model that is able to accommodate heterogeneous node dynamics, and to cluster nodes that exhibit similar behaviour. To address these aims, we propose a new Bayesian Poisson network autoregression mixture model that we call a PNARM model, which combines ideas from Poisson network autoregression models, grouped network autoregression models, and non-uniform co-clustering priors.

Twitter data has been widely used by researchers across various social and computer science disciplines. A common aim when working with Twitter data is the construction of a random sample of users from a given country. However, while several methods have been proposed in the literature, their comparative performance is mostly unexplored. In this paper, we implement four common methods to create a random sample of Twitter users in the US: 1% Stream, Bounding Box, Location Query, and Language Query. Then, we compare these methods according to their tweet- and user-level metrics as well as their accuracy in estimating the US population. Our results show that users collected by the 1% Stream method tend to have more tweets, tweets per day, followers, and friends, a fewer number of likes, are younger accounts, and include more male users compared to the other three methods. Moreover, it achieves the minimum error in estimating the US population. However, the 1% Stream method is time-consuming, cannot be used for the past time frames, and is not suitable when user engagement is part of the study. In situation where these three drawbacks are important, our results support the Bounding Box method as the second-best method.

Supplementary information: The online version contains supplementary material available at. 10.1007/s13278-024-01327-5.