-
Characterizing and modeling the patterns of vehicle movement on road networks
Authors:
Dongwon Kang,
Jung-Hoon Jung,
Jongwoo Lee,
Seunghoon Cheon,
Young-Ho Eom
Abstract:
Understanding vehicle movement on road networks is closely related to various practical and theoretical issues. While recent works have focused on which cost vehicles minimize while moving, how they move to minimize that cost remains less explored. In this work, we analyze large-scale data of individual vehicle trajectories in real-world road networks to identify cost-minimizing movement patterns…
▽ More
Understanding vehicle movement on road networks is closely related to various practical and theoretical issues. While recent works have focused on which cost vehicles minimize while moving, how they move to minimize that cost remains less explored. In this work, we analyze large-scale data of individual vehicle trajectories in real-world road networks to identify cost-minimizing movement patterns of vehicles and the influence of road network structure on such movement. We observed that vehicle movements exhibit three phases: the beginning, middle, and end of trips. At the beginning and end, vehicles detour more, lose directional memory quickly, and travel at lower speeds than during the middle. In contrast, during the middle, they tend to detour less, maintain directional memory, and travel faster than at the beginning and end. Finally, at the beginning and end, vehicles exhibit similar detour and velocity patterns, except the direction of movement. To understand these patterns, we propose a double-layered network model mimicking the hierarchical structure of real-world road networks. We found that when vehicles move across our model network while minimizing travel time, they tend to concentrate on high-level roads, and the three observed movement phases are reproduced. Consequently, when a vehicle moves between a given origin-destination pair, it must enter and exit these high-level roads. This causes it to deviate from the trajectory that minimizes travel distance between the same origin-destination pair -- particularly at the beginning and end of the trip. Our results reveal common patterns underlying individual vehicle movements that appear highly diverse at first glance, demonstrating that these patterns emerge because vehicles leverage the characteristics of hierarchical road networks to minimize travel time.
△ Less
Submitted 8 June, 2026;
originally announced June 2026.
-
Modeling Multistability and Hysteresis in Urban Congestion Spreading
Authors:
Jung-Hoon Jung,
Young-Ho Eom
Abstract:
Growing evidence suggests that the macroscopic functional states of urban road networks exhibit multistability and hysteresis, but microscopic mechanisms underlying these phenomena remain elusive. Here, we demonstrate that in real-world road networks, the recovery process of congested roads is not spontaneous, as assumed in existing models, but is hindered by connected congested roads, and such hi…
▽ More
Growing evidence suggests that the macroscopic functional states of urban road networks exhibit multistability and hysteresis, but microscopic mechanisms underlying these phenomena remain elusive. Here, we demonstrate that in real-world road networks, the recovery process of congested roads is not spontaneous, as assumed in existing models, but is hindered by connected congested roads, and such hindered recovery can lead to the emergence of multistability and hysteresis in urban traffic dynamics. By analyzing real-world urban traffic data, we observed that congestion propagation between individual roads is well described by a simple contagion process like an epidemic, but the recovery rate of a congested road decreases drastically by the congestion of the adjacent roads unlike an epidemic. Based on this microscopic observation, we proposed a simple model of congestion propagation and dissipation, and found that our model shows a discontinuous phase transition between macroscopic functional states of road networks when the recovery hindrance is strong enough through a mean-field approach and numerical simulations. Our findings shed light on an overlooked role of recovery processes in the collective dynamics of failures in networked systems.
△ Less
Submitted 16 December, 2025; v1 submitted 9 July, 2025;
originally announced July 2025.
-
Percolation analysis of spatiotemporal distribution of population in Seoul and Helsinki
Authors:
Yunwoo Nam,
Young-Ho Eom
Abstract:
Spatiotemporal distribution of urban population is crucial to understand the structure and dynamics of cities. Most studies, however, have focused on the microscopic structure of cities such as their few most crowded areas. In this work, we investigate the macroscopic structure of cities such as their clusters of highly populated areas. To do this, we analyze the spatial distribution of urban popu…
▽ More
Spatiotemporal distribution of urban population is crucial to understand the structure and dynamics of cities. Most studies, however, have focused on the microscopic structure of cities such as their few most crowded areas. In this work, we investigate the macroscopic structure of cities such as their clusters of highly populated areas. To do this, we analyze the spatial distribution of urban population and its intraday dynamics in Seoul and Helsinki with a percolation framework. We observe that the growth patterns of the largest clusters in the real and randomly shuffled population data are significantly different, and highly populated areas during the daytime are denser and form larger clusters than highly populated areas during the nighttime. An analysis of the cluster-size distributions at percolation criticality shows that their power-law exponents during the daytime are lower than those during the nighttime, indicating that the spatial distributions of urban population during daytime and nighttime fall into different universality classes. Finally measuring the area-perimeter fractal dimension of the collection of clusters demonstrates that the fractal dimensions during the daytime are higher than those during the nighttime, indicating that the perimeters of clusters during the daytime are rougher than those during the nighttime. Our findings suggest that even the same city can have qualitatively different spatial distributions of population over time, and propose a way to quantitatively compare the macrostructure of cities based on population distribution data.
△ Less
Submitted 12 January, 2025; v1 submitted 15 August, 2024;
originally announced August 2024.
-
Identifying influential node groups in networks with core-periphery structure
Authors:
Gyuho Bae,
Philip A. Knight,
Young-Ho Eom
Abstract:
Identifying influential spreaders is a crucial problem for practical applications in network science. The core-periphery(C-P) structure, common in many real-world networks, comprises a densely interconnected group of nodes(core) and the rest of the sparsely connected nodes subordinated to the core(periphery). Core nodes are expected to be more influential than periphery nodes generally, but recent…
▽ More
Identifying influential spreaders is a crucial problem for practical applications in network science. The core-periphery(C-P) structure, common in many real-world networks, comprises a densely interconnected group of nodes(core) and the rest of the sparsely connected nodes subordinated to the core(periphery). Core nodes are expected to be more influential than periphery nodes generally, but recent studies suggest that this is not the case in some networks. In this work, we look for mesostructural conditions that arise when core nodes are significantly more influential than periphery nodes. In particular, we investigate the roles of the internal and external connectivity of cores in their relative influence. We observe that the internal and external connectivity of cores are broadly distributed, and the relative influence of the cores is also broadly distributed in real-world networks. Our key finding is that the internal connectivity of cores is positively correlated with their relative influence, whereas the relative influence increases up to a certain value of the external connectivity and decreases thereafter. Finally, results from the model-generated networks clarify the observations from the real-world networks. Our findings provide a structural condition for influential cores in networks and shed light on why some cores are influential and others are not.
△ Less
Submitted 5 August, 2024;
originally announced August 2024.
-
Empirical analysis of congestion spreading in Seoul traffic network
Authors:
Jung-Hoon Jung,
Young-Ho Eom
Abstract:
Understanding how local traffic congestion spreads in urban traffic networks is fundamental to solving congestion problems in cities. In this work, by analyzing the high resolution data of traffic velocity in Seoul, we empirically investigate the spreading patterns and cluster formation of traffic congestion in a real-world urban traffic network. To do this, we propose a congestion identification…
▽ More
Understanding how local traffic congestion spreads in urban traffic networks is fundamental to solving congestion problems in cities. In this work, by analyzing the high resolution data of traffic velocity in Seoul, we empirically investigate the spreading patterns and cluster formation of traffic congestion in a real-world urban traffic network. To do this, we propose a congestion identification method suitable for various types of interacting traffic flows in urban traffic networks. Our method reveals that congestion spreading in Seoul may be characterized by a tree-like structure during the morning rush hour but a more persistent loop structure during the evening rush hour. Our findings suggest that diffusion and stacking processes of local congestion play a major role in the formation of urban traffic congestion.
△ Less
Submitted 15 January, 2024; v1 submitted 27 July, 2023;
originally announced July 2023.
-
Global efficiency and network structure of urban traffic flows: A percolation-based empirical analysis
Authors:
Yungi Kwon,
Jung-Hoon Jung,
Young-Ho Eom
Abstract:
Making the connection between the function and structure of networked systems is one of the fundamental issues in complex systems and network science. Urban traffic flows are related to various problems in cities and can be represented as a network of local traffic flows. To identify an empirical relation between the function and network structure of urban traffic flows, we construct a time-varyin…
▽ More
Making the connection between the function and structure of networked systems is one of the fundamental issues in complex systems and network science. Urban traffic flows are related to various problems in cities and can be represented as a network of local traffic flows. To identify an empirical relation between the function and network structure of urban traffic flows, we construct a time-varying traffic flow network of a megacity, Seoul, and analyze its global efficiency with a percolation-based approach. Comparing the real-world traffic flow network with its corresponding null-model network having a randomized structure, we show that the real-world network is less efficient than its null-model network during rush hour, yet more efficient during non-rush hour. We observe that in the real-world network, links with the highest betweenness tend to have lower quality during rush hour compared to links with lower betweenness, but higher quality during non-rush hour. Since the top betweenness links tend to be the bridges that connect the network together, their congestion has a stronger impact on the network's global efficiency. Our results suggest that the spatial structure of traffic flow networks is important to understand their function.
△ Less
Submitted 5 November, 2023; v1 submitted 14 March, 2023;
originally announced March 2023.
-
Copula-based analysis of the generalized friendship paradox in clustered networks
Authors:
Hang-Hyun Jo,
Eun Lee,
Young-Ho Eom
Abstract:
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 analyse…
▽ More
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.
△ Less
Submitted 8 December, 2022; v1 submitted 15 August, 2022;
originally announced August 2022.
-
Analytical approach to the generalized friendship paradox in networks with correlated attributes
Authors:
Hang-Hyun Jo,
Eun Lee,
Young-Ho Eom
Abstract:
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…
▽ More
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.
△ Less
Submitted 13 July, 2021;
originally announced July 2021.
-
Impact of perception models on friendship paradox and opinion formation
Authors:
Eun Lee,
Sungmin Lee,
Young-Ho Eom,
Petter Holme,
Hang-Hyun Jo
Abstract:
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…
▽ More
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.
△ Less
Submitted 10 May, 2019; v1 submitted 13 August, 2018;
originally announced August 2018.
-
Resilience of networks to environmental stress: From regular to random networks
Authors:
Young-Ho Eom
Abstract:
Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collaps…
▽ More
Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collapse at critical stress with hysteresis and vulnerability to perturbations. We demonstrate that this difference results from a trade-off between node resilience and network resilience to environmental stress. The nodes in the disordered networks can suppress their collapses due to the small-world topology of the networks but eventually collapse all together in return. Our findings indicate that some real networks can be highly resilient against environmental stress to a threshold yet extremely vulnerable to the stress above the threshold because of their small-world topology.
△ Less
Submitted 22 April, 2018; v1 submitted 25 September, 2017;
originally announced September 2017.
-
Concurrent enhancement of percolation and synchronization in adaptive networks
Authors:
Young-Ho Eom,
Stefano Boccaletti,
Guido Caldarelli
Abstract:
Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of connectivity, and show that it self-organizes from fragmented and incoherent states to connected and synchronized ones. The synchronization and percolation are associated…
▽ More
Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of connectivity, and show that it self-organizes from fragmented and incoherent states to connected and synchronized ones. The synchronization and percolation are associated to abrupt transitions, and they are concurrently (and significantly) enhanced as compared to the non-adaptive case. Finally we provide evidence that only partial adaptation is sufficient to determine these enhancements. Our study, therefore, indicates that inclusion of simple adaptive mechanisms can efficiently describe some emergent features of networked systems' collective behaviors, and suggests also self-organized ways to control synchronization and percolation in natural and social systems.
△ Less
Submitted 7 June, 2016; v1 submitted 17 November, 2015;
originally announced November 2015.
-
Network-based model of the growth of termite nests
Authors:
Young-Ho Eom,
Andrea Perna,
Santo Fortunato,
Eric Darrouzet,
Guy Theraulaz,
Christian Jost
Abstract:
We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (pr…
▽ More
We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, size of the largest connected component, average path lengths, backbone link ratios, and local graph redundancy). The two pruning alternatives can be associated with different genuses in the subfamily. A sensitivity analysis on the pruning and memory parameters indicates that Termitinae networks favor fast internal transportation over efficient defense strategies against ant predators. Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.
△ Less
Submitted 10 December, 2015; v1 submitted 16 June, 2015;
originally announced June 2015.
-
Twitter-based analysis of the dynamics of collective attention to political parties
Authors:
Young-Ho Eom,
Michelangelo Puliga,
Jasmina Smailović,
Igor Mozetič,
Guido Caldarelli
Abstract:
Large-scale data from social media have a significant potential to describe complex phenomena in real world and to anticipate collective behaviors such as information spreading and social trends. One specific case of study is represented by the collective attention to the action of political parties. Not surprisingly, researchers and stakeholders tried to correlate parties' presence on social medi…
▽ More
Large-scale data from social media have a significant potential to describe complex phenomena in real world and to anticipate collective behaviors such as information spreading and social trends. One specific case of study is represented by the collective attention to the action of political parties. Not surprisingly, researchers and stakeholders tried to correlate parties' presence on social media with their performances in elections. Despite the many efforts, results are still inconclusive since this kind of data is often very noisy and significant signals could be covered by (largely unknown) statistical fluctuations. In this paper we consider the number of tweets (tweet volume) of a party as a proxy of collective attention to the party, identify the dynamics of the volume, and show that this quantity has some information on the elections outcome. We find that the distribution of the tweet volume for each party follows a log-normal distribution with a positive autocorrelation of the volume over short terms, which indicates the volume has large fluctuations of the log-normal distribution yet with a short-term tendency. Furthermore, by measuring the ratio of two consecutive daily tweet volumes, we find that the evolution of the daily volume of a party can be described by means of a geometric Brownian motion (i.e., the logarithm of the volume moves randomly with a trend). Finally, we determine the optimal period of averaging tweet volume for reducing fluctuations and extracting short-term tendencies. We conclude that the tweet volume is a good indicator of parties' success in the elections when considered over an optimal time window. Our study identifies the statistical nature of collective attention to political issues and sheds light on how to model the dynamics of collective attention in social media.
△ Less
Submitted 14 July, 2015; v1 submitted 26 April, 2015;
originally announced April 2015.
-
Opinion formation driven by PageRank node influence on directed networks
Authors:
Young-Ho Eom,
Dima L. Shepelyansky
Abstract:
We study a two states opinion formation model driven by PageRank node influence and report an extensive numerical study on how PageRank affects collective opinion formations in large-scale empirical directed networks. In our model the opinion of a node can be updated by the sum of its neighbor nodes' opinions weighted by the node influence of the neighbor nodes at each step. We consider PageRank p…
▽ More
We study a two states opinion formation model driven by PageRank node influence and report an extensive numerical study on how PageRank affects collective opinion formations in large-scale empirical directed networks. In our model the opinion of a node can be updated by the sum of its neighbor nodes' opinions weighted by the node influence of the neighbor nodes at each step. We consider PageRank probability and its sublinear power as node influence measures and investigate evolution of opinion under various conditions. First, we observe that all networks reach steady state opinion after a certain relaxation time. This time scale is decreasing with the heterogeneity of node influence in the networks. Second, we find that our model shows consensus and non-consensus behavior in steady state depending on types of networks: Web graph, citation network of physics articles, and LiveJournal social network show non-consensus behavior while Wikipedia article network shows consensus behavior. Third, we find that a more heterogeneous influence distribution leads to a more uniform opinion state in the cases of Web graph, Wikipedia, and Livejournal. However, the opposite behavior is observed in the citation network. Finally we identify that a small number of influential nodes can impose their own opinion on significant fraction of other nodes in all considered networks. Our study shows that the effects of heterogeneity of node influence on opinion formation can be significant and suggests further investigations on the interplay between node influence and collective opinion in networks.
△ Less
Submitted 6 June, 2015; v1 submitted 9 February, 2015;
originally announced February 2015.
-
Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
Authors:
Young-Ho Eom,
Hang-Hyun Jo
Abstract:
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributions…
▽ More
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributions in large-scale networks only using local information of a small fraction of sampled nodes. Here we propose a tail-scope method based on local observational bias of the friendship paradox. We show that the tail-scope method outperforms the uniform node sampling for estimating heavy tails of degree distributions, while the opposite tendency is observed in the range of small degrees. In order to take advantages of both sampling methods, we devise the hybrid method that successfully recovers the whole range of degree distributions. Our tail-scope method shows how structural heterogeneities of large-scale complex networks can be used to effectively reveal the network structure only with limited local information.
△ Less
Submitted 16 May, 2015; v1 submitted 25 November, 2014;
originally announced November 2014.
-
Interactions of cultures and top people of Wikipedia from ranking of 24 language editions
Authors:
Young-Ho Eom,
Pablo Aragón,
David Laniado,
Andreas Kaltenbrunner,
Sebastiano Vigna,
Dima L. Shepelyansky
Abstract:
Wikipedia is a huge global repository of human knowledge, that can be leveraged to investigate interwinements between cultures. With this aim, we apply methods of Markov chains and Google matrix, for the analysis of the hyperlink networks of 24 Wikipedia language editions, and rank all their articles by PageRank, 2DRank and CheiRank algorithms. Using automatic extraction of people names, we obtain…
▽ More
Wikipedia is a huge global repository of human knowledge, that can be leveraged to investigate interwinements between cultures. With this aim, we apply methods of Markov chains and Google matrix, for the analysis of the hyperlink networks of 24 Wikipedia language editions, and rank all their articles by PageRank, 2DRank and CheiRank algorithms. Using automatic extraction of people names, we obtain the top 100 historical figures, for each edition and for each algorithm. We investigate their spatial, temporal, and gender distributions in dependence of their cultural origins. Our study demonstrates not only the existence of skewness with local figures, mainly recognized only in their own cultures, but also the existence of global historical figures appearing in a large number of editions. By determining the birth time and place of these persons, we perform an analysis of the evolution of such figures through 35 centuries of human history for each language, thus recovering interactions and entanglement of cultures over time. We also obtain the distributions of historical figures over world countries, highlighting geographical aspects of cross-cultural links. Considering historical figures who appear in multiple editions as interactions between cultures, we construct a network of cultures and identify the most influential cultures according to this network.
△ Less
Submitted 17 November, 2014; v1 submitted 28 May, 2014;
originally announced May 2014.
-
Generalized friendship paradox in networks with tunable degree-attribute correlation
Authors:
Hang-Hyun Jo,
Young-Ho Eom
Abstract:
One of interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes, called generalized friendship paradox (GFP). The origin of GFP at the network level has been shown to be rooted in positive correlations between degrees and at…
▽ More
One of interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes, called generalized friendship paradox (GFP). The origin of GFP at the network level has been shown to be rooted in positive correlations between degrees and attributes. However, how the GFP holds for individual nodes needs to be understood in more detail. For this, we first analyze a solvable model to characterize the paradox holding probability of nodes for the uncorrelated case. Then we numerically study the correlated model of networks with tunable degree-degree and degree-attribute correlations. In contrast to the network level, we find at the individual level that the relevance of degree-attribute correlation to the paradox holding probability may depend on whether the network is assortative or dissortative. These findings help us to understand the interplay between topological structure and node attributes in complex networks.
△ Less
Submitted 10 July, 2014; v1 submitted 6 May, 2014;
originally announced May 2014.
-
Generalized friendship paradox in complex networks: The case of scientific collaboration
Authors:
Young-Ho Eom,
Hang-Hyun Jo
Abstract:
The friendship paradox states that your friends have on average more friends than you have. Does the paradox "hold" for other individual characteristics like income or happiness? To address this question, we generalize the friendship paradox for arbitrary node characteristics in complex networks. By analyzing two coauthorship networks of Physical Review journals and Google Scholar profiles, we fin…
▽ More
The friendship paradox states that your friends have on average more friends than you have. Does the paradox "hold" for other individual characteristics like income or happiness? To address this question, we generalize the friendship paradox for arbitrary node characteristics in complex networks. By analyzing two coauthorship networks of Physical Review journals and Google Scholar profiles, we find that the generalized friendship paradox (GFP) holds at the individual and network levels for various characteristics, including the number of coauthors, the number of citations, and the number of publications. The origin of the GFP is shown to be rooted in positive correlations between degree and characteristics. As a fruitful application of the GFP, we suggest effective and efficient sampling methods for identifying high characteristic nodes in large-scale networks. Our study on the GFP can shed lights on understanding the interplay between network structure and node characteristics in complex networks.
△ Less
Submitted 10 April, 2014; v1 submitted 7 January, 2014;
originally announced January 2014.
-
Google matrix of the citation network of Physical Review
Authors:
Klaus M. Frahm,
Young-Ho Eom,
Dima L. Shepelyansky
Abstract:
We study the statistical properties of spectrum and eigenstates of the Google matrix of the citation network of Physical Review for the period 1893 - 2009. The main fraction of complex eigenvalues with largest modulus is determined numerically by different methods based on high precision computations with up to $p=16384$ binary digits that allows to resolve hard numerical problems for small eigenv…
▽ More
We study the statistical properties of spectrum and eigenstates of the Google matrix of the citation network of Physical Review for the period 1893 - 2009. The main fraction of complex eigenvalues with largest modulus is determined numerically by different methods based on high precision computations with up to $p=16384$ binary digits that allows to resolve hard numerical problems for small eigenvalues. The nearly nilpotent matrix structure allows to obtain a semi-analytical computation of eigenvalues. We find that the spectrum is characterized by the fractal Weyl law with a fractal dimension $d_f \approx 1$. It is found that the majority of eigenvectors are located in a localized phase. The statistical distribution of articles in the PageRank-CheiRank plane is established providing a better understanding of information flows on the network. The concept of ImpactRank is proposed to determine an influence domain of a given article. We also discuss the properties of random matrix models of Perron-Frobenius operators.
△ Less
Submitted 28 May, 2014; v1 submitted 21 October, 2013;
originally announced October 2013.
-
Highlighting Entanglement of Cultures via Ranking of Multilingual Wikipedia Articles
Authors:
Young-Ho Eom,
Dima L. Shepelyansky
Abstract:
How different cultures evaluate a person? Is an important person in one culture is also important in the other culture? We address these questions via ranking of multilingual Wikipedia articles. With three ranking algorithms based on network structure of Wikipedia, we assign ranking to all articles in 9 multilingual editions of Wikipedia and investigate general ranking structure of PageRank, CheiR…
▽ More
How different cultures evaluate a person? Is an important person in one culture is also important in the other culture? We address these questions via ranking of multilingual Wikipedia articles. With three ranking algorithms based on network structure of Wikipedia, we assign ranking to all articles in 9 multilingual editions of Wikipedia and investigate general ranking structure of PageRank, CheiRank and 2DRank. In particular, we focus on articles related to persons, identify top 30 persons for each rank among different editions and analyze distinctions of their distributions over activity fields such as politics, art, science, religion, sport for each edition. We find that local heroes are dominant but also global heroes exist and create an effective network representing entanglement of cultures. The Google matrix analysis of network of cultures shows signs of the Zipf law distribution. This approach allows to examine diversity and shared characteristics of knowledge organization between cultures. The developed computational, data driven approach highlights cultural interconnections in a new perspective.
△ Less
Submitted 8 October, 2013; v1 submitted 26 June, 2013;
originally announced June 2013.
-
Time evolution of Wikipedia network ranking
Authors:
Young-Ho Eom,
Klaus M. Frahm,
András Benczúr,
Dima L. Shepelyansky
Abstract:
We study the time evolution of ranking and spectral properties of the Google matrix of English Wikipedia hyperlink network during years 2003 - 2011. The statistical properties of ranking of Wikipedia articles via PageRank and CheiRank probabilities, as well as the matrix spectrum, are shown to be stabilized for 2007 - 2011. A special emphasis is done on ranking of Wikipedia personalities and unive…
▽ More
We study the time evolution of ranking and spectral properties of the Google matrix of English Wikipedia hyperlink network during years 2003 - 2011. The statistical properties of ranking of Wikipedia articles via PageRank and CheiRank probabilities, as well as the matrix spectrum, are shown to be stabilized for 2007 - 2011. A special emphasis is done on ranking of Wikipedia personalities and universities. We show that PageRank selection is dominated by politicians while 2DRank, which combines PageRank and CheiRank, gives more accent on personalities of arts. The Wikipedia PageRank of universities recovers 80 percents of top universities of Shanghai ranking during the considered time period.
△ Less
Submitted 31 October, 2013; v1 submitted 24 April, 2013;
originally announced April 2013.
-
Characterizing and modeling citation dynamics
Authors:
Young-Ho Eom,
Santo Fortunato
Abstract:
Citation distributions are crucial for the analysis and modeling of the activity of scientists. We investigated bibliometric data of papers published in journals of the American Physical Society, searching for the type of function which best describes the observed citation distributions. We used the goodness of fit with Kolmogorov-Smirnov statistics for three classes of functions: log-normal, simp…
▽ More
Citation distributions are crucial for the analysis and modeling of the activity of scientists. We investigated bibliometric data of papers published in journals of the American Physical Society, searching for the type of function which best describes the observed citation distributions. We used the goodness of fit with Kolmogorov-Smirnov statistics for three classes of functions: log-normal, simple power law and shifted power law. The shifted power law turns out to be the most reliable hypothesis for all citation networks we derived, which correspond to different time spans. We find that citation dynamics is characterized by bursts, usually occurring within a few years since publication of a paper, and the burst size spans several orders of magnitude. We also investigated the microscopic mechanisms for the evolution of citation networks, by proposing a linear preferential attachment with time dependent initial attractiveness. The model successfully reproduces the empirical citation distributions and accounts for the presence of citation bursts as well.
△ Less
Submitted 10 October, 2011;
originally announced October 2011.
-
How citation boosts promote scientific paradigm shifts and Nobel Prizes
Authors:
Amin Mazloumian,
Young-Ho Eom,
Dirk Helbing,
Sergi Lozano,
Santo Fortunato
Abstract:
Nobel Prizes are commonly seen to be among the most prestigious achievements of our times. Based on mining several million citations, we quantitatively analyze the processes driving paradigm shifts in science. We find that groundbreaking discoveries of Nobel Prize Laureates and other famous scientists are not only acknowledged by many citations of their landmark papers. Surprisingly, they also boo…
▽ More
Nobel Prizes are commonly seen to be among the most prestigious achievements of our times. Based on mining several million citations, we quantitatively analyze the processes driving paradigm shifts in science. We find that groundbreaking discoveries of Nobel Prize Laureates and other famous scientists are not only acknowledged by many citations of their landmark papers. Surprisingly, they also boost the citation rates of their previous publications. Given that innovations must outcompete the rich-gets-richer effect for scientific citations, it turns out that they can make their way only through citation cascades. A quantitative analysis reveals how and why they happen. Science appears to behave like a self-organized critical system, in which citation cascades of all sizes occur, from continuous scientific progress all the way up to scientific revolutions, which change the way we see our world. Measuring the "boosting effect" of landmark papers, our analysis reveals how new ideas and new players can make their way and finally triumph in a world dominated by established paradigms. The underlying "boost factor" is also useful to discover scientific breakthroughs and talents much earlier than through classical citation analysis, which by now has become a widespread method to measure scientific excellence, influencing scientific careers and the distribution of research funds. Our findings reveal patterns of collective social behavior, which are also interesting from an attention economics perspective. Understanding the origin of scientific authority may therefore ultimately help to explain, how social influence comes about and why the value of goods depends so strongly on the attention they attract.
△ Less
Submitted 10 May, 2011;
originally announced May 2011.
-
Consistent Community Identification in Complex Networks
Authors:
Haewoon Kwak,
Young-Ho Eom,
Yoonchan Choi,
Hawoong Jeong,
Sue Moon
Abstract:
We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We propose two metrics to quantify the level of consistency across multiple runs of an algorithm: pairwise membership probability and consistency. Based on these two metrics, we address the consistency problem without compromising the modularity. Our solution use…
▽ More
We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We propose two metrics to quantify the level of consistency across multiple runs of an algorithm: pairwise membership probability and consistency. Based on these two metrics, we address the consistency problem without compromising the modularity. Our solution uses pairwise membership probabilities as link weights and generates consistent communities within six or fewer cycles. It offers a new tool in the study of community structures and their evolutions.
△ Less
Submitted 10 October, 2009; v1 submitted 8 October, 2009;
originally announced October 2009.
-
Structure and evolution of online social relationships: Heterogeneity in warm discussions
Authors:
K. -I. Goh,
Y. -H. Eom,
H. Jeong,
B. Kahng,
D. Kim
Abstract:
With the advancement in the information age, people are using electronic media more frequently for communications, and social relationships are also increasingly resorting to online channels. While extensive studies on traditional social networks have been carried out, little has been done on online social network. Here we analyze the structure and evolution of online social relationships by exa…
▽ More
With the advancement in the information age, people are using electronic media more frequently for communications, and social relationships are also increasingly resorting to online channels. While extensive studies on traditional social networks have been carried out, little has been done on online social network. Here we analyze the structure and evolution of online social relationships by examining the temporal records of a bulletin board system (BBS) in a university. The BBS dataset comprises of 1,908 boards, in which a total of 7,446 students participate. An edge is assigned to each dialogue between two students, and it is defined as the appearance of the name of a student in the from- and to-field in each message. This yields a weighted network between the communicating students with an unambiguous group association of individuals. In contrast to a typical community network, where intracommunities (intercommunities) are strongly (weakly) tied, the BBS network contains hub members who participate in many boards simultaneously but are strongly tied, that is, they have a large degree and betweenness centrality and provide communication channels between communities. On the other hand, intracommunities are rather homogeneously and weakly connected. Such a structure, which has never been empirically characterized in the past, might provide a new perspective on social opinion formation in this digital era.
△ Less
Submitted 31 January, 2006;
originally announced January 2006.