arXiv subjects

Michael Small

Publications and source records attributed to Michael Small.

At least 55 records · Page 3Linked to original sources

arXiv2014

Exploration of period-doubling cascade route to chaos with complex network based time series construction

In this work, the topologies of networks constructed from time series from an underlying system undergo a period doubling cascade have been explored by means of the prevalence of different motifs using an efficient computational motif detection algorithm. By doing this we adopt a refinement based on the $k$ nearest neighbor recurrence-based network has been proposed. We demonstrate that the refinement of network construction together with the study of prevalence of different motifs allows a full explosion of the evolving period doubling cascade route to chaos in both discrete and continuous dynamical systems. Further, this links the phase space time series topologies to the corresponding network topologies, and thus helps to understand the empirical "superfamily" phenomenon, as shown by Xu.

nlin.CD↗

arXiv2014

Basin of Attraction Determines Hysteresis in Explosive Synchronization

Spontaneous explosive emergent behavior takes place in heterogeneous networks when the frequencies of the nodes are positively correlated to the node degree. A central feature of such explosive transitions is a hysteretic behavior at the transition to synchronization. We unravel the underlying mechanisms and show that the dynamical origin of the hysteresis is a change of basin of attraction of the synchronization state. Our findings hold for heterogeneous networks with star graph motifs such as scale free networks, and hence reveal how microscopic network parameters such as node degree and frequency affect the global network properties and can be used for network design and control.

nlin.CD↗

arXiv2013

Temporal prediction of epidemic patterns in community networks

Most previous studies of epidemic dynamics on complex networks suppose that the disease will eventually stabilize at either a disease-free state or an endemic one. In reality, however, some epidemics always exhibit sporadic and recurrent behaviour in one region because of the invasion from an endemic population elsewhere. In this paper we address this issue and study a susceptible-infected-susceptible epidemiological model on a network consisting of two communities, where the disease is endemic in one community but alternates between outbreaks and extinctions in the other. We provide a detailed characterization of the temporal dynamics of epidemic patterns in the latter community. In particular, we investigate the time duration of both outbreak and extinction, and the time interval between two consecutive inter-community infections, as well as their frequency distributions. Based on the mean-field theory, we theoretically analyze these three timescales and their dependence on the average node degree of each community, the transmission parameters, and the number of intercommunity links, which are in good agreement with simulations, except when the probability of overlaps between successive outbreaks is too large. These findings aid us in better understanding the bursty nature of disease spreading in a local community, and thereby suggesting effective time-dependent control strategies.

physics.soc-ph↗

arXiv2013

Complex Network Approach to the Statistical Features of the Sunspot Series

Complex network approaches have been recently developed as an alternative framework to study the statistical features of time-series data. We perform a visibility-graph analysis on both the daily and monthly sunspot series. Based on the data, we propose two ways to construct the network: one is from the original observable measurements and the other is from a negative-inverse-transformed series. The degree distribution of the derived networks for the strong maxima has clear non-Gaussian properties, while the degree distribution for minima is bimodal. The long-term variation of the cycles is reflected by hubs in the network which span relatively large time intervals. Based on standard network structural measures, we propose to characterize the long-term correlations by waiting times between two subsequent events. The persistence range of the solar cycles has been identified over 15\,--\,1000 days by a power-law regime with scaling exponent $γ= 2.04$ of the occurrence time of the two subsequent and successive strong minima. In contrast, a persistent trend is not present in the maximal numbers, although maxima do have significant deviations from an exponential form. Our results suggest some new insights for evaluating existing models. The power-law regime suggested by the waiting times does indicate that there are some level of predictable patterns in the minima.

physics.data-an↗

arXiv2013

A surrogate for networks -- How scale-free is my scale-free network?

Complex networks are now being studied in a wide range of disciplines across science and technology. In this paper we propose a method by which one can probe the properties of experimentally obtained network data. Rather than just measuring properties of a network inferred from data, we aim to ask how typical is that network? What properties of the observed network are typical of all such scale free networks, and which are peculiar? To do this we propose a series of methods that can be used to generate statistically likely complex networks which are both similar to the observed data and also consistent with an underlying null-hypothesis -- for example a particular degree distribution. There is a direct analogy between the approach we propose here and the surrogate data methods applied to nonlinear time series data.

physics.soc-ph↗

arXiv2013

What exactly are the properties of scale-free and other networks?

The concept of scale-free networks has been widely applied across natural and physical sciences. Many claims are made about the properties of these networks, even though the concept of scale-free is often vaguely defined. We present tools and procedures to analyse the statistical properties of networks defined by arbitrary degree distributions and other constraints. Doing so reveals the highly likely properties, and some unrecognised richness, of scale-free networks, and casts doubt on some previously claimed properties being due to a scale-free characteristic.

nlin.AO↗

arXiv2012

The instability of followers and emergent vorticity in flocking behaviour for an experimental interaction rule

Computational models of collective behavior in birds has allowed us to infer interaction rules directly from experimental data. Using a generic form of these rules we explore the collective behavior and emergent dynamics of a simulated swarm. For a wide range of flock size and interaction extent (the fixed number of neighbors with which an individual will interact) we find that the computational collective is inherently stable --- individuals are attracted to one another and will position themselves a preferred distance from their fixed neighbors within a rigid lattice. Nonetheless, the irregular overall shape of the flock, coupled with the need for individuals on the boundary to move towards their neighbors creates a torque which leads the flock to rotate and then meander. We argue that this "rolling meander" is a very good proxy for real collective behavior in animal species and yet arises from a simple homogeneous and deterministic rule for interaction. Rather than then introduce leaders --- which has already been shown, quite straightforwardly, to drive collective swarms such as this --- we introduce a small number of "followers". Each follower is bound to consider a random fixed individual to be among their neighbors, irrespective of actual metric distance between them. We find that the introduction of a small number of such followers causes a phase transition that quickly leads to instability in the flock structure (as no stable configuration arises) and the previously rigid crystalline interaction among neighbors now becomes fluid: the distance between neighbors decreases, the flock ceases to rotate and meanders less.

nlin.AO↗

arXiv2012

The Impacts of Subsidy Policies on Vaccination Decisions in Contact Networks

Often, vaccination programs are carried out based on self-interest rather than being mandatory. Owing to the perceptions about risks associated with vaccines and the `herd immunity' effect, it may provide suboptimal vaccination coverage for the population as a whole. In this case, some subsidy policies may be offered by the government to promote vaccination coverage. But, not all subsidy policies are effective in controlling the transmission of infectious diseases. We address the question of which subsidy policy is best, and how to appropriately distribute the limited subsidies to maximize vaccine coverage. To answer these questions, we establish a model based on evolutionary game theory, where individuals try to maximize their personal payoffs when considering the voluntary vaccination mechanism. Our model shows that voluntary vaccination alone is insufficient to control an epidemic. Hence, two subsidy policies are systematically studied: (1) in the free subsidy policy the total amount of subsidies is distributed to some individuals and all the donees may vaccinate at no cost, and (2) in the part-offset subsidy policy each vaccinated person is offset by a certain proportion of the vaccination cost. Simulations suggest that, since the part-offset subsidy policy can encourage more individuals to be vaccinated, the performance of this policy is significantly better than that of the free subsidy policy.

physics.soc-ph↗

arXiv2012

Predicting the outcome of roulette

There have been several popular reports of various groups exploiting the deterministic nature of the game of roulette for profit. Moreover, through its history the inherent determinism in the game of roulette has attracted the attention of many luminaries of chaos theory. In this paper we provide a short review of that history and then set out to determine to what extent that determinism can really be exploited for profit. To do this, we provide a very simple model for the motion of a roulette wheel and ball and demonstrate that knowledge of initial position, velocity and acceleration is sufficient to predict the outcome with adequate certainty to achieve a positive expected return. We describe two physically realisable systems to obtain this knowledge both incognito and {\em in situ}. The first system relies only on a mechanical count of rotation of the ball and the wheel to measure the relevant parameters. By applying this techniques to a standard casino-grade European roulette wheel we demonstrate an expected return of at least 18%, well above the -2.7% expected of a random bet. With a more sophisticated, albeit more intrusive, system (mounting a digital camera above the wheel) we demonstrate a range of systematic and statistically significant biases which can be exploited to provide an improved guess of the outcome. Finally, our analysis demonstrates that even a very slight slant in the roulette table leads to a very pronounced bias which could be further exploited to substantially enhance returns.

nlin.CD↗

arXiv2012

The stability of networks --- towards a structural dynamical systems theory

The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle this problem have been made and all focus on either the controllability or synchronisability of the network --- usually analyzed by way of the master stability function, or the graph Laplacian. We take a different approach. Using the basic tools from dynamical systems theory we show that the dynamical stability of a network can easily be defined in terms of the eigenvalues of an homologue of the network adjacency matrix. This allows us to compute the stability of a network (a quantity derived from the eigenspectrum of the adjacency matrix). Numerical experiments show that this quantity is very closely related too, and can even be predicted from, the standard structural network properties. Following from this we show that the stability of large network systems can be understood via an analytic study of the eigenvalues of their fixed points --- even for a very large number of fixed points.

nlin.CD↗

arXiv2012

Multiscale characterization of recurrence-based phase space networks constructed from time series

Recently, a framework for analyzing time series by constructing an associated complex network has attracted significant research interest. One of the advantages of the complex network method for studying time series is that complex network theory provides a tool to describe either important nodes, or structures that exist in the networks, at different topological scale. This can then provide distinct information for time series of different dynamical systems. In this paper, we systematically investigate the recurrence-based phase space network of order $k$ that has previously been used to specify different types of dynamics in terms of the motif ranking from a different perspective. Globally, we find that the network size scales with different scale exponents and the degree distribution follows a quasi-symmetric bell shape around the value of $2k$ with different values of degree variance from periodic to chaotic Rössler systems. Local network properties such as the vertex degree, the clustering coefficients and betweenness centrality are found to be sensitive to the local stability of the orbits and hence contain complementary information.

nlin.CD↗

arXiv2012

Neuronal avalanches of a self-organized neural network with active-neuron-dominant structure

Neuronal avalanche is a spontaneous neuronal activity which obeys a power-law distribution of population event sizes with an exponent of -3/2. It has been observed in the superficial layers of cortex both \emph{in vivo} and \emph{in vitro}. In this paper we analyze the information transmission of a novel self-organized neural network with active-neuron-dominant structure. Neuronal avalanches can be observed in this network with appropriate input intensity. We find that the process of network learning via spike-timing dependent plasticity dramatically increases the complexity of network structure, which is finally self-organized to be active-neuron-dominant connectivity. Both the entropy of activity patterns and the complexity of their resulting post-synaptic inputs are maximized when the network dynamics are propagated as neuronal avalanches. This emergent topology is beneficial for information transmission with high efficiency and also could be responsible for the large information capacity of this network compared with alternative archetypal networks with different neural connectivity.

q-bio.NC↗

arXiv2012

Generating self-organizing collective behavior using separation dynamics from experimental data

Mathematical models for systems of interacting agents using simple local rules have been proposed and shown to exhibit emergent swarming behavior. Most of these models are constructed by intuition or manual observations of real phenomena, and later tuned or verified to simulate desired dynamics. In contrast to this approach, we propose using a model that attempts to follow an averaged rule of the essential distance-dependent collective behavior of real pigeon flocks, which was abstracted from experimental data. By using a simple model to follow the behavioral tendencies of real data, we show that our model can exhibit emergent self-organizing dynamics such as flocking, pattern formation, and counter-rotating vortices. The range of behaviors observed in our simulations are richer than the standard models of collective dynamics, and should thereby give potential for new models of complex behavior.

nlin.AO↗

arXiv2012

Pairwise interaction pattern in the weighted communication network

Although recent studies show that both topological structures and human dynamics can strongly affect information spreading on social networks, the complicated interplay of the two significant factors has not yet been clearly described. In this work, we find a strong pairwise interaction based on analyzing the weighted network generated by the short message communication dataset within a Chinese tele-communication provider. The pairwise interaction bridges the network topological structure and human interaction dynamics, which can promote local information spreading between pairs of communication partners and in contrast can also suppress global information (e.g., rumor) cascade and spreading. In addition, the pairwise interaction is the basic pattern of group conversations and it can greatly reduce the waiting time of communication events between a pair of intimate friends. Our findings are also helpful for communication operators to design novel tariff strategies and optimize their communication services.

physics.soc-ph↗

arXiv2011

Reciprocal relationships in collective flights of homing pigeons

Collective motion of bird flocks can be explained via the hypothesis of many wrongs, and/or, a structured leadership mechanism. In pigeons, previous studies have shown that there is a well-defined hierarchical structure and certain specific individuals occupy more dominant positions --- suggesting that leadership by the few individuals drives the behavior of the collective. Conversely, by analyzing the same data-sets, we uncover a more egalitarian mechanism. We show that both reciprocal relationships and a stratified hierarchical leadership are important and necessary in the collective movements of pigeon flocks. Rather than birds adopting either exclusive averaging or leadership strategies, our experimental results show that it is an integrated combination of both compromise and leadership which drives the group's movement decisions.

physics.soc-ph↗

arXiv2011

Dynamical modeling of collective behavior from pigeon flight data: flock cohesion and dispersion

Several models of flocking have been promoted based on simulations with qualitatively naturalistic behavior. In this paper we provide the first direct application of computational modeling methods to infer flocking behavior from experimental field data. We show that this approach is able to infer general rules for interaction, or lack of interaction, among members of a flock or, more generally, any community. Using experimental field measurements of homing pigeons in flight we demonstrate the existence of a basic distance dependent attraction/repulsion relationship and show that this rule is sufficient to explain collective behavior observed in nature. Positional data of individuals over time are used as input data to a computational algorithm capable of building complex nonlinear functions that can represent the system behavior. Topological nearest neighbor interactions are considered to characterize the components within this model. The efficacy of this method is demonstrated with simulated noisy data generated from the classical (two dimensional) Vicsek model. When applied to experimental data from homing pigeon flights we show that the more complex three dimensional models are capable of predicting and simulating trajectories, as well as exhibiting realistic collective dynamics. The simulations of the reconstructed models are used to extract properties of the collective behavior in pigeons, and how it is affected by changing the initial conditions of the system. Our results demonstrate that this approach may be applied to construct models capable of simulating trajectories and collective dynamics using experimental field measurements of herd movement. From these models, the behavior of the individual agents (animals) may be inferred.

q-bio.OT↗

arXiv2011

Optimizing and controlling functions of complex networks by manipulating rich-club connections

Traditionally, there is no evidence suggesting that there are strong ties between the rich-club property and the function of complex networks. In this study, we find that whether a very small portion of rich nodes connected to each other or not can strongly affect the frequency of occurrence of basic building blocks (motif) within networks, and therefore the function, of a heterogeneous network. Conversely whether a homogeneous network has a rich-club property or not generally has no significant effect on its structure and function. These findings open the possibility to optimize and control the function of complex networks by manipulating rich-club connections. Furthermore, based on the subgraph ratio profile, we develop a more rigorous approach to judge whether a network has a rich-club or not. The new method does not calculate how many links there are among rich nodes but depends on how the links among rich nodes can affect the overall structure as well as function of a given network. These results can also help us to understand the evolution of dynamical networks and design new models for characterizing real-world networks.

physics.soc-ph↗

arXiv2010

Fitness-driven deactivation in network evolution

Individual nodes in evolving real-world networks typically experience growth and decay --- that is, the popularity and influence of individuals peaks and then fades. In this paper, we study this phenomenon via an intrinsic nodal fitness function and an intuitive aging mechanism. Each node of the network is endowed with a fitness which represents its activity. All the nodes have two discrete stages: active and inactive. The evolution of the network combines the addition of new active nodes randomly connected to existing active ones and the deactivation of old active nodes with possibility inversely proportional to their fitnesses. We obtain a structured exponential network when the fitness distribution of the individuals is homogeneous and a structured scale-free network with heterogeneous fitness distributions. Furthermore, we recover two universal scaling laws of the clustering coefficient for both cases, $C(k) \sim k^{-1}$ and $C \sim n^{-1}$, where $k$ and $n$ refer to the node degree and the number of active individuals, respectively. These results offer a new simple description of the growth and aging of networks where intrinsic features of individual nodes drive their popularity, and hence degree.

physics.soc-ph↗