Searcharxiv⌕ Search

arXiv subjects

Hang-Hyun Jo

Publications and source records attributed to Hang-Hyun Jo.

At least 73 records · Page 4Linked to original sources

Correlated bursts and the role of memory range

Inhomogeneous temporal processes in natural and social phenomena have been described by bursts that are rapidly occurring events within short time periods alternating with long periods of low activity. In addition to the analysis of heavy-tailed inter-event time distributions, higher-order correlations between inter-event times, called correlated bursts, have been studied only recently. As the possible mechanisms underlying such correlated bursts are far from being fully understood, we devise a simple model for correlated bursts by using a self-exciting point process with variable memory range. Here the probability that a new event occurs is determined by a memory function that is the sum of decaying memories of the past events. In order to incorporate the noise and/or limited memory capacity of systems, we apply two memory loss mechanisms, namely either fixed number or variable number of memories. By using theoretical analysis and numerical simulations we find that excessive amount of memory effect may lead to a Poissonian process, which implies that for memory effect there exists an intermediate range that will generate correlated bursts of magnitude comparable to empirical findings. Hence our results provide deeper understanding of how long-range memory affects correlated bursts.

physics.soc-ph↗

Modeling the role of relationship fading and breakup in social network formation

In social networks of human individuals, social relationships do not necessarily last forever as they can either fade gradually with time, resulting in link aging, or terminate abruptly, causing link deletion, as even old friendships may cease. In this paper, we study a social network formation model where we introduce several ways by which a link termination takes place. If we adopt the link aging, we get a more modular structure with more homogeneously distributed link weights within communities than when link deletion is used. By investigating distributions and relations of various network characteristics, we find that the empirical findings are better reproduced with the link deletion model. This indicates that link deletion plays a more prominent role in organizing social networks than link aging.

physics.soc-ph↗

Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks

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.

physics.soc-ph↗

Coevolution of a network and perception

How does an individual's cognition change a system which is a collective behavior of individuals? Or, how does a system affect an individual's cognition? To examine the interplay between a system and individuals, we study a cognition-based network formation. When a network is not fully observable, individuals' perception of a network plays an important role in decision making. Assuming that a communication link is costly, and more accurate perception yields higher network utility, an agent decides whether to form a link in order to get better information or not. Changes in a network with newly added links affect individuals' perception accuracy, which may cause further changes in a network. We characterize the early stage of network dynamics and information dispersion. Network structures in a steady state are also examined. Additionally, we discuss local interactions and a link concentration in a frequently changing network.

physics.soc-ph↗

Temporal network sparsity and the slowing down of spreading

Interactions in time-varying complex systems are often very heterogeneous at the topological level (who interacts with whom) and at the temporal level (when interactions occur and how often). While it is known that temporal heterogeneities often have strong effects on dynamical processes, e.g. the burstiness of contact sequences is associated with slower spreading dynamics, the picture is far from complete. In this paper, we show that temporal heterogeneities result in temporal sparsity} at the time scale of average inter-event times, and that temporal sparsity determines the amount of slowdown of Susceptible-Infectious (SI) spreading dynamics on temporal networks. This result is based on the analysis of several empirical temporal network data sets. An approximate solution for a simple network model confirms the association between temporal sparsity and slowdown of SI spreading dynamics. Since deterministic SI spreading always follows the fastest temporal paths, our results generalize -- paths are slower to traverse because of temporal sparsity, and therefore all dynamical processes are slower as well.

physics.soc-ph↗

Multilayer weighted social network model

Recent empirical studies using large-scale data sets have validated the Granovetter hypothesis on the structure of the society in that there are strongly wired communities connected by weak ties. However, as interaction between individuals takes place in diverse contexts, these communities turn out to be overlapping. This implies that the society has a multilayered structure, where the layers represent the different contexts. To model this structure we begin with a single-layer weighted social network (WSN) model showing the Granovetterian structure. We find that when merging such WSN models, a sufficient amount of interlayer correlation is needed to maintain the relationship between topology and link weights, while these correlations destroy the enhancement in the community overlap due to multiple layers. To resolve this, we devise a geographic multilayer WSN model, where the indirect interlayer correlations due to the geographic constraints of individuals enhance the overlaps between the communities and, at the same time, the Granovetterian structure is preserved.

physics.soc-ph↗

Spatial patterns of close relationships across the lifespan

The dynamics of close relationships is important for understanding the migration patterns of individual life-courses. The bottom-up approach to this subject by social scientists has been limited by sample size, while the more recent top-down approach using large-scale datasets suffers from a lack of detail about the human individuals. We incorporate the geographic and demographic information of millions of mobile phone users with their communication patterns to study the dynamics of close relationships and its effect in their life-course migration. We demonstrate how the close age- and sex-biased dyadic relationships are correlated with the geographic proximity of the pair of individuals, e.g., young couples tend to live further from each other than old couples. In addition, we find that emotionally closer pairs are living geographically closer to each other. These findings imply that the life-course framework is crucial for understanding the complex dynamics of close relationships and their effect on the migration patterns of human individuals.

physics.soc-ph↗

Inferring human mobility using communication patterns

Understanding the patterns of mobility of individuals is crucial for a number of reasons, from city planning to disaster management. There are two common ways of quantifying the amount of travel between locations: by direct observations that often involve privacy issues, e.g., tracking mobile phone locations, or by estimations from models. Typically, such models build on accurate knowledge of the population size at each location. However, when this information is not readily available, their applicability is rather limited. As mobile phones are ubiquitous, our aim is to investigate if mobility patterns can be inferred from aggregated mobile phone call data alone. Using data released by Orange for Ivory Coast, we show that human mobility is well predicted by a simple model based on the frequency of mobile phone calls between two locations and their geographical distance. We argue that the strength of the model comes from directly incorporating the social dimension of mobility. Furthermore, as only aggregated call data is required, the model helps to avoid potential privacy problems.

physics.soc-ph↗

Large Variance and Fat Tail of Damage by Natural Disaster

In order to account for large variance and fat tail of damage by natural disaster, we study a simple model by combining distributions of disaster and population/property with their spatial correlation. We assume fat-tailed or power-law distributions for disaster and population/property exposed to the disaster, and a constant vulnerability for exposed population/property. Our model suggests that the fat tail property of damage can be determined either by that of disaster or by those of population/property depending on which tail is fatter. It is also found that the spatial correlations of population/property can enhance or reduce the variance of damage depending on how fat the tails of population/property are. In case of tornadoes in the United States, we show that the damage does have fat tail property. Our results support that the standard cost-benefit analysis would not be reliable for social investment in vulnerability reduction and disaster prevention.

physics.soc-ph↗

Generalized friendship paradox in networks with tunable degree-attribute correlation

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.

physics.soc-ph↗

Generalized friendship paradox in complex networks: The case of scientific collaboration

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.

cs.SI↗

Analytically Solvable Model of Spreading Dynamics with Non-Poissonian Processes

Non-Poissonian bursty processes are ubiquitous in natural and social phenomena, yet little is known about their effects on the large-scale spreading dynamics. In order to characterize these effects we devise an analytically solvable model of Susceptible-Infected (SI) spreading dynamics in infinite systems for arbitrary inter-event time distributions and for the whole time range. Our model is stationary from the beginning, and the role of lower bound of inter-event times is explicitly considered. The exact solution shows that for early and intermediate times the burstiness accelerates the spreading as compared to a Poisson-like process with the same mean and same lower bound of inter-event times. Such behavior is opposite for late time dynamics in finite systems, where the power-law distribution of inter-event times results in a slower and algebraic convergence to fully infected state in contrast to the exponential decay of the Poisson-like process. We also provide an intuitive argument for the exponent characterizing algebraic convergence.

physics.soc-ph↗

Innovation and Nested Preferential Growth in Chess Playing Behavior

Complexity develops via the incorporation of innovative properties. Chess is one of the most complex strategy games, where expert contenders exercise decision making by imitating old games or introducing innovations. In this work, we study innovation in chess by analyzing how different move sequences are played at the population level. It is found that the probability of exploring a new or innovative move decreases as a power law with the frequency of the preceding move sequence. Chess players also exploit already known move sequences according to their frequencies, following a preferential growth mechanism. Furthermore, innovation in chess exhibits Heaps' law suggesting similarities with the process of vocabulary growth. We propose a robust generative mechanism based on nested Yule-Simon preferential growth processes that reproduces the empirical observations. These results, supporting the self-similar nature of innovations in chess are important in the context of decision making in a competitive scenario, and extend the scope of relevant findings recently discovered regarding the emergence of Zipf's law in chess.

physics.soc-ph↗

Analysis of one-dimensional Yut-Nori game: winning strategy and avalanche-size distribution

In the Korean traditional board game Yut-Nori, teams compete by moving their pieces on the two-dimensional game board, and the team whose all pieces complete a round trip on the board wins. In every round, teams throw four wooden sticks of the shape of half-cut cylinder and the number of sticks that show belly sides, i.e., the flat sides, determines the number of steps the team's piece can advance on the board. It is possible to pile up one team's pieces if their sites are identical so that pieces as a group can move together afterwards (piling). If a piece of the opponent team is at the new site of one team's piece, the piece is caught and removed from the board, and the team is given one more chance to throw sticks and proceed (catching). For a simplicity, we simulate this game on one-dimensional board with the same number of sites as the original game, and show that catching is more advantageous strategy than piling to win. We also study the avalanche-size distribution in thermodynamic limit to find that it follows an exponential form.

physics.soc-ph↗

Contextual analysis framework for bursty dynamics

To understand the origin of bursty dynamics in natural and social processes we provide a general analysis framework, in which the temporal process is decomposed into sub-processes and then the bursts in sub-processes, called contextual bursts, are combined to collective bursts in the original process. For the combination of sub-processes, it is required to consider the distribution of different contexts over the original process. Based on minimal assumptions for inter-event time statistics, we present a theoretical analysis for the relationship between contextual and collective inter-event time distributions. Our analysis framework helps to exploit contextual information available in decomposable bursty dynamics.

physics.soc-ph↗

Spatiotemporal correlations of handset-based service usages

We study spatiotemporal correlations and temporal diversities of handset-based service usages by analyzing a dataset that includes detailed information about locations and service usages of 124 users over 16 months. By constructing the spatiotemporal trajectories of the users we detect several meaningful places or contexts for each one of them and show how the context affects the service usage patterns. We find that temporal patterns of service usages are bound to the typical weekly cycles of humans, yet they show maximal activities at different times. We first discuss their temporal correlations and then investigate the time-ordering behavior of communication services like calls being followed by the non-communication services like applications. We also find that the behavioral overlap network based on the clustering of temporal patterns is comparable to the communication network of users. Our approach provides a useful framework for handset-based data analysis and helps us to understand the complexities of information and communications technology enabled human behavior.

physics.soc-ph↗

Time-Varying Priority Queuing Models for Human Dynamics

Queuing models provide insight into the temporal inhomogeneity of human dynamics, characterized by the broad distribution of waiting times of individuals performing tasks. We study the queuing model of an agent trying to execute a task of interest, the priority of which may vary with time due to the agent's "state of mind." However, its execution is disrupted by other tasks of random priorities. By considering the priority of the task of interest either decreasing or increasing algebraically in time, we analytically obtain and numerically confirm the bimodal and unimodal waiting time distributions with power-law decaying tails, respectively. These results are also compared to the updating time distribution of papers in the arXiv.org and the processing time distribution of papers in Physical Review journals. Our analysis helps to understand human task execution in a more realistic scenario.

physics.soc-ph↗

Optimized reduction of uncertainty in bursty human dynamics

Human dynamics is known to be inhomogeneous and bursty but the detailed understanding of the role of human factors in bursty dynamics is still lacking. In order to investigate their role we devise an agent-based model, where an agent in an uncertain situation tries to reduce the uncertainty by communicating with information providers while having to wait time for responses. Here the waiting time can be considered as cost. We show that the optimal choice of the waiting time under uncertainty gives rise to the bursty dynamics, characterized by the heavy-tailed distribution of optimal waiting time. We find that in all cases the efficiency for communication is relevant to the scaling behavior of the optimal waiting time distribution. On the other hand the cost turns out in some cases to be irrelevant depending on the degree of uncertainty and efficiency.

physics.soc-ph↗