arXiv subjects

Ying-Cheng Lai

Publications and source records attributed to Ying-Cheng Lai.

At least 109 records · Page 6Linked to original sources

arXiv2016

Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio

We investigate fundamental nonlinear dynamics of ferrofluidic Taylor-Couette flow - flow confined between two concentric independently rotating cylinders - consider small aspect ratio by solving the ferrohydrodynamical equations, carrying out systematic bifurcation analysis. Without magnetic field, we find steady flow patterns, previously observed with a simple fluid, such as those containing normal one- or two vortex cells, as well as anomalous one-cell and twin-cell flow states. However, when a symmetry-breaking transverse magnetic field is present, all flow states exhibit stimulated, finite two-fold mode. Various bifurcations between steady and unsteady states can occur, corresponding to the transitions between the two-cell and one-cell states. While unsteady, axially oscillating flow states can arise, we also detect the emergence of new unsteady flow states. In particular, we uncover two new states: one contains only the azimuthally oscillating solution in the configuration of the twin-cell flow state, and another a rotating flow state. Topologically, these flow states are a limit cycle and a quasiperiodic solution on a two-torus, respectively. Emergence of new flow states in addition to observed ones with classical fluid, indicates that richer but potentially more controllable dynamics in ferrofluidic flows, as such flow states depend on the external magnetic field.

physics.comp-ph↗

arXiv2016

Detecting and characterizing high frequency oscillations in epilepsy - A case study of big data analysis

We develop a framework to uncover and analyze dynamical anomalies from massive, nonlinear and non-stationary time series data. The framework consists of three steps: preprocessing of massive data sets to eliminate erroneous data segments, application of the empirical mode decomposition and Hilbert transform paradigm to obtain the fundamental components embedded in the time series at distinct time scales, and statistical/scaling analysis of the components. As a case study, we apply our framework to detecting and characterizing high frequency oscillations (HFOs) from a big database of rat EEG recordings. We find a striking phenomenon: HFOs exhibit on-off intermittency that can be quantified by algebraic scaling laws. Our framework can be generalized to big data-related problems in other fields such as large-scale sensor data and seismic data analysis.

physics.med-ph↗

arXiv2016

Relativistic Zitterbewegung in non-Hermitian photonic waveguide systems

Zitterbewegung (ZB) is a phenomenon in relativistic quantum systems where the electron wave packet exhibits a trembling or oscillating behavior during its motion, caused by its interaction or coupling with the negative energy state. To directly observe ZB in electronic systems is difficult, due to the challenges associated with the atomic scale wavelength of the electron. Photonic systems offer an alternative paradigm. We exploit the concept of pseudo parity-time (pseudo PT ) symmetry to study ZB in non-Hermitian quantum systems implemented as an experimentally feasible optical waveguide array. In particular, the non-Hermitian Hamiltonian is realized through evanescent coupling among the waveguides to form a one-dimensional lattice with periodic modulations in gain and loss along the guiding direction. As the modulation frequency is changed, we obtain a number of phenomena including periodically suppressed ZB trembling, spatial energy localization, and Hermitian-like ZB oscillations. We calculate phase diagrams indicating the emergence of different types of dynamical behaviors of the relativistic non-Hermitian quantum system in an experimentally justified parameter space. We provide numerical results and a physical analysis to explain the distinct dynamical behaviors revealed by the phase diagrams. Our findings provide a deeper understanding of both the relativistic ZB phenomenon and non-Hermitian pseudo-PT systems, with potential applications in controlling/harnessing light propagation in waveguide-based optical systems.

quant-ph↗

arXiv2016

Superscattering of pseudospin-1 wave in photonic lattice

We uncover a superscattering behavior of pseudospin-1 wave from weak scatterers in the subwavelength regime where the scatterer size is much smaller than wavelength. The phenomenon manifests itself as unusually strong scattering characterized by extraordinarily large values of the cross section even for arbitrarily weak scatterer strength. We establish analytically and numerically that the physical origin of superscattering is revival resonances, for which the conventional Born theory breaks down. The phenomenon can be experimentally tested using synthetic photonic systems.

quant-ph↗

arXiv2016

GOE statistics in graphene billiards with the shape of classically integrable billiards

A crucial result in quantum chaos, which has been established for a long time, is that the spectral properties of classically integrable systems generically are described by Poisson statistics whereas those of time-reversal symmetric, classically chaotic systems coincide with those of random matrices from the Gaussian orthogonal ensemble (GOE). Does this result hold for two-dimensional Dirac material systems? To address this fundamen- tal question, we investigate the spectral properties in a representative class of graphene billiards with shapes of classically integrable circular-sector billiards. Naively one may expect to observe Poisson statistics, which is indeed true for energies close to the band edges where the quasiparticle obeys the Schrödinger equation. However, for energies near the Dirac point, where the quasiparticles behave like massless Dirac fermions, Pois- son statistics is extremely rare in the sense that it emerges only under quite strict symmetry constraints on the straight boundary parts of the sector. An arbitrarily small amount of imperfection of the boundary results in GOE statistics. This implies that, for circular sector confinements with arbitrary angle, the spectral properties will generically be GOE. These results are corroborated by extensive numerical computation. Furthermore, we provide a physical understanding for our results.

quant-ph↗

arXiv2016

Universal structural estimator and dynamics approximator for complex networks

Revealing the structure and dynamics of complex networked systems from observed data is of fundamental importance to science, engineering, and society. Is it possible to develop a universal, completely data driven framework to decipher the network structure and different types of dynamical processes on complex networks, regardless of their details? We develop a Markov network based model, sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator. The SDBM attains its topology according to that of the original system and is capable of simulating the original dynamical process. We develop a fully automated method based on compressive sensing and machine learning to find the SDBM. We demonstrate, for a large variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and predicts its dynamical behavior with high precision.

physics.soc-ph↗

arXiv2016

A universal data based method for reconstructing complex networks with binary-state dynamics

To understand, predict, and control complex networked systems, a prerequisite is to reconstruct the network structure from observable data. Despite recent progress in network reconstruction, binary-state dynamics that are ubiquitous in nature, technology and society still present an outstanding challenge in this field. Here we offer a framework for reconstructing complex networks with binary-state dynamics by developing a universal data-based linearization approach that is applicable to systems with linear, nonlinear, discontinuous, or stochastic dynamics governed by monotonous functions. The linearization procedure enables us to convert the network reconstruction into a sparse signal reconstruction problem that can be resolved through convex optimization. We demonstrate generally high reconstruction accuracy for a number of complex networks associated with distinct binary-state dynamics from using binary data contaminated by noise and missing data. Our framework is completely data driven, efficient and robust, and does not require any a priori knowledge about the detailed dynamical process on the network. The framework represents a general paradigm for reconstructing, understanding, and exploiting complex networked systems with binary-state dynamics.

physics.soc-ph↗

arXiv2016

Fundamental building blocks of controlling complex networks: A universal controllability framework

To understand the controllability of complex networks is a forefront problem relevant to different fields of science and engineering. Despite recent advances in network controllability theories, an outstanding issue is to understand the effect of network topology and nodal interactions on the controllability at the most fundamental level. Here we develop a universal framework based on local information only to unearth the most {\em fundamental building blocks} that determine the controllability. In particular, we introduce a network dissection process to fully unveil the origin of the role of individual nodes and links in control, giving rise to a criterion for the much needed strong structural controllability. We theoretically uncover various phase-transition phenomena associated with the role of nodes and links and strong structural controllability. Applying our theory to a large number of empirical networks demonstrates that technological networks are more strongly structurally controllable (SSC) than many social and biological networks, and real world networks are generally much more SSC than their random counterparts with intrinsic resilience and adaptability as a result of human design and natural evolution.

physics.soc-ph↗

arXiv2016

Explosive spreading on complex networks: the role of synergy

In spite of the vast literature on spreading dynamics on complex networks, the role of local synergy, i.e., the interaction of elements that when combined produce a total effect greater than the sum of the individualelements, has been studied but only for irreversible spreading dynamics. Reversible spreading dynamics are ubiquitous but their interplay with synergy has remained unknown. To fill this knowledge gap, we articulate a model to incorporate local synergistic effect into the classical susceptible-infected-susceptible process, in which the probability for a susceptible node to become infected through an infected neighbor is enhanced when the neighborhood of the latter contains a number of infected nodes. We derive master equations incorporating the synergistic effect, with predictions that agree well with the numerical results. A striking finding is that, when a parameter characterizing the strength of the synergy reinforcement effect is above a critical value, the steady state density of the infected nodes versus the basic transmission rate exhibits an explosively increasing behavior and a hysteresis loop emerges. In fact, increasing the synergy strength can promote the spreading and reduce the invasion and persistence thresholds of the hysteresis loop. A physical understanding of the synergy promoting explosive spreading and the associated hysteresis behavior can be obtained through a mean-field analysis.

physics.soc-ph↗

arXiv2016

Spatiotemporal patterns and predictability of cyberattacks

A relatively unexplored issue in cybersecurity science and engineering is whether there exist intrinsic patterns of cyberattacks. Conventional wisdom favors absence of such patterns due to the overwhelming complexity of the modern cyberspace. Surprisingly, through a detailed analysis of an extensive data set that records the time-dependent frequencies of attacks over a relatively wide range of consecutive IP addresses, we successfully uncover intrinsic spatiotemporal patterns underlying cyberattacks, where the term "spatio" refers to the IP address space. In particular, we focus on analyzing {\em macroscopic} properties of the attack traffic flows and identify two main patterns with distinct spatiotemporal characteristics: deterministic and stochastic. Strikingly, there are very few sets of major attackers committing almost all the attacks, since their attack "fingerprints" and target selection scheme can be unequivocally identified according to the very limited number of unique spatiotemporal characteristics, each of which only exists on a consecutive IP region and differs significantly from the others. We utilize a number of quantitative measures, including the flux-fluctuation law, the Markov state transition probability matrix, and predictability measures, to characterize the attack patterns in a comprehensive manner. A general finding is that the attack patterns possess high degrees of predictability, potentially paving the way to anticipating and, consequently, mitigating or even preventing large-scale cyberattacks using macroscopic approaches.

cs.CR↗

arXiv2016

Growth, collapse, and self-organized criticality in complex networks

To understand how certain dynamical behaviors can or cannot persist as the underlying network grows is a problem of increasing importance in complex dynamical systems as well as sustainability science and engineering. We address the question of whether a complex network of nonlinear oscillators can maintain its synchronization stability as it expands or grows. A network in the real world can never be completely synchronized due to noise and/or external disturbances. This is especially the case when, mathematically, the transient synchronous state during the growth process becomes marginally stable, as a local perturbation can trigger a rapid deviation of the system from the vicinity of the synchronous state. In terms of the nodal dynamics, a large scale avalanche over the entire network can be triggered in the sense that the individual nodal dynamics diverge from the synchronous state in a cascading manner within a short time period. Because of the high dimensionality of the networked system, the transient process for the system to recover to the synchronous state can be extremely long. Introducing a tolerance threshold to identify the desynchronized nodes, we find that, after an initial stage of linear growth, the network typically evolves into a critical state where the addition of a single new node can cause a group of nodes to lose synchronization, leading to synchronization collapse for the entire network. A statistical analysis indicates that, the distribution of the size of the collapse is approximately algebraic (power law), regardless of the fluctuations in the system parameters. This is indication of the emergence of self-organized criticality. We demonstrate the generality of the phenomenon of synchronization collapse using a variety of complex network models, and uncover the underlying dynamical mechanism through an eigenvector analysis.

nlin.AO↗

arXiv2015

Universal underpinning of human mobility in the real world and cyberspace

Human movements in the real world and in cyberspace affect not only dynamical processes such as epidemic spreading and information diffusion but also social and economical activities such as urban planning and personalized recommendation in online shopping. Despite recent efforts in characterizing and modeling human behaviors in both the real and cyber worlds, the fundamental dynamics underlying human mobility have not been well understood. We develop a minimal, memory-based random walk model in limited space for reproducing, with a single parameter, the key statistical behaviors characterizing human movements in both spaces. The model is validated using big data from mobile phone and online commerce, suggesting memory-based random walk dynamics as the universal underpinning for human mobility, regardless of whether it occurs in the real world or in cyberspace.

physics.soc-ph↗

arXiv2015

Controlling herding in minority game systems

Resource allocation takes place in various types of real-world complex systems such as urban traf- fic, social services institutions, economical and ecosystems. Mathematically, the dynamical process of complex resource allocation can be modeled as minority games in which the number of resources is limited and agents tend to choose the less used resource based on available information. Spontaneous evolution of the resource allocation dynamics, however, often leads to a harmful herding behavior accompanied by strong fluctuations in which a large majority of agents crowd temporarily for a few resources, leaving many others unused. Developing effective control strategies to suppress and elim- inate herding is an important but open problem. Here we develop a pinning control method. That the fluctuations of the system consist of intrinsic and systematic components allows us to design a control scheme with separated control variables. A striking finding is the universal existence of an optimal pinning fraction to minimize the variance of the system, regardless of the pinning patterns and the network topology. We carry out a detailed theoretical analysis to understand the emergence of optimal pinning and to predict the dependence of the optimal pinning fraction on the network topol- ogy. Our theory is generally applicable to systems with heterogeneous resource capacities as well as varying control and network topological parameters such as the average degree and the degree dis- tribution exponent. Our work represents a general framework to deal with the broader problem of controlling collective dynamics in complex systems with potential applications in social, economical and political systems.

physics.soc-ph↗

arXiv2015

Control and controllability of nonlinear dynamical networks: a geometrical approach

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains to be an outstanding problem. We develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability (multiple coexisting final states or attractors), which are representative of, e.g., gene regulatory networks (GRNs). The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically useful, we consider RESTRICTED parameter perturbation by imposing the following two constraints: (a) it must be experimentally realizable and (b) it is applied only temporarily. We introduce the concept of ATTRACTOR NETWORK, in which the nodes are the distinct attractors of the system, and there is a directional link from one attractor to another if the system can be driven from the former to the latter using restricted control perturbation. Introduction of the attractor network allows us to formulate a controllability framework for nonlinear dynamical networks: a network is more controllable if the underlying attractor network is more strongly connected, which can be quantified. We demonstrate our control framework using examples from various models of experimental GRNs. A finding is that, due to nonlinearity, noise can counter-intuitively facilitate control of the network dynamics.

q-bio.MN↗

arXiv2015

Peer pressure: enhancement of cooperation through mutual punishment

An open problem in evolutionary game dynamics is to understand the effect of peer pressure on cooperation in a quantitative manner. Peer pressure can be modeled by punishment, which has been proved to be an effective mechanism to sustain cooperation among selfish individuals. We investigate a symmetric punishment strategy, in which an individual will punish each neighbor if their strategies are different, and vice versa. Because of the symmetry in imposing the punishment, one might expect intuitively the strategy to have little effect on cooperation. Utilizing the prisoner's dilemma game as a prototypical model of interactions at the individual level, we find, through simulation and theoretical analysis, that proper punishment, when even symmetrically imposed on individuals, can enhance cooperation. Besides, we find that the initial density of cooperators plays an important role in the evolution of cooperation driven by mutual punishment.

physics.soc-ph↗

arXiv2015

The paradox of controlling complex networks: control inputs versus energy requirement

In this paper, we investigate the linear controllability framework for complex networks from a physical point of view. There are three main results. (1) If one applies control signals as determined from the structural controllability theory, there is a high probability that the control energy will diverge. Especially, if a network is deemed controllable using a single driving signal, then most likely the energy will diverge. (2) The energy required for control exhibits a power-law scaling behavior. (3) Applying additional control signals at proper nodes in the network can reduce and optimize the energy cost. We identify the fundamental structures embedded in the network, the longest control chains, which determine the control energy and give rise to the power-scaling behavior. (To our knowledge, this was not reported in any previous work on control of complex networks.) In addition, the issue of control precision is addressed. These results are supported by extensive simulations from model and real networks, physical reasoning, and mathematical analyses. Notes on the submission history of this work: This work started in late 2012. The phenomena of power-law energy scaling and energy divergence with a single controller were discovered in 2013. Strategies to reduce and optimize control energy was articulated and tested in 2013. The senior co-author (YCL) gave talks about these results at several conferences, including the NETSCI 2014 Satellite entitled "Controlling Complex Networks" on June 2, 2014. The paper was submitted to PNAS in September 2014 and was turned down. It was revised and submitted to PRX in early 2015 and was rejected. After that it was revised and submitted to Nature Communications in May 2015 and again was turned down.

eess.SY↗

arXiv2015

Traffic-driven epidemic spreading in correlated networks

In spite of the extensive previous efforts on traffic dynamics and epidemic spreading in complex networks, the problem of traffic-driven epidemic spreading on {\em correlated} networks has not been addressed. Interestingly, we find that the epidemic threshold, a fundamental quantity underlying the spreading dynamics, exhibits a non-monotonic behavior in that it can be minimized for some critical value of the assortativity coefficient, a parameter characterizing the network correlation. To understand this phenomenon, we use the degree-based mean-field theory to calculate the traffic-driven epidemic threshold for correlated networks. The theory predicts that the threshold is inversely proportional to the packet-generation rate and the largest eigenvalue of the betweenness matrix. We obtain consistency between theory and numerics. Our results may provide insights into the important problem of controlling/harnessing real-world epidemic spreading dynamics driven by traffic flows.

physics.soc-ph↗

arXiv2015

Dynamics of social contagions with memory of non-redundant information

A key ingredient in social contagion dynamics is reinforcement, as adopting a certain social behavior requires verification of its credibility and legitimacy. Memory of non-redundant information plays an important role in reinforcement, which so far has eluded theoretical analysis. We first propose a general social contagion model with reinforcement derived from non-redundant information memory. Then, we develop a unified edge-based compartmental theory to analyze this model, and a remarkable agreement with numerics is obtained on some specific models. Using a spreading threshold model as a specific example to understand the memory effect, in which each individual adopts a social behavior only when the cumulative pieces of information that the individual received from his/her neighbors exceeds an adoption threshold. Through analysis and numerical simulations, we find that the memory characteristic markedly affects the dynamics as quantified by the final adoption size. Strikingly, we uncover a transition phenomenon in which the dependence of the final adoption size on some key parameters, such as the transmission probability, can change from being discontinuous to being continuous. The transition can be triggered by proper parameters and structural perturbations to the system, such as decreasing individuals' adoption threshold, increasing initial seed size, or enhancing the network heterogeneity.

physics.soc-ph↗