Search

The year of 2024 marks the 25th anniversary of the publication of evoloops, an evolutionary variant of Chris Langton's self-reproducing loops which proved that Darwinian evolution of self-reproducing organisms by variation and natural selection is possible within deterministic cellular automata. Over the last few decades, this line of Artificial Life research has since undergone several important developments. Although it experienced a relative dormancy of activities for a while, the recent rise of interest in open-ended evolution and the success of continuous cellular automata models have brought researchers' attention back to how to make spatio-temporal patterns self-reproduce and evolve within spatially distributed computational media. This article provides a review of the relevant literature on this topic over the past 25 years and highlights the major accomplishments made so far, the challenges being faced, and promising future research directions., Comment: 18 pages, 2 figures

The growing reliance on online services underscores the crucial role of recommendation systems, especially on social media platforms seeking increased user engagement. This study investigates how recommendation systems influence the impact of personal behavioral traits on social network dynamics. It explores the interplay between homophily, users' openness to novel ideas, and recommendation-driven exposure to new opinions. Additionally, the research examines the impact of recommendation systems on the diversity of newly generated ideas, shedding light on the challenges and opportunities in designing effective systems that balance the exploration of new ideas with the risk of reinforcing biases or filtering valuable, unconventional concepts., Comment: 16 pages, 3 Figuers

This paper reports a case study of an application of high-resolution agent-based modeling and simulation to pandemic response planning on a university campus. In the summer of 2020, we were tasked with a COVID-19 pandemic response project to create a detailed behavioral simulation model of the entire campus population at Binghamton University. We conceptualized this problem as an agent migration process on a multilayer transportation network, in which each layer represented a different transportation mode. As no direct data were available about people's behaviors on campus, we collected as much indirect information as possible to inform the agents' behavioral rules. Each agent was assumed to move along the shortest path between two locations within each transportation layer and switch layers at a parking lot or a bus stop, along with several other behavioral assumptions. Using this model, we conducted simulations of the whole campus population behaviors on a typical weekday, involving more than 25,000 agents. We measured the frequency of close social contacts at each spatial location and identified several busy locations and corridors on campus that needed substantial behavioral intervention. Moreover, systematic simulations with varying population density revealed that the effect of population density reduction was nonlinear, and that reducing the population density to 40-45% would be optimal and sufficient to suppress disease spreading on campus. These results were reported to the university administration and utilized in the pandemic response planning, which led to successful outcomes., Comment: 14 pages, 6 figures; submitted to PPAM 2024 (under review)

A major challenge when describing the origin of life is to explain "how instructional information control systems emerge naturally and spontaneously from mere molecular dynamics". So far, no one has clarified how information control emerged ab initio and how primitive control mechanisms in life might have evolved, becoming increasingly refined. Based on recent experimental results showing that chemical computation does not require the presence of life-related chemistry, we elucidate the origin and early evolution of information handling by chemical automata, from information processing (computation) to information storage (memory) and information transmission (communication) and later digital messengers, covering at the same time its syntactic, semantic and pragmatic flavors. In contrast to other theories that assume the existence of initial complex structures, our representation starts from trivial self-replicators whose interaction leads to the arising of more powerful molecular machines. By describing precisely the primordial transitions in chemistry-based computation, our framework is capable of explaining the above-mentioned gaps and can be translated to other models of computation, which allow us to explore biological phenomena at multiple spatial and temporal scales. Being compatible with the free energy principle, we have developed a computational enactivist theoretical framework that could be able to describe from the origin of life to higher-level cognition, as if it were a purely constructivist narrative. At the end of our manuscript, we propose some ways to extend our ideas, including experimental validation of our theory (both in vitro and in silico)., Comment: 9 pages, 3 figures, 1 table

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., Comment: 7 pages, 6 figures, 1 table; accepted for publication in Proceedings of IEEE CEC 2024 (part of IEEE WCCI 2024)

It is common in origins of life research to view the first stages of life as the passive result of particular environmental conditions. This paper considers the alternative possibility: that the antecedents of life were already actively regulating their environment to maintain the conditions necessary for their own persistence. In support of this proposal, we describe ‘viability-based behaviour’: a way that simple entities can adaptively regulate their environment in response to their health, and in so doing, increase the likelihood of their survival. Drawing on empirical investigations of simple self-preserving abiological systems, we argue that these viability-based behaviours are simple enough to precede neo-Darwinian evolution. We also explain how their operation can reduce the demanding requirements that mainstream theories place upon the environment(s) in which life emerged.

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., Comment: 9 pages, 2 figures, 4 tables; accepted for publication in the 2023 Artificial Life Conference (ALIFE 2023) Proceedings

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., Comment: 15 pages, 3 figures

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., Comment: 8 pages, 12 figures, 1 table; to be published in "Data Science and Security: Proceedings of IDSCS 2023" (Springer)

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., Comment: 14 pages, 7 figures, 1 table; peer reviewed and accepted for presentation at International Conference on Data Science, Computation and Security (IDSCS-2023)

Human collectives, e.g., teams and organizations, increasingly require participation of members with diverse backgrounds working in networked social environments. However, little is known about how network structure and the functional diversity of member backgrounds would affect collective processes. Here we conducted three sets of human-subject experiments which involved 617 participants who collaborated anonymously in a collective ideation task on a custom-made online social network platform. We found that spatially clustered collectives with clustered background distribution tended to explore more diverse ideas than in other conditions, whereas collectives with random background distribution consistently generated ideas with the highest utility. We also found that higher network connectivity may improve individuals' overall experience but may not improve the collective performance regarding idea generation, idea diversity, and final idea quality., Comment: 44 pages, 19 figures, 4 tables

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., Comment: 11 pages, 4 figures; to appear in the Proceedings of the 14th International Conference on Parallel Processing and Applied Mathematics (PPAM 2022), Springer, in press

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., Comment: 11 pages, 4 figures, 1 table; accepted for publication in Complex Networks & Their Applications XI: Proceedings of The Eleventh International Conference on Complex Networks and their Applications: COMPLEX NETWORKS 2022 - Volume 1 (Hocine Cherifi, Rosario Nunzio Mantegna, Luis M. Rocha, Chantal Cherifi, Salvatore Micciche, eds.)

Cooperation in scale-free networks has proven to be very robust against removal of randomly selected nodes (error) but highly sensitive to removal of the most connected nodes (attack). In this paper we analyze two comparable types of node removal in which the removal selection is based on tournaments where the fittest (raids) or the least fit (battles) nodes are chosen. We associate the two removals to two types of Maya warfare offences during the Classic period. During this period of at least 500 years, political leaders were able to sustain social order in spite of attack-like offences to their social networks. We present a computational model with a population fluctuation mechanism that operates under an evolutionary game theoretic approach using the Prisoner's Dilemma as a metaphor of cooperation. We find that paradoxically battles are able to uphold cooperation under moderate levels of raids, although raids do have a strong impact on the network structure. We infer that cooperation does not depend as much on the structure as it does on the underlying mechanism that allows the network to readjust. We relate the results to the Maya Classic period, concluding that Mayan warfare by itself cannot entirely explain the Maya political collapse without appealing to other factors that increased the pressures against cooperation.

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.

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., Comment: 18 pages, 9 figures, 3 tables

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., Comment: 12 pages, 8 figures. To be published in the proceedings of the 9th International Conference on Complex Networks and their Application

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.

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., Comment: 16 pages, 10 figures, submitted to CSS 2019 (Computational Social Science 2019)

Social fragmentation caused by widening differences among constituents has recently become a highly relevant issue to our modern society. Theoretical models of social fragmentation using the adaptive network framework have been proposed and studied in earlier literature, which are known to either converge to a homogeneous, well-connected network or fragment into many disconnected sub-networks with distinct states. Here we introduced the diversities of behavioral attributes among social constituents and studied their effects on social network evolution. We investigated, using a networked agent-based simulation model, how the resulting network states and topologies would be affected when individual constituents' cultural tolerance, cultural state change rate, and edge weight change rate were systematically diversified. The results showed that the diversity of cultural tolerance had the most direct effect to keep the cultural diversity within the society high and simultaneously reduce the average shortest path length of the social network, which was not previously reported in the earlier literature. Diversities of other behavioral attributes also had effects on final states of the social network, with some nonlinear interactions. Our results suggest that having a broad distribution of cultural tolerance levels within society can help promote the coexistence of cultural diversity and structural connectivity., Comment: 11 pages, 4 figures, 2 tables, submitted to NetSci-X 2020

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., Comment: 13 pages, 5 figures, 1 table. Accepted by NetSci-X 2020 Tokyo

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., Comment: 24 pages, 1 figure, 1 table arXiv admin note: substantial text overlap with arXiv:1804.01144

What can be done to better support collaborative innovation?

Our educational systems must prepare students for an increasingly interconnected future, and teachers require equipping with modern tools, such as network science, to achieve this. We held a Networks in Classroom Education (NiCE) workshop for a group of 21 K-12 teachers with various disciplinary backgrounds. The explicit aim of this was to introduce them to concepts in network science, show them how these concepts can be utilized in the classroom, and empower them to develop resources, in the form of lesson plans, for themselves and the wider community. Here we detail the nature of the workshop and present its outcomes – including an innovative set of publicly available lesson plans. We discuss the future for successful integration of network science in K- 12 education, and the importance of inspiring and enabling our teachers.

Current education systems continue to be based predominantly on reductionist mindsets in which teaching is conducted on a subject-by-subject and module-by-module basis. Improvement is planned and implemented using a linear, causal, independent- problem-to-solution approach, with very little consideration given to the interconnectedness among the various components and ideas involved in these complex knowledge systems. This situation presents a need to think about how understanding these connections can improve the learning of complex ideas. It also constitutes an opportunity to provide a multifaceted intervention for communities of learners, which would, itself, be a coordinated network of collaborative efforts to develop a network literate populace. In this paper, the authors describe addressing these issues through a multi-phase, multi-year approach to professional development with formal and informal educators; the outcomes of this work; and next steps.

What can be done to better support collaborative innovation?

Open-ended evolution requires unbounded possibilities that evolving entities can explore. The cardinality of a set of those possibilities thus has a significant implication for the open-endedness of evolution. We propose that facilitating formation of higher-order entities is a generalizable, effective way to cause a "cardinality leap" in the set of possibilities that promotes open-endedness. We demonstrate this idea with a simple, proof-of-concept toy model called "Hash Chemistry" that uses a hash function as a fitness evaluator of evolving entities of any size/order. Simulation results showed that the cumulative number of unique replicating entities that appeared in evolution increased almost linearly along time without an apparent bound, demonstrating the effectiveness of the proposed cardinality leap. It was also observed that the number of individual entities involved in a single replication event gradually increased over time, indicating evolutionary appearance of higher-order entities. Moreover, these behaviors were not observed in control experiments in which fitness evaluators were replaced by random number generators. This strongly suggests that the dynamics observed in Hash Chemistry were indeed evolutionary behaviors driven by selection and adaptation taking place at multiple scales., Comment: 18 pages, 7 figures, 1 table

We studied the long-term dynamics of evolutionary Swarm Chemistry by extending the simulation length ten-fold compared to earlier work and by developing and using a new automated object harvesting method. Both macroscopic dynamics and microscopic object features were characterized and tracked using several measures. Results showed that the evolutionary dynamics tended to settle down into a stable state after the initial transient period, and that the extent of environmental perturbations also affected the evolutionary trends substantially. In the meantime, the automated harvesting method successfully produced a huge collection of spontaneously evolved objects, revealing the system's autonomous creativity at an unprecedented scale., Comment: 8 pages, 9 figures, to be published in the ALIFE 2018 proceedings

Self-organization has been an important concept within a number of disciplines, which Artificial Life (ALife) also has heavily utilized since its inception. The term and its implications, however, are often confusing or misinterpreted. In this work, we provide a mini-review of self-organization and its relationship with ALife, aiming at initiating discussions on this important topic with the interested audience. We first articulate some fundamental aspects of self-organization, outline its usage, and review its applications to ALife within its soft, hard, and wet domains. We also provide perspectives for further research., Comment: 8 pages, submitted to ALife 2018

Many living and non-living complex systems can be modeled and understood as collective systems made of heterogeneous components that self-organize and generate nontrivial morphological structures and behaviors. This chapter presents a brief overview of our recent effort that investigated various aspects of such morphogenetic collective systems. We first propose a theoretical classification scheme that distinguishes four complexity levels of morphogenetic collective systems based on the nature of their components and interactions. We conducted a series of computational experiments using a self-propelled particle swarm model to investigate the effects of (1) heterogeneity of components, (2) differentiation/re-differentiation of components, and (3) local information sharing among components, on the self-organization of a collective system. Results showed that (a) heterogeneity of components had a strong impact on the system's structure and behavior, (b) dynamic differentiation/re-differentiation of components and local information sharing helped the system maintain spatially adjacent, coherent organization, (c) dynamic differentiation/re-differentiation contributed to the development of more diverse structures and behaviors, and (d) stochastic re-differentiation of components naturally realized a self-repair capability of self-organizing morphologies. We also explored evolutionary methods to design novel self-organizing patterns, using interactive evolutionary computation and spontaneous evolution within an artificial ecosystem. These self-organizing patterns were found to be remarkably robust against dimensional changes from 2D to 3D, although evolution worked efficiently only in 2D settings., Comment: 13 pages, 8 figures, 1 table; submitted to "Evolution, Development, and Complexity: Multiscale Models in Complex Adaptive Systems" (Springer Proceedings in Complexity Series)

As network science has matured as an established field of research, there are already a number of courses on this topic developed and offered at various higher education institutions, often at postgraduate levels. In those courses, instructors adopted different approaches with different focus areas and curricular designs. We collected information about 30 existing network science courses from various online sources, and analyzed the contents of their syllabi or course schedules. The topics and their curricular sequences were extracted from the course syllabi/schedules and represented as a directed weighted graph, which we call the topic network. Community detection in the topic network revealed seven topic clusters, which matched reasonably with the concept list previously generated by students and educators through the Network Literacy initiative. The minimum spanning tree of the topic network revealed typical flows of curricular contents, starting with examples of networks, moving onto random networks and small-world networks, then branching off to various subtopics from there. These results illustrate the current state of consensus formation (including variations and disagreements) among the network science community on what should be taught about networks and how, which may also be informative for K--12 education and informal education., Comment: 17 pages, 11 figures, 2 tables; to appear in Cramer, C. et al. (eds.), Network Science in Education -- Tools and Techniques for Transforming Teaching and Learning (Springer, 2017, in press)

We propose a novel computational method to extract information about interactions among individuals with different behavioral states in a biological collective from ordinary video recordings. Assuming that individuals are acting as finite state machines, our method first detects discrete behavioral states of those individuals and then constructs a model of their state transitions, taking into account the positions and states of other individuals in the vicinity. We have tested the proposed method through applications to two real-world biological collectives: termites in an experimental setting and human pedestrians in a university campus. For each application, a robust tracking system was developed in-house, utilizing interactive human intervention (for termite tracking) or online agent-based simulation (for pedestrian tracking). In both cases, significant interactions were detected between nearby individuals with different states, demonstrating the effectiveness of the proposed method., Comment: 8 pages, 14 figures; to be published in the Proceedings of the IEEE SSCI 2017

This short article presents a summary of the NetSciEd (Network Science and Education) initiative that aims to address the need for curricula, resources, accessible materials, and tools for introducing K-12 students and the general public to the concept of networks, a crucial framework in understanding complexity. NetSciEd activities include (1) the NetSci High educational outreach program (since 2010), which connects high school students and their teachers with regional university research labs and provides them with the opportunity to work on network science research projects; (2) the NetSciEd symposium series (since 2012), which brings network science researchers and educators together to discuss how network science can help and be integrated into formal and informal education; and (3) the Network Literacy: Essential Concepts and Core Ideas booklet (since 2014), which was created collaboratively and subsequently translated into 18 languages by an extensive group of network science researchers and educators worldwide., Comment: 15 pages, 4 figures, 3 tables

A stock market is considered as one of the highly complex systems, which consists of many components whose prices move up and down without having a clear pattern. The complex nature of a stock market challenges us on making a reliable prediction of its future movements. In this paper, we aim at building a new method to forecast the future movements of Standard & Poor's 500 Index (S&P 500) by constructing time-series complex networks of S&P 500 underlying companies by connecting them with links whose weights are given by the mutual information of 60-minute price movements of the pairs of the companies with the consecutive 5,340 minutes price records. We showed that the changes in the strength distributions of the networks provide an important information on the network's future movements. We built several metrics using the strength distributions and network measurements such as centrality, and we combined the best two predictors by performing a linear combination. We found that the combined predictor and the changes in S&P 500 show a quadratic relationship, and it allows us to predict the amplitude of the one step future change in S&P 500. The result showed significant fluctuations in S&P 500 Index when the combined predictor was high. In terms of making the actual index predictions, we built ARIMA models. We found that adding the network measurements into the ARIMA models improves the model accuracy. These findings are useful for financial market policy makers as an indicator based on which they can interfere with the markets before the markets make a drastic change, and for quantitative investors to improve their forecasting models., Comment: 13 pages, 7 figures, 3 tables

This paper aims to establish theoretical foundations of graph product multilayer networks (GPMNs), a family of multilayer networks that can be obtained as a graph product of two or more factor networks. Cartesian, direct (tensor), and strong product operators are considered, and then generalized. We first describe mathematical relationships between GPMNs and their factor networks regarding their degree/strength, adjacency, and Laplacian spectra, and then show that those relationships can still hold for nonsimple and generalized GPMNs. Applications of GPMNs are discussed in three areas: predicting epidemic thresholds, modeling propagation in nontrivial space and time, and analyzing higher-order properties of self-similar networks. Directions of future research are also discussed., Comment: 17 pages, 8 figures, 1 table

We propose a slightly revised Miller-Hagberg (MH) algorithm that efficiently generates a random network from a given expected degree sequence. The revision was to replace the approximated edge probability between a pair of nodes with a combinatorically calculated edge probability that better captures the likelihood of edge presence especially where edges are dense. The computational complexity of this combinatorial MH algorithm is still in the same order as the original one. We evaluated the proposed algorithm through several numerical experiments. The results demonstrated that the proposed algorithm was particularly good at accurately representing high-degree nodes in dense, heterogeneous networks. This algorithm may be a useful alternative of other more established network randomization methods, given that the data are increasingly becoming larger and denser in today's network science research., Comment: 8 pages, 3 figures; to appear in the Proceedings of CompleNet 2018, in press

We propose a new polynomial-time deterministic algorithm that produces an approximated solution for the traveling salesperson problem. The proposed algorithm ranks cities based on their priorities calculated using a power function of means and standard deviations of their distances from other cities and then connects the cities to their neighbors in the order of their priorities. When connecting a city, a neighbor is selected based on their neighbors' priorities calculated as another power function that additionally includes their distance from the focal city to be connected. This repeats until all the cities are connected into a single loop. The time complexity of the proposed algorithm is $O(n^2)$, where $n$ is the number of cities. Numerical evaluation shows that, despite its simplicity, the proposed algorithm produces shorter tours with less time complexity than other conventional tour construction heuristics. The proposed algorithm can be used by itself or as an initial tour generator for other more complex heuristic optimization algorithms., Comment: 8 pages, 2 figures, 3 tables

Calculating a product of multiple graphs has been studied in mathematics, engineering, computer science, and more recently in network science, particularly in the context of multilayer networks. One of the important questions to be addressed in this area is how to characterize spectral properties of a product graph using those of its factor graphs. While several such characterizations have already been obtained analytically (mostly for adjacency spectra), characterization of Laplacian spectra of direct product and strong product graphs has remained an open problem. Here we develop practical methods to estimate Laplacian spectra of direct and strong product graphs from spectral properties of their factor graphs using a few heuristic assumptions. Numerical experiments showed that the proposed methods produced reasonable estimation with percentage errors confined within a +/-10% range for most eigenvalues., Comment: 14 pages, 7 figures; to be published in Discrete Applied Mathematics

Networks have become increasingly relevant to everyday life as human society has become increasingly connected. Attaining a basic understanding of networks has thus become a necessary form of literacy for people (and for youths in particular). At the NetSci 2014 conference, we initiated a year-long process to develop an educational resource that concisely summarizes essential concepts about networks that can be used by anyone of school age or older. The process involved several brainstorming sessions on one key question: "What should every person living in the 21st century know about networks by the time he/she finishes secondary education?" Different sessions reached diverse participants, which included professional researchers in network science, educators, and high-school students. The generated ideas were connected by the students to construct a concept network. We examined community structure in the concept network to group ideas into a set of important themes, which we refined through discussion into seven essential concepts. The students played a major role in this development process by providing insights and perspectives that were often unrecognized by researchers and educators. The final result, "Network Literacy: Essential Concepts and Core Ideas", is now available as a booklet in several different languages from http://tinyurl.com/networkliteracy ., Comment: 21 pages, 8 figures, 5 tables. To appear in Journal of Complex Networks

Cooperation is ubiquitous in biological and social systems. Previous studies revealed that a preference toward similar appearance promotes cooperation, a phenomenon called tag-mediated cooperation or communitarian cooperation. This effect is enhanced when a spatial structure is incorporated, because space allows agents sharing an identical tag to regroup to form locally cooperative clusters. In spatially distributed settings, one can also consider migration of organisms, which has a potential to further promote evolution of cooperation by facilitating spatial clustering. However, it has not yet been considered in spatial tag-mediated cooperation models. Here we show, using computer simulations of a spatial model of evolutionary games with organismal migration, that tag-based segregation and homophilic cooperation arise for a wide range of parameters. In the meantime, our results also show another evolutionarily stable outcome, where a high level of heterophilic cooperation is maintained in spatially well-mixed patterns. We found that these two different forms of tag-mediated cooperation appear alternately as the parameter for temptation to defect is increased., SCOPUS: ar.j, info:eu-repo/semantics/published

We present NetSci High, our NSF-funded educational outreach program that connects high school students who are underrepresented in STEM (Science Technology Engineering and Mathematics), and their teachers, with regional university research labs and provides them with the opportunity to work with researchers and graduate students on team-based, year-long network science research projects, culminating in a formal presentation at a network science conference. This short paper reports the content and materials that we have developed to date, including lesson plans and tools for introducing high school students and teachers to network science; empirical evaluation data on the effect of participation on students' motivation and interest in pursuing STEM careers; the application of professional development materials for teachers that are intended to encourage them to use network science concepts in their lesson plans and curriculum; promoting district-level interest and engagement; best practices gained from our experiences; and the future goals for this project and its subsequent outgrowth., Comment: 10 pages, 1 figure; accepted for publication in the proceedings of CompleNet 2015: The 6th International Workshop on Complex Networks

Describing the dynamics of a city is a crucial step to both understanding the human activity in urban environments and to planning and designing cities accordingly. Here we describe the collective dynamics of New York City and surrounding areas as seen through the lens of Twitter usage. In particular, we observe and quantify the patterns that emerge naturally from the hourly activities in different areas of New York City, and discuss how they can be used to understand the urban areas. Using a dataset that includes more than 6 million geolocated Twitter messages we construct a movie of the geographic density of tweets. We observe the diurnal "heartbeat" of the NYC area. The largest scale dynamics are the waking and sleeping cycle and commuting from residential communities to office areas in Manhattan. Hourly dynamics reflect the interplay of commuting, work and leisure, including whether people are preoccupied with other activities or actively using Twitter. Differences between weekday and weekend dynamics point to changes in when people wake and sleep, and engage in social activities. We show that by measuring the average distances to the heart of the city one can quantify the weekly differences and the shift in behavior during weekends. We also identify locations and times of high Twitter activity that occur because of specific activities. These include early morning high levels of traffic as people arrive and wait at air transportation hubs, and on Sunday at the Meadowlands Sports Complex and Statue of Liberty. We analyze the role of particular individuals where they have large impacts on overall Twitter activity. Our analysis points to the opportunity to develop insight into both geographic social dynamics and attention through social media analysis., Comment: 11 pages, 6 figures

We study a mathematical model of social diffusion on a symmetric weighted network where individual nodes' states gradually assimilate to local social norms made by their neighbors' average states. Unlike physical diffusion, this process is not state conservational and thus the global state of the network (i.e., sum of node states) will drift. The asymptotic average node state will be the average of initial node states weighted by their strengths. Here we show that, while the global state is not conserved in this process, the inner product of strength and state vectors is conserved instead, and perfect positive correlation between node states and local averages of their self/neighbor strength ratios always results in upward (or at least neutral) global drift. We also show that the strength assortativity negatively affects the speed of homogenization. Based on these findings, we propose an adaptive link weight adjustment method to achieve the highest upward global drift by increasing the strength-state correlation. The effectiveness of the method was confirmed through numerical simulations and implications for real-world social applications are discussed., Comment: 7 pages, 3 figures; to appear in Phys. Rev. E

We studied the roles of morphogenetic principles---heterogeneity of components, dynamic differentiation/re-differentiation of components, and local information sharing among components---in the self-organization of morphogenetic collective systems. By incrementally introducing these principles to collectives, we defined four distinct classes of morphogenetic collective systems. Monte Carlo simulations were conducted using an extended version of the Swarm Chemistry model that was equipped with dynamic differentiation/re-differentiation and local information sharing capabilities. Self-organization of swarms was characterized by several kinetic and topological measurements, the latter of which were facilitated by a newly developed network-based method. Results of simulations revealed that, while heterogeneity of components had a strong impact on the structure and behavior of the swarms, dynamic differentiation/re-differentiation of components and local information sharing helped the swarms maintain spatially adjacent, coherent organization., Comment: 8 pages, 2 figures, 1 table; accepted for publication in ALIFE 14 proceedings

Recent research has established both a theoretical basis and strong empirical evidence that effective social behavior plays a beneficial role in the maintenance of physical and psychological well-being of people. To test whether social behavior and well-being are also associated in online communities, we studied the correlations between the recovery of patients with mental disorders and their behaviors in online social media. As the source of the data related to the social behavior and progress of mental recovery, we used PatientsLikeMe (PLM), the world's first open-participation research platform for the development of patient-centered health outcome measures. We first constructed an online social network structure based on patient-to-patient ties among 200 patients obtained from PLM. We then characterized patients' online social activities by measuring the numbers of "posts and views" and "helpful marks" each patient obtained. The patients' recovery data were obtained from their self-reported status information that was also available on PLM. We found that some node properties (in-degree, eigenvector centrality and PageRank) and the two online social activity measures were significantly correlated with patients' recovery. Furthermore, we re-collected the patients' recovery data two months after the first data collection. We found significant correlations between the patients' social behaviors and the second recovery data, which were collected two months apart. Our results indicated that social interactions in online communities such as PLM were significantly associated with the current and future recoveries of patients with mental disorders., Comment: 20 pages, 5 figures, 5 tables; accepted for publication in PeerJ

The Ultimatum Game (UG) is an economic game where two players (proposer and responder) decide how to split a certain amount of money. While traditional economic theories based on rational decision making predict that the proposer should make a minimal offer and the responder should accept it, human subjects tend to behave more fairly in UG. Previous studies suggested that extra information such as reputation, empathy, or spatial structure is needed for fairness to evolve in UG. Here we show that fairness can evolve without additional information if players make decisions probabilistically and may continue interactions when the offer is rejected, which we call the Not Quite Ultimatum Game (NQUG). Evolutionary simulations of NQUG showed that the probabilistic decision making contributes to the increase of proposers' offer amounts to avoid rejection, while the repetition of the game works to responders' advantage because they can wait until a good offer comes. These simple extensions greatly promote evolution of fairness in both proposers' offers and responders' acceptance thresholds., Comment: 14 pages, 3 figures

Social contagion has been studied in various contexts. Many instances of social contagion can be modeled as an infection process where a specific state (adoption of product, fad, knowledge, behavior, etc.) spreads from individual to individual through links between them. In the meantime, other forms of social contagion may better be understood as a diffusion process where the state of an individual tends to assimilate with the social norm (i.e., local average state) within his/her neighborhood. Unlike infection scenarios where influence is nonlinear, unidirectional, fast, and potentially disruptive, social diffusion is linear, bidirectional, gradual, and converging. The distance between an individual's state and his/her neighbors' average state always decreases, and thus a homogeneous global state is guaranteed to be the network's stable equilibrium state in the long run. This does not sound as intriguing or exciting as infection dynamics, which might be why there are very few studies on mathematical models of social diffusion processes. Here, this study attempts to shed new light on an unrecognized characteristic of social diffusion, i.e., non-trivial drift it can cause to the network's global average state. Although somewhat counterintuitive, such global drift is indeed possible because, unlike physical diffusion processes, social diffusion processes are not conservational. In what follows, a mathematical model of social diffusion will be presented to explain the mechanism of this phenomenon, and some possible collective actions for influencing the direction of global drift will be proposed. The relevance of social diffusion to individual and collective improvement will be discussed briefly, with an emphasis on educational applications.

The nature of concept learning is a core question in cognitive science. Theories must account for the relative difficulty of acquiring different concepts by supervised learners. For a canonical set of six category types, two distinct orderings of classification difficulty have been found. One ordering, which we call paradigm-specific, occurs when adult human learners classify objects with easily distinguishable characteristics such as size, shape, and shading. The general order occurs in all other known cases: when adult humans classify objects with characteristics that are not readily distinguished (e.g., brightness, saturation, hue); for children and monkeys; and when categorization difficulty is extrapolated from errors in identification learning. The paradigm-specific order was found to be predictable mathematically by measuring the logical complexity of tasks, i.e., how concisely the solution can be represented by logical rules. However, logical complexity explains only the paradigm-specific order but not the general order. Here we propose a new difficulty measurement, information complexity, that calculates the amount of uncertainty remaining when a subset of the dimensions are specified. This measurement is based on Shannon entropy. We show that, when the metric extracts minimal uncertainties, this new measurement predicts the paradigm-specific order for the canonical six category types, and when the metric extracts average uncertainties, this new measurement predicts the general order. Moreover, for learning category types beyond the canonical six, we find that the minimal-uncertainty formulation correctly predicts the paradigm-specific order as well or better than existing metrics (Boolean complexity and GIST) in most cases., Comment: 27 pages, 7 tables, 1 figure. Accepted for publication in Journal of Mathematical Psychology, in press

We report a summary of our interdisciplinary research project "Evolutionary Perspective on Collective Decision Making" that was conducted through close collaboration between computational, organizational and social scientists at Binghamton University. We redefined collective human decision making and creativity as evolution of ecologies of ideas, where populations of ideas evolve via continual applications of evolutionary operators such as reproduction, recombination, mutation, selection, and migration of ideas, each conducted by participating humans. Based on this evolutionary perspective, we generated hypotheses about collective human decision making using agent-based computer simulations. The hypotheses were then tested through several experiments with real human subjects. Throughout this project, we utilized evolutionary computation (EC) in non-traditional ways---(1) as a theoretical framework for reinterpreting the dynamics of idea generation and selection, (2) as a computational simulation model of collective human decision making processes, and (3) as a research tool for collecting high-resolution experimental data of actual collaborative design and decision making from human subjects. We believe our work demonstrates untapped potential of EC for interdisciplinary research involving human and social dynamics., Comment: 20 pages, 7 figures, 1 table (Supplemental materials not included)