Next Article in Journal
SINR- and MI-Based Double-Robust Waveform Design
Previous Article in Journal
Multi-Task Learning for Compositional Data via Sparse Network Lasso
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Evidence of Critical Dynamics in Movements of Bees inside a Hive

Embodied Cognitive Science Unit, Okinawa Institute of Science and Technology Graduate University, Okinawa 904-0495, Japan
*
Author to whom correspondence should be addressed.
Entropy 2022, 24(12), 1840; https://doi.org/10.3390/e24121840
Submission received: 25 October 2022 / Revised: 14 December 2022 / Accepted: 15 December 2022 / Published: 17 December 2022
(This article belongs to the Special Issue Statistical Physics of Collective Behavior)

Abstract

:
Social insects such as honey bees exhibit complex behavioral patterns, and their distributed behavioral coordination enables decision-making at the colony level. It has, therefore, been proposed that a high-level description of their collective behavior might share commonalities with the dynamics of neural processes in brains. Here, we investigated this proposal by focusing on the possibility that brains are poised at the edge of a critical phase transition and that such a state is enabling increased computational power and adaptability. We applied mathematical tools developed in computational neuroscience to a dataset of bee movement trajectories that were recorded within the hive during the course of many days. We found that certain characteristics of the activity of the bee hive system are consistent with the Ising model when it operates at a critical temperature, and that the system’s behavioral dynamics share features with the human brain in the resting state.

1. Introduction

Social insects are capable of creating and supporting sophisticated modes of spatial organization; furthermore, they possess the ability for decision-making at the colony level. What is the basis of this collective cognitive capacity? Several lines of research seek to elucidate what traits are shared by entities capable of such adaptive behavior, regardless of whether their mode of operation is individual or collective [1]. For the case of individual animals, a prominent conjecture conceived through the cross-pollination of statistical physics and experimental neuroscience is known as the “Critical brain hypothesis”. It holds that the remarkable adaptive abilities of neural systems require them to be poised in the vicinity of the critical state, because in this way, the system has access to the widest repertoire of dynamic patterns. This claim is supported by a notable amount of experimental data, recorded both in vitro and in vivo. At the same time, there is evidence that some collective entities such as swarms of midges and flocks of birds exhibit hallmarks of the critical state at the collective level [2,3,4]. However, a comprehensive assessment of criticality was not carried out for any of the major types of eusocial insects, such as ants, bees, and termites. Recent advances in scientific image acquisition and analysis techniques now allow for recording trajectories of individual insects [5]. In our work we analyzed a dataset of honey bee trajectories, focusing on the hallmarks of the critical state.

1.1. Smarts in Numbers—Collective Intelligence

Eusocial insects’ abilities in foraging [6], enacting complex spatial arrangements of their bodies [7,8] and creating elaborate nesting structures are well known. Furthermore, they can handle making decisions on a more abstract level. For example, a honey bee colony produces a daughter colony when the original site becomes overcrowded [9]. The choice of nest site depends on a number of parameters and an erroneous decision could lead to the inevitable demise of the colony. Thus, when swarming, bees aggregate themselves into a cluster, usually in a form of penchant hanging from a tree brunch. Then, the collective considers information brought by scout bees about the relative quality of the nearby locations. The swarm evaluates the merits of the proposed locations and makes the choice which is then followed through unanimously, in the overwhelming majority of cases. Everyday functioning of the colony also requires the handling of information to optimize foraging and allocate tasks for individual bees.
Ants display similarly complex behavior on the colony level. They are using cooperation to extend their sensing range [10] and engage in complex physical tasks, such as transporting heavy objects or building elaborate structures. Furthermore different colonies demonstrate distinct differences in behavioral patterns across several behavioral traits, thus having a degree of “collective personality”, which affects their evolutionary fitness [11].
At an abstract level of description, the mechanisms of collective decision-making share common features with the mechanisms of cognition within the brain [1]. Famous entomologist Thomas D. Seeley [9] noted in his book remarkable similarities between the way in which a honeybee swarm performs the task of making a decision for a new nest site and the activity of a primate brain during a perceptual discrimination task. In both cases, the correct decision is acquired through the non-linear aggregation of activity of individual constituents of the system. Other studies showed [12] that bee colonies adhere to the same psychophysical laws that humans do when making decisions while facing varied and conflicting sources of information.
A fundamental organizing principle shared by the brain and eusocial insects is that all forms of behavior and cognitive ability arise from the local interactions between the system’s elements, be it insects or neurons, and does not need to be explicitly organized with a blueprint or central pacemaker of some sort.

1.2. Critical Brain Theory

In the neuroscience field, it has been conjectured that healthy brains are poised in the vicinity of second-order phase transition [13,14,15,16]. Unlike the more familiar case of first-order transition, exemplified by the freezing of water, the second-order transition does not have a sharp boundary separating the two phases. In the vicinity of the critical point, both states of matter could coexist and the system displays a set of remarkable characteristics: most notably, long-range correlations link distant locations, and events of all scales could occur in the system [17].
Recordings of Local Field potentials (LFPs) from cortical slices [18], as well as an analysis of neural data of different modalities, including EEG, MEG, and fMRI [19,20], showed that both the isolated neural tissue and the intact functioning brains exhibit statistical properties characteristic of the system in the critical state. Most importantly, the size of fluctuations in the system scales abides by the power-law scaling, making events of all sizes possible, long-range correlations exist in both temporal and spatial domains, and activity patterns exhibit complexity and variability, significantly exceeding what would be expected by random chance. Furthermore, research in the field showed that such a state might be not epiphenomenal (i.e., consequent of but not causal to), but necessary to maintain the brain’s functionality [15].
This view, which became known as the “critical brain theory”, conjectures that the critical state of the system underlies its key functionality, including its ability to produce a wide range of emergent configurations of activity. Emergent behavior is paramount for an adaptive system, as it underlies its ability to produce a multitude of responses without altering the underlying structure.
It has been established that in the vicinity of the critical point, the system has the widest repertoire of dynamic patterns emerging from local interactions only [21]. A body of evidence, accumulated through computational models and experiments with cortical slices, shows that critical state neural networks are best suited for complex computation. Information transmission, integration [22], and representation [23] are optimal, and dynamic range is maximized [24], allowing for the networks to respond to a wide range of stimuli. These findings are corroborated by medical research showing that deviations from criticality are correlated with suboptimal mental states in humans [25].

1.3. Evidence for Criticality in Collective Behavior

Evidence of criticality and its implications discussed above in Section 1.3 applies mostly to mammalian brains. As we argue in Section 1.1, insect communities, despite having little structural resemblance to the brain, share the same burden of navigating the world and making choices crucial to survival.
The universality of physical laws implies that different systems could be described with the same set of basic laws. At the same time, principles of convergent evolution make it possible that similar phenomena could come to be in unrelated species if they are advantageous to survival. Given the benefits that the critical state confers to the adaptive ability of the systems, it is fitting to conjecture that swarms and colonies of collective insects would evolve to be positioned in its vicinity [4,26]. Investigations of brains’ critical phenomena focus on analyzing patterns of electric signals (EEG, LFP, MEG) or alternatively using proxy metrics for brain activity (fMRI). Animal collectives use many modes of interaction to exchange information and synchronize actions within the group, including vocal cues, movements, and phenomenal signals. Previous research we reviewed assumes, unanimously, that the spatial and temporal scale at which critical phenomena would presumably be exhibited by such systems makes the movement patterns, correlations, and derivatives thereof the best venue for analysis.
Recent research showed that critical phenomena are observable in flocking birds [2] and swarming of midges [3,27]. Long-range velocity correlations underlie the astonishing ability of these creatures to maneuver collectively with the synchronicity of one. Cursory evidence exists to suggest that ants make use of enhanced coordination between individuals conferred by criticality to maximize the load-carrying capacity of a group [28] and optimize forage route allocation [29].

2. Materials and Methods

2.1. Bee Data

All bee data analyzed in this paper were provided by Professor G. Robinson and his team. Their recent paper explains the nuances of the methods [5]. To summarize briefly: five recording sessions, henceforth refereed to as trials, were conducted, during each, a different colony of 1200 worker bees was recorded for several days and nights. Insects were marked with barcodes attached to the thorax. Colonies resided in the rectangular hives which had video cameras installed inside. Barcodes enabled tracking of the positions of individual insects. Several days and nights of activity were recorded for each colony. For the first two days and two nights of each trial, hives were kept sealed and supplied with the necessary nutrients. Afterward, bees were allowed to leave at will to scout and forage.
The raw dataset contained IDs and coordinates accompanied by UNIX timestamps. We developed a prepossessing pipeline using linear interpolation to re-sample individual trajectories at uniform time intervals. Data were partitioned into day and night intervals. Inactive bees, for which it was impossible to reconstruct the trajectory accurately, were filtered out. During our analysis, we focused on the solar days when bees were sealed inside the hive, assuming that such a condition is similar to the resting state of the brain.
For each insect, we compute its kinetic energy from the horizontal and vertical displacement over time (1). Such an approach was first implemented [30] to identify bursts of activity in bee hives. It should be noted that the purpose of computing kinetic energy is that it provides a convenient proxy to measure the change in activity over time, such that physically, more rigorous details such as accounting for the mass of each bee, could be omitted. Figure 1 illustrates example trajectories and their kinetic energy is computed. To characterize the activity of a hive as a whole, mean kinetic energy K m e a n is computed according to (2).
K b e e ( t ) = Δ x 2 + Δ y 2
K m e a n ( t ) = i = 1 n K i

2.2. The Ising Model

The Ising model was originally developed to describe ferromagnetism; however, it has been successfully implemented to model disparate phenomena, ranging from statistical physics to economics [31]. Its relevance to our research is that when the spatial dimensions of the model exceed 1, then the system could undergo phase transition and exhibit critical behavior (the one-dimensional Ising model could exhibit critical behavior, however, phase transition is impossible in the 1d system). In our work, we used a two-dimensional model on the toroidal grid. It consists of a square lattice with sides of length L composed of N = L × L sites with the nearest-neighbor interactions. Each site has an associated binary “spin” variable s i = ± 1 . Lattice configuration is uniquely specified by a sequence of spin variables. For a system-level description of the model, its order parameter—Magnetisation (3), which corresponds to the mean spin of the model, is computed. The energy of different lattice configurations in the absence of an external magnetic field is given by the Hamiltonian function (4), where J represents interactions between different lattice sites.
M = 1 N i = 1 N s i
E = J i , j = n n ( i ) N s i s j
Neighboring spins tend to align with each other, where the probability of alignment is controlled by the temperature parameter T. Competition between thermal fluctuations, which induce stochastic behavior, and the nearest-neighbor interactions, which pull the system towards a more ordered state, governs the dynamics of the model. At low temperatures T = T l o w , the system soon finds itself in a quiescent state. High temperature T = T h i g h causes uncorrelated, random activity. In the vicinity of the critical point, T T c r i t the system exhibits a multitude of critical phenomena, such as long-range temporal and spatial correlations and complex patterns of activity.
We implemented the Metropolis Monte Carlo algorithm [32] to solve the equilibrium configuration of the model. Details of the algorithm are given in the Appendix A.1. Each step of the algorithm consists of N site updates. Initially, the system is allowed to settle into an equilibrium state. During this process, known as thermalization, no recordings are taken. In our implementation, this stage lasts 10,000 steps. Then, 2000 consecutive configurations of the model, separated by one step of the algorithm, are recorded. We used 3 Ising models of size N = 10 , 000 with their T parameter set, respectively, at T l o w = 2.0 , T c r i t = 2.3 and T h i g h = 3.0 .
It should be noted that the critical temperature for the Ising model in 2 dimensions has been computed analytically [33]; however, the exact solution T c r i t 2.2691 is only valid at the thermodynamic limit when the infinite lattice is considered. In numerical simulations with finite systems, an approximate critical temperature T c r i t = 2.3 is used.
We have tested models of different N, obtaining qualitatively similar dynamics. Statistical tools that we implemented to characterize the dynamics of the model dictate that a system with large N, as specified above, has to be used to obtain reliable estimates of parameters.

2.3. Dynamic Correlations

Our approach of constructing graphs of dynamic correlations to compare unrelated systems from a statistical standpoint was influenced by a seminal paper [19] that used such an approach to compare brain dynamics inferred from resting state fMRI recordings with the Ising model at different temperatures. Thus, we tried to keep methodological consistency whenever it was possible. It should be understood that no direct correspondence between the structure of the Ising model and that of the honeybee colony is implied. The Ising model was used in our research solely as a vehicle to simulate critical phenomena: we believe that the systems we compared are so disparate that under normal circumstances, no statistically significant similarities would be found in their dynamics. Consequently, when such similarities are evident, then they are indicative of the critical phenomena present in both systems, not of the structural similarity between them.
To construct correlation networks, we treated each site of the Ising model and each bee as a node, while edges were inferred from correlations between the activity of different nodes (i.e., either between the kinetic energy time-series of individual bees or between the time-series of spins of different lattice sites of the Ising Model). Correlations were computed using Pearson’s correlation r coefficient (5), which captures the degree of linear correlation between the two time-series. Nodes were connected with edges when correlation exceeds some predefined threshold p. It is noteworthy that r is high only if both time-series exhibit similar dynamics, fluctuating from their respective mean values in a coordinated manner. For a pair of quiescent or stochastic time-series, r would be similarly low.
r ( x , y ) = E [ ( x μ x ) ( y μ y ) ] σ ( x ) σ ( y )
A meaningful way to compare networks that have very different provenance is to scan a range of p values for each of the networks at hand, while simultaneously computing networks’ average degree k . Then, comparisons could be made between networks of similar k . Figure 2 illustrates this approach for Ising networks at 3 different temperatures and for the network derived from the correlations between the kinetic energy time-series of bees during 1 day. The exemplifying case of k 60 is used.
After constructing correlation networks for different systems, we investigated their degree distributions and other network metrics. The crucial step was to assess if the degree distribution of the system follows power-law. It has been brought up by the statistical community [34] that often methods used to characterize power-law relationships do not stand up to mathematical scrutiny. Conclusions on the nature of distribution based on examining the shape of the distribution or fitting data points with linear regression are often erroneous. The most reliable approach is to use maximum-likelihood to estimate the parameters of the distribution [35] and compare candidate power-law to other common heavy-tailed distributions. We followed the aforementioned methodology in our research; some nuances and supplementary information are contained in the Appendix B.2.

2.4. Temporal Analysis

Correlation-based network analysis elucidates the degree of correlation between time-series of different nodes. However, previous research concerning both neurological recordings [36] and computational models [37] which are known to exhibit critical behavior showed that such time-series exhibit significant autocorrelations—patterns of activity at one timestep significantly influence activity at a lagged time interval. An established method to quantitatively characterize the degree of autocorrelation in the time-series is the Hurst exponent H [38].
It is a scalar metric that ranges from 0 to 1. For random walks and patterns of the Brownian motion, in which successive timesteps are completely independent, H 0.5 . Such processes are called memoryless. Values of H close to 1 imply significant positive autocorrelations in the data, while values of H between 0 and 0.5 imply a negative autocorrelation.
Several approaches to computing H all have different pros and cons. We adapted a simplified methodology initially developed for stock market analysis [39] and rigorously tested our implementation on synthetic data. We transformed the mean kinetic energy time-series K m e a n ( t ) into the time-series of cumulative deviations from the mean value μ k using (6).
K s u m ( t ) = i = 1 i = t K i m e a n μ k
Subsequently, for all elements of the transformed series, we computed variance between elements at time t and time t + τ for a sequence of lags τ .
V a r ( τ ) = ( K t + τ s u m K t s u m ) 2
For the Brownian motion and other memoryless processes, variance was linearly dependent on lag: V a r ( τ ) τ . However, when autocorrelations were present, this relation acquired an anomalous exponent: V a r ( τ ) τ H . We computed H by solving for the relation between l o g ( V a r ( τ ) ) and log ( τ ) .

3. Results

3.1. Model Graphs

Figure 3 depicts degree distributions of correlation networks created using the Ising model at 3 different temperatures as well as an illustrative degree distribution for the correlation network computed using the kinetic energy time-series of bees recorded during one solar day. Earlier work used an analogous approach to compare fMRI correlation networks with the Ising model at T = T c r i t [19].
Several methods have been used to analyze criticality in neural data. We chose to use the network approach for our initial test for a number of reasons. Firstly, unlike fMRI voxels or neurons, bees could move freely inside the hive. Thus, methods which rely on measuring spatially localized activity, for example, the local field potentials in different areas of the neural tissue, would be challenging to apply to the bee data. Using correlations between the kinetic energy time-series of individual bees allowed for us to circumvent this difficulty, while still generating results compatible with the Ising model.
From Figure 3, it is evident that the degree distribution of the Ising model at the critical temperature and degree distribution of the bee correlation matrix share a similar long-tailed structure, regardless of the mean degree chosen for comparison. In contrast, at T = l o w and T = T h i g h , the Ising model has a strikingly different degree distribution. We chose to display only one day’s worth of kinetic energy measurements, yet we analyzed multiple days from different trials and acquired similar degree distributions for all of them. This full set of results is presented in Appendix Figure A2.
Besides these striking visual similarities, several key statistical characteristics are shared by the Ising model and the bee hive in the vicinity of the critical point, but are notably absent when T = T l o w or T = T H i g h . As shown in Table 1, the Ising model at T = T c r i t is best described by a power-law distribution, while at low and high temperatures, the best fit for the data is a log-normal distribution. Different power-law exponents, as well as the different numbers of nodes, explain the somewhat different shape of degree distribution for the Ising model at T = T c r i t and the bee hive; however, general features of heavy-tailed distributions are evident in both cases.

3.2. Network Metrics

Networks can be characterized by a number of other metrics, which account not only for the number of edges per node but also for the intertwined structure of the connections. Table 2 presents the most common [40] metrics computed for the correlation networks of the Ising model and different bee hives recorded during the experiment. Thresholds are set for all networks to have similar mean degrees. Additional information about the metrics we used is given in Appendix A.2 and supplementary tables describing the same networks with different thresholds and different mean degrees are available in Appendix A.2.
In order to compute characteristics such as average path length L, it is necessary for the network to be fully connected. Bee correlation networks have a significant number of isolated nodes, although the majority of nodes always belong to an interconnected component of significant size, regardless of the threshold value. The Ising model always remains fully connected at T = T l o w and T = T h i g h . Interestingly, isolated sub-graphs begin to appear in the network at T = T c r i t when threshold p is set to a higher value.
We extracted the largest component from the networks and used it to compute the metrics. Thus, k can vary within reasonable limits. A common technique in the study of networks is to compare the network at hand with a random graph [40]. For each of the networks, we created an ensemble of equivalent random Erdős–Rényi graphs and computed their average characteristics as a reference.
It can be noted that the correlation networks of the bee hive and of the Ising model at the critical temperature have much higher average clustering C than both their random equivalents and the correlation networks of Ising model at low and high temperatures. The average path length L in these clustered networks is generally somewhat higher than in the random networks, but considerably lower than if the graph had been a regular lattice with high clustering. Such a graph structure, which combines high clustering characteristics of lattice-like networks with a relatively low average path length of random graphs is known as the small-world network [41].

3.3. Temporal Correlations

As noted earlier, the critical state manifests itself not only through spatial correlations but also in increased autocorrelations within the time-series. We computed the Hurst exponent H to assess the presence of autocorrelations. High values of H imply that the system which generated the time-series is in the vicinity of the critical state. The mean magnetization M time-series of the Ising model is characterized by a high value of H only when T is close to T c r i t [37]. A common technique is to compare the time-series generated by the system of study with another time-series generated by a computational model which is known to exhibit critical behavior. For example, such a technique was used to show that temporal patterns of blackouts in the USA exhibit characteristics of the critical state [42].
Figure 4 exhibits different Hurst exponents computed for the Ising model at different temperatures, and an exemplifying case of the Hurst exponent computed for the K m e a n of the bee hive during a single solar day. H computed for other days shows only minor differences and each H value is always significantly higher than 0.5. This is indicative of long-term correlations within the time-series. As a sanity check we also computed H for randomly permuted mean kinetic energy time-series and, as it would be expected of essentially random data, we found that H 0.5 . The Ising model only displays high H values at T = T c r i t , which is consistent both with previous research on the model and with the established connection between autocorrelations and criticality [37,42].

4. Discussion

4.1. Key Finding and Their Implications

In our work, we analyzed a dataset of bee trajectories in a way that allowed us to compare empirical data to a well-studied model. Such an approach has been previously used (e.g., [19]) to show that key dynamical characteristics of the human brain at its resting state exhibit a notable resemblance to the Ising model when the latter is in the vicinity of the critical state. Long-range temporal autocorrelations are also considered a hallmark of criticality in the Ising model and the neural time-series [43]. With some minor differences, which are to be expected given the different nature of the data, our analysis of bee correlation networks yielded remarkably similar results, namely similarity to the Ising model at T = T c r i t and lack thereof at low and high temperatures.
First, our observations are confirmed by the rigorous statistical analysis of the degree distributions. Second, the analysis of the correlation networks showed that certain characteristics, most notably clustering and path length, are comparable between the network of bee correlations and critical state of the model, but are drastically different otherwise. Third, analysis of the mean parameters K m e a n and M showed that recordings of the average activity of both the bee hive and the Ising model at critical states are marked with considerable autocorrelations within the time-series.
These similarities in the dynamics of the systems become even more noteworthy when we consider that in structural terms, both the Ising model and the human brain are drastically different from the bee hive. In the context of our analyses, differences in spatial structure are particularly important. The two-dimensional Ising model possesses only nearest-neighbor interactions, while the human brain is characterized by intricate connection patterns on the macro and micro levels. Although correlation networks are obtained solely from dynamics, one would expect them to be strongly influenced by the underlying spatial structure. The bee hive is quite different because the nodes of its correlation matrix represent agents largely unhindered by constraints in movement and interaction. Despite these dissimilarities, functional constraints on behavior are shared by the systems in question to a degree that precludes the appearance of dynamical similarities by mere chance. We believe that they signal a shared systemic property—the critical state, whose influence on the systems’ dynamics goes beyond specific structural constraints.
One potential concern with our comparative analysis is the choice of running the Ising model on a 2D grid, thereby imposing a local interaction constraint on the system. Alternatively, we could have implemented the model on a complete graph, in which all lattice sites are connected. Intuitively, that might seem a better approximation of the bee hive, with highly mobile agents. Empirical research and modeling studies of flocks and schools have demonstrated that in such systems, an ubiquitous strategy of the individual agents is to align their behavior with that of the nearby neighbors [44,45,46]. Information, however, could propagate through the whole system seemingly unencumbered by the prevalence of local connections. Such behavior is a clear mark of critical state. We do not have definitive information that bees follow such an alignment pattern inside the hive, yet the remarkable ability of the 2D Ising model with only local interaction to emulate a high-level description of bee hive dynamics, implies that a similar mechanism could be in play.

4.2. Critical Brains and Critical Swarms

Our results provide evidence in support of what we could call a “critical colony” hypothesis. As we had summarized earlier in Section 1.2, being in a critical state provides benefits to a system’s cognitive ability, to an extent that it can be argued that such a state is not simply advantageous, but even necessary. At the same time, there are convincing arguments in Section 1.1 for the claim that social insects are endowed with a sort of collective cognitive capacity, which, despite their entirely different mode of organization, shares key similarities with the capacities of vertebrate brains. Thus, we suggest that the benefits that the critical state brings would be desirable characteristic for both of these systems.
Previous research showed that hallmarks of the critical state are observable in swarming midges [3] and flocking birds [2]. Moreover, previous research on the same bee dataset found that the time-series of the K m e a n of the bee hive exhibits bursts of activity, significantly exceeding the average level, which is interspersed with quiescent periods [30]. The distribution of waiting times between these bursts abides by the power-law distribution. The authors did not discuss criticality as such, but it is noteworthy that this kind of distribution is also found to be the case for “avalanches” in the Back–Wisenfield sandpile model, a famous model of self-organized criticality [47], and for the patterns of the neural activity recorded in the cortical slices of mice [18] in vitro.
One of the benefits of the critical state in neural networks is that it enables an easier spread and integration of information. Our findings show that the correlation graphs of bee activity exhibit distinct small-world structures and contain hubs—nodes with exceptionally high degrees. A similar organization emerges in the Ising model when T = T c r i t . Such network properties are also known to enhance the integration of information and facilitate the spreading of signals. In the human brain, there is a similar structural organization of cortical wiring [48,49]. The bee hive and the critical Ising model lack such structural constraints, yet their functional connectivity is remarkably similar. Uncovering such network structures in the functional correlations of the bees suggests that this type of organization is not only ubiquitous in the brain but is fundamental to the functionality of any cognitive system.
It is worth highlighting important differences between our work and the corpus of research that concerns hallmarks of criticality in the swarm dynamics, as well as with the studies employing tools of network science to study eusocial insects [5,50]. The most notable dissimilarity with the latter is that most studies focused on social networks, constructed by observing species-specific means of communication, such as trophallaxis in bees and attenuation in ants. Such contacts, important as they are, only constitute a fraction of individuals’ total activity, and they arguably account only for a portion of the total informational exchange that takes place inside the colony. Significant correlations between the kinetic energy time-series of individuals and highly specific degree distributions of the correlation graph, in our view, reflect features of the social system underlying collective cognition in the hive, aided by its critical state.
Hallmarks of critical behavior in collective entities, when studied empirically, were investigated in freely-moving agents: flocking birds or swarming midges. Thus, it is possible to argue that observed features, such as long-range velocity correlations, were begotten by the spatial order the organisms maintained and are transient in nature.
The movement data we analyzed were acquired when bees were locked inside the hive and provided with sustenance. They were under no pressure to maintain a specific movement order, as they would have been during swarming, or to move at all, in fact. Given these conditions, it is plausible that the hallmarks of the critical state revealed by our analysis would be observed only if such a state is inherent to the system, much like it is to the human brain at its resting state. Indeed, brain resting-state networks have been proposed to reflect a process of “constant inner state of exploration” that optimizes the system for a given impending input, thus influencing perception and cognitive processing [51,52]. It is exciting to consider the possibility that the colonies of eusocial insects exhibit a similar process.

5. Conclusions and Future Work

Our findings indicate that the honey bee colony inside the hive is a critical system. However, further work is required to ascertain the generalized conjecture that colonies of eusocial insects are critical in support of collective cognition. It is crucial to analyze other datasets to confirm that hallmarks of the kind we observed are ubiquitous across bee species and to analyze other eusocial insects, such as ants and termites. Other computational models of the critical state, such as the Ising model on a complete graph or the XY model with continuous spin dynamics [17] could also be compared with empirical data. Moreover, criticality manifests itself on different levels. We focused on temporal and spatial correlations; however, other aspects, for example the behavior of the system during coarse-graining, should also be considered. Another interesting direction for future research is to explore how the critical state is related to the hives’ normal daytime activity, such as foraging and swarming, as well as how it is modulated by environmental factors, for example by the day–night cycle. If our hypothesis is on the right track, we should find that increased evidence of criticality in the hives’ resting state is associated with improved collective decision making, such as more efficient foraging behavior.
Comparing high-level descriptions of different systems could shed light on general dynamical patterns of cognitive systems that are imperceptible when the focus is too narrow. Analysis of system-level properties such as criticality is a particularly promising approach in this regard. However, much ink has been spilled by some of the best scientific minds in debating the validity of the critical brain hypothesis and the debate is still not settled [53]. Evidence from other fields, such as provided here, could tip the scales in this debate toward a more widespread acceptance.

Author Contributions

Both authors contributed to the conceptualization of the research, I.S. analyzed the data and wrote the first version of the manuscript, both authors contributed to finalizing the article. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data for this study were provided by the third party.

Acknowledgments

We thank Gene Robinson and his team for sharing the dataset used in our research.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
FMRIFunctional magnetic resonance imaging
EEGAn electroencephalogram
LFPLocal field potentials

Appendix A. Algorithms and Metrics

Appendix A.1. Monte-Carlo Algorithm

Metropolis Monte-Carlo Algorithm is commonly used to computationally solve for the equilibrium configuration of the Ising model. This approach assumes that the system is submerged in the heat bath of temperature T. Steps of the algorithm are summarized below.
  • Initialize the model with random configuration of spins.
  • Select random site and flip its spin.
  • Compute the energy of the new configuration using (4), than compute energy difference with the previous configuration δ E = E n e w E o l d .
  • If δ E 0 accept the change.
  • Otherwise, if δ E > 0
    i
    Compute transition probability w = e δ E k T .
    ii
    Generate a random number r in the unit interval.
    iii
    Accept the change if r w .
  • Return to step 1.

Appendix A.2. Network Metrics

To concisely characterize network topology, several common metrics are used [40]. Clustering quantifies the propensity of nodes in the network to cluster together i.e., how likely it is that neighbors of a node would also be connected amongst each other. For a graph G described by an adjacency matrix A, local clustering coefficient C i can be computed using Equation (A1), and average clustering C is simply the mean (A2) of the local clustering coefficients for each node of the network.
C i = 1 k i ( k i 1 ) j , k A i j A j k A k i k i d e g r e e o f a n o d e
C = 1 n i = 1 n C i
The average path length is the mean number of steps required to traverse from one node to another. If the shortest distance between any two nodes, v i and v j , is defined as d ( v i , v j ) , then the average distance for all possible pairs on nodes in the networks could be computed using (A3).
L = 1 n ( n 1 ) i j d ( v i , v j )
In our work, we computed all possible short paths using Dijkstra’s algorithm and then found an average L for the whole network. The final metric we used was the diameter of the network D, which is equal to the longest possible short path.

Appendix B. Supplementary Data

Appendix B.1. Supplementary Graphs

Figure A1. Histogram of degree distributions for the Ising model at different temperatures, as well as for the correlation network of the bee hive. Data presented in this graph are identical to Figure 3, however, logarithmic binning is used.
Figure A1. Histogram of degree distributions for the Ising model at different temperatures, as well as for the correlation network of the bee hive. Data presented in this graph are identical to Figure 3, however, logarithmic binning is used.
Entropy 24 01840 g0a1
Figure A2. Degree distribution for correlation networks. Panels (ad) depict different trials using different hives. Methods used to generate the depicted degree distributions are identical to those used to produce Figure 3.
Figure A2. Degree distribution for correlation networks. Panels (ad) depict different trials using different hives. Methods used to generate the depicted degree distributions are identical to those used to produce Figure 3.
Entropy 24 01840 g0a2
Figure A3. Illustrative images depicting the bee correlation network and equivalent random network. Mean degrees k and average clustering coefficients C are given below each image pane. Low mean degrees, and thus, sufficiently high threshold values have been used for clarity of visualization.
Figure A3. Illustrative images depicting the bee correlation network and equivalent random network. Mean degrees k and average clustering coefficients C are given below each image pane. Low mean degrees, and thus, sufficiently high threshold values have been used for clarity of visualization.
Entropy 24 01840 g0a3

Appendix B.2. Log-Likelihood Tables

Fitting a power-law to an empirical distribution is a task that requires due caution. The most rigorous approach developed requires comparing hypothetical power-law fit with other candidate long-tailed distributions [34]. Most important of them is the exponential distribution; however, log-normal and stretched exponential (Weibull) should also be considered. Furthermore, using different thresholds to binarise the correlation matrices could also affect the characteristics of resultant degree distribution. Thus, to provide a comprehensive view of our analysis below, we present the table of log-likelihood tests for the different datasets used in our work.
Log-likelihood Table A1, Table A2, Table A3 and Table A4 summarize the results of the statistical tests for different systems thresholding at various mean degrees. Each case is tested against three candidate distributions: exponential, log-normal and Weibull. Possible log-normal distributions are restricted to those with positive mean m u , otherwise, one would have to assume the possibility of a node having a negative degree. For each test, two values are generated: log-likelihood and p-value p. > 0 implies that the power-law distribution is preferred, < 0 signifies that another candidate distribution provides a better fit to the data. p indicates the statistical significance of the uncovered relationship. Careful examination of the provided summary tables allows us to conclude that although in some cases the Ising model at T = T l o w could exhibit a power-law relationship, in the overwhelming majority of cases, such a relationship exists only in the vicinity of the critical point of the Ising model. A similar summary judgment illuminates the presence of clear power-law scaling in the degree distribution of bee correlations.
Table A1. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the bee hive and the Ising model thresholding at different mean degrees. Part 1.
Table A1. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the bee hive and the Ising model thresholding at different mean degrees. Part 1.
Mean Degree k 20.0 k 27.5 k 50.0
Log-Likelihood, p-Valueppp
ModelDistribution
T = T l o w Exponential14.07100.02249.75380.1672−0.11000.0539
Log-normal5.59990.00005.09500.0185−1.62570.3173
Weibull1.98430.1524−0.37150.8911−1.73950.2904
T = T c r i t Exponential160.97100.0000269.40610.0000296.94420.0000
Log-normal7.74030.000010.88140.000014.25530.0000
Weibull4.24340.00004.96450.00006.57380.0000
T = T h i g h Exponential−3.45720.52257.91020.4883−0.14000.0288
Log-normal0.54530.85200.51590.8926−2.53850.1892
Weibull−4.27450.2793−7.12290.1479−3.16920.1353
B e e H i v e Exponential68.36860.0040109.48010.0061118.11010.0035
Log-normal5.59050.06968.05560.123610.25390.1191
Weibull1.11720.15961.32140.28961.87270.1386
Table A2. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the bee hive and the Ising model thresholding at different mean degrees. Part 2.
Table A2. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the bee hive and the Ising model thresholding at different mean degrees. Part 2.
Mean Degree k 60.0 k 90.0 k 110.0
Log-Likelihood, p-Valueppp
ModelDistribution
T = T l o w Exponential−0.15070.0336−0.20250.0005−0.61690.0000
Log-normal−1.97510.2443−5.39500.0348−9.54800.0161
Weibull−2.21420.1969−5.89170.0221−10.45660.0152
T = T c r i t Exponential335.68840.0000353.23310.0000330.80690.0000
Log-normal18.08430.000020.54350.000020.31170.0000
Weibull6.72550.00007.75060.00008.84270.0000
T = T h i g h Exponential−0.14080.0057−27.30070.0000−0.21650.0316
Log-normal−3.99670.0747−13.94050.0325−2.06160.2600
Weibull−4.77580.0521−29.77620.0002−2.96170.1781
B e e H i v e Exponential114.68280.001492.14130.001779.24830.0006
Log-normal13.11420.029711.40280.044811.50630.0243
Weibull2.26170.08981.67170.12231.70650.0941
Table A3. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the different bee hives during different trials. Part 1.
Table A3. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the different bee hives during different trials. Part 1.
Mean Degree k 60.0 k 90.0 k 110.0
Log-Likelihood, p-Valueppp
ModelDistribution
Trial 1Exponential35.23440.005711.15760.00292.68100.1226
Log-normal1.94880.50261.88500.11820.56360.0446
Weibull−0.03310.94160.26640.30080.25250.0030
Trial 3Exponential26.01450.00003.33550.09990.00210.9967
Log-normal1.79510.13211.31020.00070.49290.0104
Weibull0.72850.02490.60270.0002−0.00460.9910
Trial 4Exponential12.83720.0037−0.01140.48640.21540.7090
Log-normal1.29790.1088−0.16510.70090.25600.0932
Weibull0.48830.0046−0.21880.65980.05240.5102
Trial 5Exponential72.96020.000043.47320.000111.11950.0029
Log-normal9.47080.00864.89330.10931.64250.0999
Weibull0.99960.15820.34800.39290.33980.0002
Table A4. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the different bee hives during different trials. Part 2.
Table A4. Log-likelihood ratios with their respective p-values computed for degree distributions of correlation networks of the different bee hives during different trials. Part 2.
Mean Degree k 20.0 k 27.5 k 50.0
Log-Likelihood, p-Valueppp
ModelDistribution
Trial 1Exponential42.02510.012239.46960.000637.13920.0000
Log-normal−0.53230.79873.60850.10006.63210.0018
Weibull−0.53690.47570.63760.29981.28880.0250
Trial 3Exponential51.61770.000047.76740.000023.91140.0000
Log-normal2.21360.22281.83310.31502.68470.0234
Weibull0.41940.19380.36880.31300.60900.0022
Trial 4Exponential16.33840.000317.46760.000012.43470.0018
Log-normal0.61530.32281.12610.13930.77400.1541
Weibull0.33410.18440.35770.07600.47210.0631
Trial 5Exponential58.67670.000076.23920.000180.64640.0000
Log-normal5.75970.01104.85740.13379.63710.0113
Weibull1.25280.06680.48720.47081.18380.1514

Appendix B.3. Networks Metrics

In this section, we provide some supplementary information on networks metrics. Methods are identical to those used in Section 3.2, however, a different combination of mean degrees and thresholds was used.
Table A5. Supplementary Table on network metrics, part 1.
Table A5. Supplementary Table on network metrics, part 1.
N k CLD C rand L rand D rand
T = T l o w 10,000.027.779800.103452.799374.00.005522.725034.0
T = T h i g h 10,000.027.339600.224362.869484.00.005662.732114.0
T = T c r i t 9990.027.569770.527627.7182631.00.005712.728214.0
T r i a l 4 1135.027.068720.335492.441055.00.047752.023903.0
T r i a l 3 1135.026.841410.324112.493555.00.047342.028583.0
T r i a l 5 1066.029.885550.499392.743937.00.055401.977093.0
T r i a l 1 879.029.361770.411232.545268.00.066221.953313.0
T r i a l 2 783.039.681990.677672.5285912.00.101361.898703.0
Table A6. Supplementary Table of network metrics, part 2.
Table A6. Supplementary Table of network metrics, part 2.
N k CLD C rand L rand D rand
T = T c r i t 10,000.050.165800.558415.4447720.00.010222.351863.0
T = T l o w 10,000.048.717400.085642.505414.00.009422.373423.0
T = T h i g h 10,000.049.549800.127202.538864.00.009452.361083.0
T r i a l 5 1138.052.042180.529622.364046.00.091581.908673.0
T r i a l 4 1138.048.777680.398812.106494.00.084571.914533.0
T r i a l 3 1137.048.683380.410452.132714.00.086171.914483.0
T r i a l 2 934.060.534260.667332.434409.00.128751.870552.0
T r i a l 1 933.051.378350.484892.229927.00.110221.889913.0

References

  1. Couzin, I.D. Collective cognition in animal groups. Trends Cogn. Sci. 2009, 13, 36–43. [Google Scholar] [CrossRef]
  2. Cavagna, A.; Queirós, S.D.; Giardina, I.; Stefanini, F.; Viale, M. Diffusion of individual birds in starling flocks. Proc. R. Soc. B Biol. Sci. 2013, 280, 20122484. [Google Scholar] [CrossRef] [Green Version]
  3. Attanasi, A.; Cavagna, A.; Del Castello, L.; Giardina, I.; Melillo, S.; Parisi, L.; Pohl, O.; Rossaro, B.; Shen, E.; Silvestri, E.; et al. Collective behaviour without collective order in wild swarms of midges. PLoS Comput. Biol. 2014, 10, e1003697. [Google Scholar] [CrossRef] [Green Version]
  4. Ribeiro, T.L.; Chialvo, D.R.; Plenz, D. Scale-free dynamics in animal groups and brain networks. Front. Syst. Neurosci. 2021, 14, 591210. [Google Scholar] [CrossRef]
  5. Gernat, T.; Rao, V.D.; Middendorf, M.; Dankowicz, H.; Goldenfeld, N.; Robinson, G.E. Automated monitoring of behavior reveals bursty interaction patterns and rapid spreading dynamics in honeybee social networks. Proc. Natl. Acad. Sci. USA 2018, 115, 1433–1438. [Google Scholar] [CrossRef] [Green Version]
  6. Detrain, C.; Deneubourg, J.L. Self-organized structures in a superorganism: Do ants “behave” like molecules? Phys. Life Rev. 2006, 3, 162–187. [Google Scholar] [CrossRef]
  7. Peleg, O.; Peters, J.M.; Salcedo, M.K.; Mahadevan, L. Collective mechanical adaptation of honeybee swarms. Nat. Phys. 2018, 14, 1193–1198. [Google Scholar] [CrossRef]
  8. Mlot, N.J.; Tovey, C.A.; Hu, D.L. Fire ants self-assemble into waterproof rafts to survive floods. Proc. Natl. Acad. Sci. USA 2011, 108, 7669–7673. [Google Scholar] [CrossRef] [Green Version]
  9. Seeley, T.D. Honeybee democracy. In Honeybee Democracy; Princeton University Press: Princeton, NJ, USA, 2010. [Google Scholar]
  10. Gelblum, A.; Fonio, E.; Rodeh, Y.; Korman, A.; Feinerman, O. Ant collective cognition allows for efficient navigation through disordered environments. ELife 2020, 9, e55195. [Google Scholar] [CrossRef]
  11. Marting, P.R.; Wcislo, W.T.; Pratt, S.C. Colony personality and plant health in the Azteca-Cecropia mutualism. Behav. Ecol. 2018, 29, 264–271. [Google Scholar] [CrossRef]
  12. Reina, A.; Bose, T.; Trianni, V.; Marshall, J.A. Psychophysical laws and the superorganism. Sci. Rep. 2018, 8, 1–8. [Google Scholar] [CrossRef] [Green Version]
  13. Chialvo, D.R. Emergent complex neural dynamics. Nat. Phys. 2010, 6, 744–750. [Google Scholar] [CrossRef] [Green Version]
  14. Schnell, A.K.; Amodio, P.; Boeckle, M.; Clayton, N.S. How intelligent is a cephalopod? Lessons from comparative cognition. Biol. Rev. 2021, 96, 162–178. [Google Scholar] [CrossRef]
  15. Hesse, J.; Gross, T. Self-organized criticality as a fundamental property of neural systems. Front. Syst. Neurosci. 2014, 8, 166. [Google Scholar] [CrossRef] [Green Version]
  16. Bak, P. How Nature Works: The Science of Self-Organized Criticality; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  17. Sethna, J. Statistical Mechanics: Entropy, Order Parameters, and Complexity; Oxford University Press: Oxford, UK, 2021; Volume 14. [Google Scholar]
  18. Beggs, J.M.; Plenz, D. Neuronal avalanches in neocortical circuits. J. Neurosci. 2003, 23, 11167–11177. [Google Scholar] [CrossRef] [Green Version]
  19. Fraiman, D.; Balenzuela, P.; Foss, J.; Chialvo, D.R. Ising-like dynamics in large-scale functional brain networks. Phys. Rev. E 2009, 79, 061922. [Google Scholar] [CrossRef] [Green Version]
  20. Kitzbichler, M.G.; Smith, M.L.; Christensen, S.R.; Bullmore, E. Broadband criticality of human brain network synchronization. PLoS Comput. Biol. 2009, 5, e1000314. [Google Scholar] [CrossRef] [Green Version]
  21. Schuster, H.G. Criticality in Neural Systems; John Wiley & Sons: Hoboken, NJ, USA, 2014. [Google Scholar]
  22. Shew, W.L.; Yang, H.; Yu, S.; Roy, R.; Plenz, D. Information capacity and transmission are maximized in balanced cortical networks with neuronal avalanches. J. Neurosci. 2011, 31, 55–63. [Google Scholar] [CrossRef] [Green Version]
  23. Shriki, O.; Yellin, D. Optimal information representation and criticality in an adaptive sensory recurrent neuronal network. PLoS Comput. Biol. 2016, 12, e1004698. [Google Scholar] [CrossRef]
  24. Shew, W.L.; Yang, H.; Petermann, T.; Roy, R.; Plenz, D. Neuronal avalanches imply maximum dynamic range in cortical networks at criticality. J. Neurosci. 2009, 29, 15595–15600. [Google Scholar] [CrossRef]
  25. Zimmern, V. Why brain criticality is clinically relevant: A scoping review. Front. Neural Circuits 2020, 14, 54. [Google Scholar] [CrossRef] [PubMed]
  26. Romanczuk, P.; Daniels, B.C. Phase Transitions and Criticality in the Collective Behavior of Animals–Self-organization and biological function. arXiv 2022, arXiv:2211.03879. [Google Scholar]
  27. Attanasi, A.; Cavagna, A.; Del Castello, L.; Giardina, I.; Melillo, S.; Parisi, L.; Pohl, O.; Rossaro, B.; Shen, E.; Silvestri, E.; et al. Finite-size scaling as a way to probe near-criticality in natural swarms. Phys. Rev. Lett. 2014, 113, 238102. [Google Scholar] [CrossRef] [PubMed]
  28. Gelblum, A.; Pinkoviezky, I.; Fonio, E.; Ghosh, A.; Gov, N.; Feinerman, O. Ant groups optimally amplify the effect of transiently informed individuals. Nat. Commun. 2015, 6, 1–9. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  29. Li, L.; Peng, H.; Kurths, J.; Yang, Y.; Schellnhuber, H.J. Chaos–order transition in foraging behavior of ants. Proc. Natl. Acad. Sci. USA 2014, 111, 8392–8397. [Google Scholar] [CrossRef] [Green Version]
  30. Doi, I.; Ikegami, T. Endogenous and exogenous bursts in a honey bee hive. In Proceedings of the Artificial Life Conference Proceedings, Tokyo, Japan, 23–27 July 2018; MIT Press: Cambridge, MA, USA, 2018; pp. 493–499. [Google Scholar]
  31. Solé, R. Phase Transitions; Princeton University Press: Princeton, NJ, USA, 2011; Volume 3. [Google Scholar]
  32. Gould, H.; Tobochnik, J. Computer Simulation Methods; Addison-Wesley Reading: Reading, MA, USA, 1996. [Google Scholar]
  33. Onsager, L. Crystal statistics. I. A two-dimensional model with an order-disorder transition. Phys. Rev. 1944, 65, 117. [Google Scholar] [CrossRef]
  34. Clauset, A.; Shalizi, C.R.; Newman, M.E. Power-law distributions in empirical data. SIAM Rev. 2009, 51, 661–703. [Google Scholar] [CrossRef] [Green Version]
  35. Alstott, J.; Bullmore, E.; Plenz, D. powerlaw: A Python package for analysis of heavy-tailed distributions. PLoS ONE 2014, 9, e85777. [Google Scholar] [CrossRef] [Green Version]
  36. Fraiman, D.; Chialvo, D.R. What kind of noise is brain noise: Anomalous scaling behavior of the resting brain activity fluctuations. Front. Physiol. 2012, 3, 307. [Google Scholar] [CrossRef] [Green Version]
  37. Zhao, L.; Li, W.; Yang, C.; Han, J.; Su, Z.; Zou, Y. Multifractality and network analysis of phase transition. PLoS ONE 2017, 12, e0170467. [Google Scholar] [CrossRef] [Green Version]
  38. Mandelbrot, B.B.; Wallis, J.R. Noah, Joseph, and operational hydrology. Water Resour. Res. 1968, 4, 909–918. [Google Scholar] [CrossRef]
  39. Stan, C.; Cristescu, C.M.; Cristescu, C.P. Computation of hurst exponent of time series using delayed (log-) returns. Application to estimating the financial volatility. Univ. Politech. Buchar. Sci. Bull. 2014, 76, 235–244. [Google Scholar]
  40. Newman, M. Networks; Oxford University Press: Oxford, UK, 2018. [Google Scholar]
  41. Watts, D.J.; Strogatz, S.H. Collective dynamics of ‘small-world’networks. Nature 1998, 393, 440–442. [Google Scholar] [CrossRef]
  42. Carreras, B.A.; Newman, D.E.; Dobson, I.; Poole, A.B. Evidence for self-organized criticality in a time series of electric power system blackouts. IEEE Trans. Circuits Syst. I Regul. Pap. 2004, 51, 1733–1740. [Google Scholar] [CrossRef]
  43. Meisel, C.; Bailey, K.; Achermann, P.; Plenz, D. Decline of long-range temporal correlations in the human brain during sustained wakefulness. Sci. Rep. 2017, 7, 1–11. [Google Scholar] [CrossRef] [PubMed]
  44. Ling, H.; Mclvor, G.E.; van der Vaart, K.; Vaughan, R.T.; Thornton, A.; Ouellette, N.T. Local interactions and their group-level consequences in flocking jackdaws. Proc. R. Soc. B 2019, 286, 20190865. [Google Scholar] [CrossRef]
  45. Evans, M.H.; Lihou, K.L.; Rands, S.A. Black-headed gulls synchronise their activity with their nearest neighbours. Sci. Rep. 2018, 8, 1–5. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  46. Vicsek, T.; Zafeiris, A. Collective motion. Phys. Rep. 2012, 517, 71–140. [Google Scholar] [CrossRef] [Green Version]
  47. Bak, P.; Tang, C.; Wiesenfeld, K. Self-organized criticality: An explanation of the 1/f noise. Phys. Rev. Lett. 1987, 59, 381. [Google Scholar] [CrossRef]
  48. Liao, X.; Vasilakos, A.V.; He, Y. Small-world human brain networks: Perspectives and challenges. Neurosci. Biobehav. Rev. 2017, 77, 286–300. [Google Scholar] [CrossRef]
  49. Sporns, O. Networks of the Brain; MIT Press: Cambridge, MA, USA, 2016. [Google Scholar]
  50. Waters, J.S.; Fewell, J.H. Information processing in social insect networks. PLoS ONE 2012, 7, e40337. [Google Scholar] [CrossRef] [PubMed]
  51. Michel, C.M.; Koenig, T. EEG microstates as a tool for studying the temporal dynamics of whole-brain neuronal networks: A review. Neuroimage 2018, 180, 577–593. [Google Scholar] [CrossRef] [PubMed]
  52. Deco, G.; Jirsa, V.K.; McIntosh, A.R. Emerging concepts for the dynamical organization of resting-state activity in the brain. Nat. Rev. Neurosci. 2011, 12, 43–56. [Google Scholar] [CrossRef] [PubMed]
  53. Beggs, J.M.; Timme, N. Being critical of criticality in the brain. Front. Physiol. 2012, 3, 163. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Illustrative example demonstrating how spatial coordinates are converted to kinetic energy. Pane (a) presents illustrative fragments of trajectories of two bees, each 5 s long, recorded during the first day of Trial 1. Panes (b,c), respectively, show kinetic energy time-series computed from their movements.
Figure 1. Illustrative example demonstrating how spatial coordinates are converted to kinetic energy. Pane (a) presents illustrative fragments of trajectories of two bees, each 5 s long, recorded during the first day of Trial 1. Panes (b,c), respectively, show kinetic energy time-series computed from their movements.
Entropy 24 01840 g001
Figure 2. Dependence of the mean degree k on the threshold p used for binarisation. The dashed line shows a specific degree chosen to compare different networks, black circles indicate resultant relations between k and p.
Figure 2. Dependence of the mean degree k on the threshold p used for binarisation. The dashed line shows a specific degree chosen to compare different networks, black circles indicate resultant relations between k and p.
Entropy 24 01840 g002
Figure 3. Degree distributions for the correlation networks. Each bin of the histogram corresponds to the frequency of nodes with a given degree. Panels (ac) depict the degree distributions of the Ising networks at T = 2, T = 2.3 and T = 3. Panel (d) depicts an illustrative degree distribution computed using bee hive activity during 1 solar day, from sunrise to sunset. For each network, three representative values of k are plotted.
Figure 3. Degree distributions for the correlation networks. Each bin of the histogram corresponds to the frequency of nodes with a given degree. Panels (ac) depict the degree distributions of the Ising networks at T = 2, T = 2.3 and T = 3. Panel (d) depicts an illustrative degree distribution computed using bee hive activity during 1 solar day, from sunrise to sunset. For each network, three representative values of k are plotted.
Entropy 24 01840 g003
Figure 4. Hurst exponents for magnetization time-series of the Ising model and K m e a n time-series of the bee hive. The main pane shows the slopes of the Hurst exponents for different time-series in relation to each other. Inset panes (ad) demonstrate how well H values fit the data. Note that although H values for T l o w and T h i g h are considerably lower than for critical systems, their exact values are not given because they could be misleading for memory-less time-series.
Figure 4. Hurst exponents for magnetization time-series of the Ising model and K m e a n time-series of the bee hive. The main pane shows the slopes of the Hurst exponents for different time-series in relation to each other. Inset panes (ad) demonstrate how well H values fit the data. Note that although H values for T l o w and T h i g h are considerably lower than for critical systems, their exact values are not given because they could be misleading for memory-less time-series.
Entropy 24 01840 g004
Table 1. Characteristics of degree frequency distributions for various correlation networks. For log-normal distributions, the mean μ and standard deviation σ are given. Truncated power-law distributions are characterized by the power-law exponent α and x m i n . The latter specifies the minimum x value of the data for which the power-law holds. All networks have a matching mean degree k 110 .
Table 1. Characteristics of degree frequency distributions for various correlation networks. For log-normal distributions, the mean μ and standard deviation σ are given. Truncated power-law distributions are characterized by the power-law exponent α and x m i n . The latter specifies the minimum x value of the data for which the power-law holds. All networks have a matching mean degree k 110 .
SystemDistribution FamilyParameters of the Distribution
Ising Model, T = T l o w Log-normal μ = 4.12 , σ = 0.132
Ising Model, T = T c r i t Truncated power law α = 1.99 , x m i n = 2
Ising Model, T = T h i g h Log-normal μ = 3.58 , σ = 0.225
Bee HiveTruncated power law α = 3.49 , x m i n = 3
Table 2. Network metrics computed for the giant components of correlation graphs of the Ising model (T) and bee hive ( T r i a l ). N—number of nodes, k —mean degree, C—average clustering coefficient, L—average path length, D—diameter of the network. C r a n d , L r a n d , D r a n d refer to the metrics computed on ensemble of Erdős–Rényi graphs with N and k identical to the original network.
Table 2. Network metrics computed for the giant components of correlation graphs of the Ising model (T) and bee hive ( T r i a l ). N—number of nodes, k —mean degree, C—average clustering coefficient, L—average path length, D—diameter of the network. C r a n d , L r a n d , D r a n d refer to the metrics computed on ensemble of Erdős–Rényi graphs with N and k identical to the original network.
N k CLD C rand L rand D rand
T = T h i g h 10,000.0111.510.092.043.00.021.983.0
T = T c r i t 10,000.0109.650.563.714.00.021.993.0
T = T l o w 10,000.0107.260.082.033.00.021.983.0
T r i a l 5 1166.0110.320.631.914.00.191.812.0
T r i a l 4 1138.0109.280.51.813.00.191.812.0
T r i a l 3 1137.0110.950.521.813.00.191.812.0
T r i a l 2 1097.0114.120.712.057.00.211.792.0
T r i a l 1 946.0111.740.611.84.00.241.762.0
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shpurov, I.; Froese, T. Evidence of Critical Dynamics in Movements of Bees inside a Hive. Entropy 2022, 24, 1840. https://doi.org/10.3390/e24121840

AMA Style

Shpurov I, Froese T. Evidence of Critical Dynamics in Movements of Bees inside a Hive. Entropy. 2022; 24(12):1840. https://doi.org/10.3390/e24121840

Chicago/Turabian Style

Shpurov, Ivan, and Tom Froese. 2022. "Evidence of Critical Dynamics in Movements of Bees inside a Hive" Entropy 24, no. 12: 1840. https://doi.org/10.3390/e24121840

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop