Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Górski; Piotr J., Atkisson, Curtis, Hołyst, Janusz A. Pages: 536 - 559 Abstract: Polarization makes it difficult to form positive relationships across existing groups. Decreasing polarization may improve political discourse around the world. Polarization can be modeled on a social network as structural balance, where the network is composed of groups with positive links between all individuals in the group and negative links with all others. Previous work shows that incorporating attributes of individuals usually makes structural balance, and hence polarization, harder to achieve. That work examines only a limited number and types of attributes. We present a generalized model and a simulation framework to analyze the effect of any type of attribute, including analytically as long as an expected value can be written for the type of attribute. As attributes, we consider people’s (approximately) immutable characteristics (e.g., race, wealth) and such opinions that change more slowly than relationships (e.g., political preferences). We detail and analyze five classes of attributes, recapitulating the results of previous work in this framework and extending it. While it is easier to prevent than to destabilize polarization, we find that usually the most effective at both are continuous attributes, followed by ordered attributes and, finally, binary attributes. The effectiveness of unordered attributes varies depending on the magnitude of negative impact of having differing attributes but is smaller than of continuous ones. Testing the framework on network structures containing communities revealed that destroying polarization may require introducing local tensions. This model could be used by policymakers, among others, to prevent and design effective interventions to counteract polarization. PubDate: 2023-07-24 DOI: 10.1017/nws.2023.13
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Rastelli; Riccardo, Corneli, Marco Pages: 560 - 588 Abstract: We create a framework to analyze the timing and frequency of instantaneous interactions between pairs of entities. This type of interaction data is especially common nowadays and easily available. Examples of instantaneous interactions include email networks, phone call networks, and some common types of technological and transportation networks. Our framework relies on a novel extension of the latent position network model: we assume that the entities are embedded in a latent Euclidean space and that they move along individual trajectories which are continuous over time. These trajectories are used to characterize the timing and frequency of the pairwise interactions. We discuss an inferential framework where we estimate the individual trajectories from the observed interaction data and propose applications on artificial and real data. PubDate: 2023-07-24 DOI: 10.1017/nws.2023.14
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Stein; Jonas, Mandemakers, Jornt, van de Rijt, Arnout Pages: 589 - 614 Abstract: Previous studies have shown that relationship sentiments in families follow a pattern wherein either all maintain positive relationships or there are two antagonistic factions. This result is consistent with the network theory of structural balance that individuals befriend their friends’ friend and become enemies with their friends’ enemies. Fault lines in families would then endogenously emerge through the same kinds of interactional processes that organize nations into axis and allies. We argue that observed patterns may instead exogenously come about as the result of personal characteristics or homophilous partitions of family members. Disentangling these alternate theoretical possibilities requires longitudinal data. The present study tracks the sentiment dynamics of 1,710 families in a longitudinal panel study. Results show the same static patterns suggestive of balancing processes identified in earlier research, yet dynamic analysis reveals that conflict in families is not generated or resolved in accordance with balance theory. PubDate: 2023-08-17 DOI: 10.1017/nws.2023.15
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Dondi; Riccardo, Hosseinzadeh, Mohammad Mehdi Pages: 615 - 631 Abstract: Finding paths is a fundamental problem in graph theory and algorithm design due to its many applications. Recently, this problem has been considered on temporal graphs, where edges may change over a discrete time domain. The analysis of graphs has also taken into account the relevance of vertex properties, modeled by assigning to vertices labels or colors. In this work, we deal with a problem that, given a static or temporal graph, whose vertices are colored graph looks for a path such that (1) the vertices of the path have distinct colors and (2) that path includes the maximum number of colors. We analyze the approximation complexity of the problem on static and temporal graphs, and we prove an inapproximability bound. Then, we consider the problem on temporal graphs, and we design a heuristic for it. We present an experimental evaluation of our heuristic, both on synthetic and real-world graphs. The experimental results show that for many instances of the problem, our method is able to return near-optimal solutions. PubDate: 2023-08-18 DOI: 10.1017/nws.2023.17
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Kennedy; David P., Bradbury, Thomas N., Karney, Benjamin R. Pages: 632 - 656 Abstract: The social networks surrounding intimate couples provide them with bonding and bridging social capital and have been theorized to be associated with their well-being and relationship quality. These networks are multidimensional, featuring compositional (e.g., the proportion of family members vs. friends) and structural characteristics (e.g., density, degree of overlap between spouses’ networks). Most previous studies of couple networks are based on partners’ global ratings of their network characteristics or network data collected from one member of the dyad. This study presents the analysis of “duocentric networks" or the combined personal networks of both members of a couple, collected from 207 mixed-sex newlywed couples living in low-income neighborhoods of Harris County, TX. We conducted a pattern-centric analysis of compositional and structural features to identify distinct types of couple networks. We identified five qualitatively distinct network types (wife family-focused, husband family-focused, shared friends, wife friend-focused, and extremely disconnected). Couples’ network types were associated with the quality of the relationships between couples and their network contacts (e.g., emotional support) but not with the quality of the couples’ relationship with each other. We argue that duocentric networks provide appropriate data for measuring bonding and bridging capital in couple networks. PubDate: 2023-08-25 DOI: 10.1017/nws.2023.16
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:adams; jimi, Bojanowski, Michał Pages: 657 - 669 Abstract: Within US professional sports, trades within one’s own division are often perceived to be disadvantageous. We ask how common this practice is. To examine this question, we construct a date-stamped network of all trades in the National Basketball Association between June 1976 and May 2019. We then use season-specific weighted exponential random graph models to estimate the likelihood of teams avoiding within-division trade partners, and how consistent that pattern is across the observed period. In addition to the empirical question, this analysis serves to demonstrate the necessity and difficulty of constructing the proper baseline for statistical comparison. We find limited-to-no support for the popular perception. PubDate: 2023-09-18 DOI: 10.1017/nws.2023.18
Hybrid journal (It can contain Open Access articles)
