arXiv subjects

Eun Lee

Publications and source records attributed to Eun Lee.

14 recordsLinked to original sources

arXiv2026

Network Characteristics of Individual Pigments in Cyanobacterial Photosystem II Core Complexes

Part of the excitation energy transfer (EET) characteristics of the photosystem II (PSII) comes from the interconnection between pigments. To understand the correlation between the EET and the pigments' interaction structure, we construct a network from the EET rates, which are related to both the distance between the pigments (chlorophylls and pheophytins) and their spatial orientations. Especially, we investigate how well the PS II core complex's EET functionality can be explained by using only the network topology in Thermosynechococcus vulcanus 1.9 \AA. Starting from the F\"orster theory, we construct a network of EET pathways. For an analysis of the network structure, we calculate common network-structural measures like betweenness centrality, eigenvector centrality and weighted clustering. These measures can reflect the role of individual pigments in the EET network. In our work, we found that some well-known properties were reproduced by the network analysis of the simplified network, which means that the topology of the network encodes functionally relevant information. For example, from the network structural analysis, we can infer that most of the chlorophyll molecules (chlorophylls) in the pigment-protein complex CP47 have a heightened probability of transferring energy compared with other chlorophylls. We also see that the active branch chlorophylls in the reaction center are characterized by a high eigenvector centrality, a high betweenness centrality, and a low weighted clustering coefficient. This is indicative of functionally important vertices.

q-bio.BM↗

arXiv2024

Link Prediction Accuracy on Real-World Networks Under Non-Uniform Missing Edge Patterns

Real-world network datasets are typically obtained in ways that fail to capture all edges. The patterns of missing data are often non-uniform as they reflect biases and other shortcomings of different data collection methods. Nevertheless, uniform missing data is a common assumption made when no additional information is available about the underlying missing-edge pattern, and link prediction methods are frequently tested against uniformly missing edges. To investigate the impact of different missing-edge patterns on link prediction accuracy, we employ 9 link prediction algorithms from 4 different families to analyze 20 different missing-edge patterns that we categorize into 5 groups. Our comparative simulation study, spanning 250 real-world network datasets from 6 different domains, provides a detailed picture of the significant variations in the performance of different link prediction algorithms in these different settings. With this study, we aim to provide a guide for future researchers to help them select a link prediction algorithm that is well suited to their sampled network data, considering the data collection process and application domain.

math.DS↗

arXiv2023

Structural Gender Imbalances in Ballet Collaboration Networks

Ballet, a mainstream performing art predominantly associated with women, exhibits significant gender imbalances in leading positions. However, the collaboration's structural composition on gender representation in the field remains unexplored. Our study investigates the gendered labor force composition and collaboration patterns in ballet creations. Our findings reveal gender disparities in ballet creations aligned with gendered collaboration patterns and women occupying more peripheral network positions respect to men. Productivity disparities show women accessing 20-25\% of ballet creations compared to men. Mathematically derived perception errors show the underestimation of women artists' representation within ballet collaboration networks, potentially impacting women's careers in the field. Our study highlights the structural disadvantages that women face in ballet and emphasizes the need for a more inclusive and equal professional environment to improve the career development of women in the ballet industry. These insights contribute to a broader understanding of structural gender imbalances in artistic domains and can inform cultural organizations about potential affirmative actions towards a better representation of women leaders in ballet.

physics.soc-ph↗

arXiv2022

Copula-based analysis of the generalized friendship paradox in clustered networks

A heterogeneous structure of social networks induces various intriguing phenomena. One of them is the friendship paradox, which states that on average your friends have more friends than you do. Its generalization, called the generalized friendship paradox (GFP), states that on average your friends have higher attributes than yours. Despite successful demonstrations of the GFP by empirical analyses and numerical simulations, analytical, rigorous understanding of the GFP has been largely unexplored. Recently, an analytical solution for the probability that the GFP holds for an individual in a network with correlated attributes was obtained using the copula method but by assuming a locally tree structure of the underlying network [Jo~et~al., Physical Review E~\textbf{104}, 054301 (2021)]. Considering the abundant triangles in most social networks, we employ a vine copula method to incorporate the attribute correlation structure between neighbors of a focal individual in addition to the correlation between the focal individual and its neighbors. Our analytical approach helps us rigorously understand the GFP in more general networks such as clustered networks and other related interesting phenomena in social networks.

physics.soc-ph↗

arXiv2021

Uncovering hidden dependency in weighted networks via information entropy

Interactions between elements, which are usually represented by networks, have to delineate potentially unequal relationships in terms of their relative importance or direction. The intrinsic unequal relationships of such kind, however, are opaque or hidden in numerous real systems. For instance, when a node in a network with limited interaction capacity spends its capacity to its neighboring nodes, the allocation of the total amount of interactions to them can be vastly diverse. Even if such potentially heterogeneous interactions epitomized by weighted networks are observable, as a result of the aforementioned ego-centric allocation of interactions, the relative importance or dependency between two interacting nodes can only be implicitly accessible. In this work, we precisely pinpoint such relative dependency by proposing the framework to discover hidden dependent relations extracted from weighted networks. For a given weighted network, we provide a systematic criterion to select the most essential interactions for individual nodes based on the concept of information entropy. The criterion is symbolized by assigning the effective number of neighbors or the effective out-degree to each node, and the resultant directed subnetwork decodes the hidden dependent relations by leaving only the most essential directed interactions. We apply our methodology to two time-stamped empirical network data, namely the international trade relations between nations in the world trade web (WTW) and the network of people in the historical record of Korea, Annals of the Joseon Dynasty (AJD). Based on the data analysis, we discover that the properties of mutual dependency encoded in the two systems are vastly different.

physics.soc-ph↗

arXiv2021

Analytical approach to the generalized friendship paradox in networks with correlated attributes

One of the interesting phenomena due to the topological heterogeneities in complex networks is the friendship paradox, stating that your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary nodal attributes, called a generalized friendship paradox (GFP). In this paper, we analyze the GFP for the networks in which the attributes of neighboring nodes are correlated with each other. The correlation structure between attributes of neighboring nodes is modeled by the Farlie-Gumbel-Morgenstern copula, enabling us to derive approximate analytical solutions of the GFP for three kinds of methods summarizing the neighborhood of the focal node, i.e., mean-based, median-based, and fraction-based methods. The analytical solutions are comparable to simulation results, while some systematic deviations between them might be attributed to the higher-order correlations between nodal attributes. These results help us get deeper insight into how various summarization methods as well as the correlation structure of nodal attributes affect the GFP behavior, hence better understand various related phenomena in complex networks.

physics.soc-ph↗

arXiv2021

The Dynamics of Faculty Hiring Networks

Faculty hiring networks-who hires whose graduates as faculty-exhibit steep hierarchies, which can reinforce both social and epistemic inequalities in academia. Understanding the mechanisms driving these patterns would inform efforts to diversify the academy and shed new light on the role of hiring in shaping which scientific discoveries are made. Here, we investigate the degree to which structural mechanisms can explain hierarchy and other network characteristics observed in empirical faculty hiring networks. We study a family of adaptive rewiring network models, which reinforce institutional prestige within the hierarchy in five distinct ways. Each mechanism determines the probability that a new hire comes from a particular institution according to that institution's prestige score, which is inferred from the hiring network's existing structure. We find that structural inequalities and centrality patterns in real hiring networks are best reproduced by a mechanism of global placement power, in which a new hire is drawn from a particular institution in proportion to the number of previously drawn hires anywhere. On the other hand, network measures of biased visibility are better recapitulated by a mechanism of local placement power, in which a new hire is drawn from a particular institution in proportion to the number of its previous hires already present at the hiring institution. These contrasting results suggest that the underlying structural mechanism reinforcing hierarchies in faculty hiring networks is a mixture of global and local preference for institutional prestige. Under these dynamics, we show that each institution's position in the hierarchy is remarkably stable, due to a dynamic competition that overwhelmingly favors more prestigious institutions.

physics.soc-ph↗

arXiv2019

Exploring concurrency and reachability in the presence of high temporal resolution

Network properties govern the rate and extent of spreading processes on networks, from simple contagions to complex cascades. Recent advances have extended the study of spreading processes from static networks to temporal networks, where nodes and links appear and disappear. We review previous studies on the effects of temporal connectivity for understanding the spreading rate and outbreak size of model infection processes. We focus on the effects of "accessibility", whether there is a temporally consistent path from one node to another, and "reachability", the density of the corresponding "accessibility graph" representation of the temporal network. We study reachability in terms of the overall level of temporal concurrency between edges, quantifying the overlap of edges in time. We explore the role of temporal resolution of contacts by calculating reachability with the full temporal information as well as with a simplified interval representation approximation that demands less computation. We demonstrate the extent to which the computed reachability changes due to this simplified interval representation.

physics.soc-ph↗

arXiv2019

Homophily and minority size explain perception biases in social networks

People's perceptions about the size of minority groups in social networks can be biased, often showing systematic over- or underestimation. These social perception biases are often attributed to biased cognitive or motivational processes. Here we show that both over- and underestimation of the size of a minority group can emerge solely from structural properties of social networks. Using a generative network model, we show analytically that these biases depend on the level of homophily and its asymmetric nature, as well as on the size of the minority group. Our model predictions correspond well with empirical data from a cross-cultural survey and with numerical calculations on six real-world networks. We also show under what circumstances individuals can reduce their biases by relying on perceptions of their neighbors. This work advances our understanding of the impact of network structure on social perception biases and offers a quantitative approach for addressing related issues in society.

physics.soc-ph↗

arXiv2019

Concurrency and reachability in tree-like temporal networks

Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes and links appear and disappear. We focus on the effects of "accessibility", whether there is a temporally consistent path from one node to another, and "reachability", the density of the corresponding "accessibility graph" representation of the temporal network. The level of reachability thus inherently limits the possible extent of any spreading process on the temporal network. We study reachability in terms of the overall levels of temporal concurrency between edges and the structural cohesion of the network agglomerating over all edges. We use simulation results and develop heterogeneous mean field model predictions for random networks to better quantify how the properties of the underlying temporal network regulate reachability.

physics.soc-ph↗

arXiv2019

Impact of perception models on friendship paradox and opinion formation

Topological heterogeneities of social networks have a strong impact on the individuals embedded in those networks. One of the interesting phenomena driven by such heterogeneities is the friendship paradox (FP), stating that the mean degree of one's neighbors is larger than the degree of oneself. Alternatively, one can use the median degree of neighbors as well as the fraction of neighbors having a higher degree than oneself. Each of these reflects on how people perceive their neighborhoods, i.e., their perception models, hence how they feel peer pressure. In our paper, we study the impact of perception models on the FP by comparing three versions of the perception model in networks generated with a given degree distribution and a tunable degree-degree correlation or assortativity. The increasing assortativity is expected to decrease network-level peer pressure, while we find a nontrivial behavior only for the mean-based perception model. By simulating opinion formation, in which the opinion adoption probability of an individual is given as a function of individual peer pressure, we find that it takes the longest time to reach consensus when individuals adopt the median-based perception model, compared to other versions. Our findings suggest that one needs to consider the proper perception model for better modeling human behaviors and social dynamics.

physics.soc-ph↗

arXiv2018

Modeling the dynamics of dissent

We investigate the formation of opinion against authority in an authoritarian society composed of agents with different levels of authority. We explore a "dissenting" opinion, held by lower-ranking, obedient, or less authoritative people, spreading in an environment of an "affirmative" opinion held by authoritative leaders. A real-world example would be a corrupt society where people revolt against such leaders, but it can be applied to more general situations. In our model, agents can change their opinion depending on their authority relative to their neighbors and their own confidence level. In addition, with a certain probability, agents can override the affirmative opinion to take the dissenting opinion of a neighbor. Based on analytic derivation and numerical simulations, we observe that both the network structure and heterogeneity in authority, and their correlation, significantly affect the possibility of the dissenting opinion to spread through the population. In particular, the dissenting opinion is suppressed when the authority distribution is very heterogeneous and there exists a positive correlation between the authority and the number of neighbors of people (degree). Except for such an extreme case, though, spreading of the dissenting opinion takes place when people have the tendency to override the authority to hold the dissenting opinion, but the dissenting opinion can take a long time to spread to the entire society, depending on the model parameters. We argue that the internal social structure of agents sets the scale of the time to reach consensus, based on the analysis of the underlying structural properties of opinion spreading.

physics.soc-ph↗

arXiv2016

Social contagion with degree-dependent thresholds

We investigate opinion spreading by a threshold model in a situation where the influence of people is heterogeneously distributed. We focus on the response of the average opinion as a function between the trend between out-degree (number of neighbors)---effectively the strength of influence of a node---and the threshold for adopting a new product or opinion. We find that if the coupling is very positive, the final state of the system will be a mix of different opinions otherwise it will it converges to a consensus state. We find that this cannot be simply explained as a phase transition, but emerges from a combination of mechanisms and their relative dominance in different regions of parameter space.

physics.soc-ph↗

arXiv2016

Impact of mobility structure on the optimization of small-world networks of mobile agents

In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power consumption, etc., that bridges engineering, computer science and the physics of complex systems. In this work, we address the role of mobility patterns of the agents on the optimal tuning of a small-world type network construction method. By this method, the network is updated periodically and held static between the updates. We investigate the optimal updating times for different scenarios of the movement of agents (modeling, for example, the fat-tailed trip distances, and periodicities, of human travel). We find that these mobility patterns affect the power consumption in non-trivial ways and discuss how these effects can best be handled.

physics.soc-ph↗