Searcharxiv⌕ Search

arXiv subjects

Hiroki Sayama

Publications and source records attributed to Hiroki Sayama.

At least 37 records · Page 2Linked to original sources

Non-Spatial Hash Chemistry as a Minimalistic Open-Ended Evolutionary System

There is an increasing level of interest in open-endedness in the recent literature of Artificial Life and Artificial Intelligence. We previously proposed the cardinality leap of possibility spaces as a promising mechanism to facilitate open-endedness in artificial evolutionary systems, and demonstrated its effectiveness using Hash Chemistry, an artificial chemistry model that used a hash function as a universal fitness evaluator. However, the spatial nature of Hash Chemistry came with extensive computational costs involved in its simulation, and the particle density limit imposed to prevent explosion of computational costs prevented unbounded growth in complexity of higher-order entities. To address these limitations, here we propose a simpler non-spatial variant of Hash Chemistry in which spatial proximity of particles are represented explicitly in the form of multisets. This model modification achieved a significant reduction of computational costs in simulating the model. Results of numerical simulations showed much more significant unbounded growth in both maximal and average sizes of replicating higher-order entities than the original model, demonstrating the effectiveness of this non-spatial model as a minimalistic example of open-ended evolutionary systems.

cs.NE↗

Collective group drift in a PDE-based opinion dynamics model with biased perception kernels

In the age of technology, individuals accelerate their biased gathering of information which in turn leads to a population becoming extreme and more polarized. Here we study a partial differential equation model for opinion dynamics that exhibits collective behavior subject to nonlocal interactions. We developed a new interaction kernel function to represent biased information gathering. Through a linear stability analysis, we show that biased populations can still form opinionated groups. However, a population that is too heavily biased can no longer come to a consensus, that is, the initial homogeneous mixed state becomes stable. Numerical simulations with biased information gathering show the ability for groups to collectively drift towards one end of the opinion space. This means that a small bias in each individual will collectively lead to groups of individuals becoming extreme together. The characteristic time scale for a groups existence is captured from numerical experiments using the temporal correlation function. Supplementing this, we included a measure of how different each population is after regular time intervals using a form of the Manhattan and Euclidean distance metrics. We conclude by exploring how wall boundary conditions induce pattern formation initially on the most extreme sides of the domain.

physics.soc-ph↗

Extracting Network Structures from Corporate Organization Charts Using Heuristic Image Processing

Organizational structure of corporations has potential to provide implications for dynamics and performance of corporate operations. However, this subject has remained unexplored because of the lack of readily available organization network datasets. To overcome the this gap, we developed a new heuristic image-processing method to extract and reconstruct organization network data from published organization charts. Our method analyzes a PDF file of a corporate organization chart and detects text labels, boxes, connecting lines, and other objects through multiple steps of heuristically implemented image processing. The detected components are reorganized together into a Python's NetworkX Graph object for visualization, validation and further network analysis. We applied the developed method to the organization charts of all the listed firms in Japan shown in the ``Organization Chart/System Diagram Handbook'' published by Diamond, Inc., from 2008 to 2011. Out of the 10,008 organization chart PDF files, our method was able to reconstruct 4,606 organization networks (data acquisition success rate: 46%). For each reconstructed organization network, we measured several network diagnostics, which will be used for further statistical analysis to investigate their potential correlations with corporate behavior and performance.

cs.SI↗

Modeling and Analysis of the Lead-Lag Network of Economic Indicators

We propose a method of analyzing multivariate time series data that investigates lead-lag relationships among economic indicators during the COVID-19 era with a weighted directed network of lagged variables. The analysis includes a stock index, average unemployment, and several variables that are used to calculate inflation. Three complex networks are created, with these variables and several lags of each as the network nodes. Network edges are weighted based on three relationship metrics: correlation, mutual information, and transfer entropy. In each network, nodes are merged, and edges are aggregated to simplify the weighted directed graph. Pagerank is used to determine the most influential and the most influenced node over the time period. Results were reasonably robust within each network, but they were heavily dependent on the choice of metric.

cs.SI↗

Agent Heterogeneity Mediates Extremism in an Adaptive Social Network Model

An existing model of opinion dynamics on an adaptive social network is extended to introduce update policy heterogeneity, representing the fact that individual differences between social animals can affect their tendency to form, and be influenced by, their social bonds with other animals. As in the original model, the opinions and social connections of a population of model agents change due to three social processes: conformity, homophily and neophily. Here, however, we explore the case in which each node's susceptibility to these three processes is parameterised by node-specific values drawn independently at random from some distribution. This introduction of heterogeneity increases both the degree of extremism and connectedness in the final population (relative to comparable homogeneous networks) and leads to significant assortativity with respect to node update policy parameters as well as node opinions. Each node's update policy parameters also predict properties of the community that they will belong to in the final network configuration. These results suggest that update policy heterogeneity in social populations may have a significant impact on the formation of extremist communities in real-world populations.

cs.SI↗

Generation and Influence of Eccentric Ideas on Social Networks

Studying extreme ideas in routine choices and discussions is of utmost importance to understand the increasing polarization in society. In this study, we focus on understanding the generation and influence of extreme ideas in routine conversations which we label "eccentric" ideas. The eccentricity of any idea is defined as the deviation of that idea from the norm of the social neighborhood. We collected and analyzed data from two completely different sources: public social media and online experiments in a controlled environment. We compared the popularity of ideas against their eccentricity to understand individuals' fascination towards eccentricity. We found that more eccentric ideas have a higher probability of getting a greater number of "likes". Additionally, we demonstrate that the social neighborhood of an individual conceals eccentricity changes in one's own opinions and facilitates generation of eccentric ideas at a collective level.

cs.SI↗

Social Fragmentation Transitions in Large-Scale Parameter Sweep Simulations of Adaptive Social Networks

Social fragmentation transition is a transition of social states between many disconnected communities with distinct opinions and a well-connected single network with homogeneous opinions. This is a timely research topic with high relevance to various current societal issues. We had previously studied this problem using numerical simulations of adaptive social network models and found that two individual behavioral traits, homophily and attention to novelty, had the most statistically significant impact on the outcomes of social network evolution. However, our previous study was limited in terms of the range of parameter values examined, and possible interactions between multiple behavioral traits were largely ignored. In this study, we conducted a substantially larger-scale parameter sweep numerical experiment of the same model with expanded parameter ranges by an order of magnitude in each parameter dimension, resulting in a total of 116,640 simulation runs. To capture nontrivial interactions among behavioral parameters, we modeled and visualized the dependence of outcome measures on the model parameters using artificial neural networks. Results show that, while the competition between homophily and attention to novelty is still the primary determinant of social fragmentation, another transition plane emerges when individuals have strong social conformity behavior, which was not previously known. This implies that social fragmentation transition can also occur in the homophily-social conformity trade-off, the two behavioral traits that have very similar microscopic individual-level effects but produce very different macroscopic collective-level outcomes, illustrating the nontrivial macroscopic dynamics of complex collective systems.

cs.SI↗

A two-phase model of collective memory decay with a dynamical switching point

Public memories of significant events shared within societies and groups have been conceptualized and studied as collective memory since the 1920s. Thanks to the recent advancement in digitization of public-domain knowledge and online user behaviors, collective memory has now become a subject of rigorous quantitative investigation using large-scale empirical data. Earlier studies, however, typically considered only one dynamical process applied to data obtained in just one specific event category. Here we propose a two-phase mathematical model of collective memory decay that combines exponential and power-law phases, which represent fast (linear) and slow (nonlinear) decay dynamics, respectively. We applied the proposed model to the Wikipedia page view data for articles on significant events in five categories: earthquakes, deaths of notable persons, aviation accidents, mass murder incidents, and terrorist attacks. Results showed that the proposed two-phase model compared favorably with other existing models of collective memory decay in most of the event categories. The estimated model parameters were found to be similar across all the event categories. The proposed model also allowed for detection of a dynamical switching point when the dominant decay dynamics exhibit a phase shift from exponential to power-law. Such decay phase shifts typically occurred about 10 to 11 days after the peak in all of the five event categories.

physics.soc-ph↗

How Lévy flights triggered by presence of defectors affect evolution of cooperation in spatial games

Cooperation among individuals has been key to sustaining societies. However, natural selection favors defection over cooperation. Cooperation can be favored when the mobility of individuals allows cooperators to form a cluster (or group). Mobility patterns of animals sometimes follow a Lévy flight. A Lévy flight is a kind of random walk but it is composed of many small movements with a few big movements. The role of Lévy flights for cooperation has been studied by Antonioni and Tomassini. They showed that Lévy flights promoted cooperation combined with conditional movements triggered by neighboring defectors. However, the optimal condition for neighboring defectors and how the condition changes by the intensity of Lévy flights are still unclear. Here, we developed an agent-based model in a square lattice where agents perform Lévy flights depending on the fraction of neighboring defectors. We systematically studied the relationships among three factors for cooperation: sensitivity to defectors, the intensity of Lévy flights, and population density. Results of evolutionary simulations showed that moderate sensitivity most promoted cooperation. Then, we found that the shortest movements were best for cooperation when the sensitivity to defectors was high. In contrast, when the sensitivity was low, longer movements were best for cooperation. Thus, Lévy flights, the balance between short and long jumps, promoted cooperation in any sensitivity, which was confirmed by evolutionary simulations. Finally, as the population density became larger, higher sensitivity was more beneficial for cooperation to evolve. Our study highlights that Lévy flights are an optimal searching strategy not only for foraging but also for constructing cooperative relationships with others.

q-bio.PE↗

Detecting Global Community Structure in a COVID-19 Activity Correlation Network

The global pandemic of COVID-19 over the last 2.5 years have produced an enormous amount of epidemic/public health datasets, which may also be useful for studying the underlying structure of our globally connected world. Here we used the Johns Hopkins University COVID-19 dataset to construct a correlation network of countries/regions and studied its global community structure. Specifically, we selected countries/regions that had at least 100,000 cumulative positive cases from the dataset and generated a 7-day moving average time series of new positive cases reported for each country/region. We then calculated a time series of daily change exponents by taking the day-to-day difference in log of the number of new positive cases. We constructed a correlation network by connecting countries/regions that had positive correlations in their daily change exponent time series using their Pearson correlation coefficient as the edge weight. Applying the modularity maximization method revealed that there were three major communities: (1) Mainly Europe + North America + Southeast Asia that showed similar six-peak patterns during the pandemic, (2) mainly Near/Middle East + Central/South Asia + Central/South America that loosely followed Community 1 but had a notable increase of activities because of the Delta variant and was later impacted significantly by the Omicron variant, and (3) mainly Africa + Central/East Canada + Australia that did not have much activities until a huge spike was caused by the Omicron variant. These three communities were robustly detected under varied settings. Constructing a 3D "phase space" by using the median curves in those three communities for x-y-z coordinates generated an effective summary trajectory of how the global pandemic progressed.

cs.SI↗

Visualizing Collective Idea Generation and Innovation Processes in Social Networks

Collective idea generation and innovation processes are complex and dynamic, involving a large amount of qualitative narrative information that is difficult to monitor, analyze, and visualize using traditional methods. In this study, we developed three new visualization methods for collective idea generation and innovation processes and applied them to data from online social network experiments. The first visualization is the Idea Cloud, which helps monitor collective idea posting activity and intuitively tracks idea clustering and transition. The second visualization is the Idea Geography, which helps understand how the idea space and its utility landscape are structured and how collaboration was performed in that space. The third visualization is the Idea Network, which connects idea dynamics with the social structure of the people who generated them, displaying how social influence among neighbors may have affected collaborative activities and where innovative ideas arose and spread in the social network.

cs.SI↗

Utterance Clustering Using Stereo Audio Channels

Utterance clustering is one of the actively researched topics in audio signal processing and machine learning. This study aims to improve the performance of utterance clustering by processing multichannel (stereo) audio signals. Processed audio signals were generated by combining left- and right-channel audio signals in a few different ways and then extracted embedded features (also called d-vectors) from those processed audio signals. This study applied the Gaussian mixture model for supervised utterance clustering. In the training phase, a parameter sharing Gaussian mixture model was conducted to train the model for each speaker. In the testing phase, the speaker with the maximum likelihood was selected as the detected speaker. Results of experiments with real audio recordings of multi-person discussion sessions showed that the proposed method that used multichannel audio signals achieved significantly better performance than a conventional method with mono audio signals in more complicated conditions.

eess.AS↗

Hot-Get-Richer Network Growth Model

Under preferential attachment (PA) network growth models late arrivals are at a disadvantage with regard to their final degrees. Previous extensions of PA have addressed this deficiency by either adding the notion of node fitness to PA, usually drawn from some fitness score distributions, or by using fitness alone to control attachment. Here we introduce a new dynamical approach to address late arrivals by adding a recent-degree-change bias to PA so that nodes with higher relative degree change in temporal proximity to an arriving node get an attachment probability boost. In other words, if PA describes a rich-get-richer mechanism, and fitness-based approaches describe good-get-richer mechanisms, then our model can be characterized as a hot-get-richer mechanism, where hotness is determined by the rate of degree change over some recent past. The proposed model produces much later high-ranking nodes than the PA model and, under certain parameters, produces networks with structure similar to PA networks.

cs.SI↗

Detecting Dynamic States of Temporal Networks Using Connection Series Tensors

Many temporal networks exhibit multiple system states, such as weekday and weekend patterns in social contact networks. The detection of such distinct states in temporal network data has recently been explored as it helps reveal underlying dynamical processes. A commonly used method is network aggregation over a time window, which aggregates a subsequence of multiple network snapshots into one static network. This method, however, necessarily discards temporal dynamics within the time window. Here we develop a new method for detecting dynamic states in temporal networks using information regarding the timeline of contacts between each pair of nodes. We apply a similarity measure informed by the techniques of processing time series and community detection to sequentially discompose a given temporal network into multiple dynamic states (including repeated ones). Experiments with empirical temporal network data demonstrated that our method outperformed the conventional approach using simple network aggregation in revealing interpretable system states. In addition, our method allows users to analyze hierarchical temporal structures and to uncover dynamic state at different spatial/temporal resolutions.

cs.SI↗

Enhanced Ability of Information Gathering May Intensify Disagreement Among Groups

Today's society faces widening disagreement and conflicts among constituents with incompatible views. Escalated views and opinions are seen not only in radical ideology or extremism but also in many other scenes of our everyday life. Here we show that widening disagreement among groups may be linked to the advancement of information communication technology, by analyzing a mathematical model of population dynamics in a continuous opinion space. We adopted the interaction kernel approach to model enhancement of people's information gathering ability and introduced a generalized non-local gradient as individuals' perception kernel. We found that the characteristic distance between population peaks becomes greater as the wider range of opinions becomes available to individuals or the greater attention is attracted to opinions distant from theirs. These findings may provide a possible explanation for why disagreement is growing in today's increasingly interconnected society, without attributing its cause only to specific individuals or events.

physics.soc-ph↗

Self-Organization and Artificial Life

Self-organization can be broadly defined as the ability of a system to display ordered spatio-temporal patterns solely as the result of the interactions among the system components. Processes of this kind characterize both living and artificial systems, making self-organization a concept that is at the basis of several disciplines, from physics to biology and engineering. Placed at the frontiers between disciplines, Artificial Life (ALife) has heavily borrowed concepts and tools from the study of self-organization, providing mechanistic interpretations of life-like phenomena as well as useful constructivist approaches to artificial system design. Despite its broad usage within ALife, the concept of self-organization has been often excessively stretched or misinterpreted, calling for a clarification that could help with tracing the borders between what can and cannot be considered self-organization. In this review, we discuss the fundamental aspects of self-organization and list the main usages within three primary ALife domains, namely "soft" (mathematical/computational modeling), "hard" (physical robots), and "wet" (chemical/biological systems) ALife. We also provide a classification to locate this research. Finally, we discuss the usefulness of self-organization and related concepts within ALife studies, point to perspectives and challenges for future research, and list open questions. We hope that this work will motivate discussions related to self-organization in ALife and related fields.

nlin.AO↗

Capturing the Production of the Innovative Ideas: An Online Social Network Experiment and "Idea Geography" Visualization

Collective design and innovation are crucial in organizations. To investigate how the collective design and innovation processes would be affected by the diversity of knowledge and background of collective individual members, we conducted three collaborative design task experiments which involved nearly 300 participants who worked together anonymously in a social network structure using a custom-made computer-mediated collaboration platform. We compared the idea generation activity among three different background distribution conditions (clustered, random, and dispersed) with the help of the "doc2vec" text representation machine learning algorithm. We also developed a new method called "Idea Geography" to visualize the idea utility terrain on a 2D problem domain. The results showed that groups with random background allocation tended to produce the best design idea with highest utility values. It was also suggested that the diversity of participants' backgrounds distribution on the network might interact with each other to affect the diversity of ideas generated. The proposed idea geography successfully visualized that the collective design processes did find the high utility area through exploration and exploitation in collaborative work.

cs.SI↗

The Power of Communities: A Text Classification Model with Automated Labeling Process Using Network Community Detection

Text classification is one of the most critical areas in machine learning and artificial intelligence research. It has been actively adopted in many business applications such as conversational intelligence systems, news articles categorizations, sentiment analysis, emotion detection systems, and many other recommendation systems in our daily life. One of the problems in supervised text classification models is that the models' performance depends heavily on the quality of data labeling that is typically done by humans. In this study, we propose a new network community detection-based approach to automatically label and classify text data into multiclass value spaces. Specifically, we build networks with sentences as the network nodes and pairwise cosine similarities between the Term Frequency-Inversed Document Frequency (TFIDF) vector representations of the sentences as the network link weights. We use the Louvain method to detect the communities in the sentence networks. We train and test the Support Vector Machine and the Random Forest models on both the human-labeled data and network community detection labeled data. Results showed that models with the data labeled by the network community detection outperformed the models with the human-labeled data by 2.68-3.75% of classification accuracy. Our method may help developments of more accurate conversational intelligence and other text classification systems.

cs.CL↗