Despite the fact that seizures are commonly associated with autism spectrum disorder (ASD), the effectiveness of treatments for seizures has not been well studied in individuals with ASD. This manuscript reviews both traditional and novel treatments for seizures associated with ASD. Studies were selected by systematically searching major electronic databases and by a panel of experts that treat ASD individuals. Only a few anti-epileptic drugs (AEDs) have undergone carefully controlled trials in ASD, but these trials examined outcomes other than seizures. Several lines of evidence point to valproate, lamotrigine, and levetiracetam as the most effective and tolerable AEDs for individuals with ASD. Limited evidence supports the use of traditional non-AED treatments, such as the ketogenic and modified Atkins diet, multiple subpial transections, immunomodulation, and neurofeedback treatments. Although specific treatments may be more appropriate for specific genetic and metabolic syndromes associated with ASD and seizures, there are few studies which have documented the effectiveness of treatments for seizures for specific syndromes. Limited evidence supports l-carnitine, multivitamins, and N-acetyl-l-cysteine in mitochondrial disease and dysfunction, folinic acid in cerebral folate abnormalities and early treatment with vigabatrin in tuberous sclerosis complex. Finally, there is limited evidence for a number of novel treatments, particularly magnesium with pyridoxine, omega-3 fatty acids, the gluten-free casein-free diet, and low-frequency repetitive transcranial magnetic simulation. Zinc and l-carnosine are potential novel treatments supported by basic research but not clinical studies. This review demonstrates the wide variety of treatments used to treat seizures in individuals with ASD as well as the striking lack of clinical trials performed to support the use of these treatments. Additional studies concerning these treatments for controlling seizures in individuals with ASD are warranted.

This manuscript reviews biological abnormalities shared by autism spectrum disorder (ASD) and epilepsy. Two neuropathological findings are shared by ASD and epilepsy: abnormalities in minicolumn architecture and γ-aminobutyric acid (GABA) neurotransmission. The peripheral neuropil, which is the region that contains the inhibition circuits of the minicolumns, has been found to be decreased in the post-mortem ASD brain. ASD and epilepsy are associated with inhibitory GABA neurotransmission abnormalities including reduced GABA_A and GABA_B subunit expression. These abnormalities can elevate the excitation-to-inhibition balance, resulting in hyperexcitablity of the cortex and, in turn, increase the risk of seizures. Medical abnormalities associated with both epilepsy and ASD are discussed. These include specific genetic syndromes, specific metabolic disorders including disorders of energy metabolism and GABA and glutamate neurotransmission, mineral and vitamin deficiencies, heavy metal exposures and immune dysfunction. Many of these medical abnormalities can result in an elevation of the excitatory-to-inhibitory balance. Fragile X is linked to dysfunction of the mGluR5 receptor and Fragile X, Angelman and Rett syndromes are linked to a reduction in GABA[subscript A] receptor expression. Defects in energy metabolism can reduce GABA interneuron function. Both pyridoxine dependent seizures and succinic semialdehyde dehydrogenase deficiency cause GABA deficiencies while urea cycle defects and phenylketonuria cause abnormalities in glutamate neurotransmission. Mineral deficiencies can cause glutamate and GABA neurotransmission abnormalities and heavy metals can cause mitochondrial dysfunction which disrupts GABA metabolism. Thus, both ASD and epilepsy are associated with similar abnormalities that may alter the excitatory-to-inhibitory balance of the cortex. These parallels may explain the high prevalence of epilepsy in ASD and the elevated prevalence of ASD features in individuals with epilepsy.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

We develop a framework to uncover and analyse dynamical anomalies from massive, nonlinear and non-stationary time series data. The framework consists of three steps: preprocessing of massive datasets 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 electroencephalogram 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.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

Recently, the phenomenon of quantum-classical correspondence breakdown was uncovered in optomechanics, where in the classical regime the system exhibits chaos but in the corresponding quantum regime the motion is regular - there appears to be no signature of classical chaos whatsoever in the corresponding quantum system, generating a paradox. We find that transient chaos, besides being a physically meaningful phenomenon by itself, provides a resolution. Using the method of quantum state diffusion to simulate the system dynamics subject to continuous homodyne detection, we uncover transient chaos associated with quantum trajectories. The transient behavior is consistent with chaos in the classical limit, while the long term evolution of the quantum system is regular. Transient chaos thus serves as a bridge for the quantum-classical transition (QCT). Strikingly, as the system transitions from the quantum to the classical regime, the average chaotic transient lifetime increases dramatically (faster than the Ehrenfest time characterizing the QCT for isolated quantum systems). We develop a physical theory to explain the scaling law.

The process of cell fate determination has been depicted intuitively as cells travelling and resting on a rugged landscape, which has been probed by various theoretical studies. However, few studies have experimentally demonstrated how underlying gene regulatory networks shape the landscape and hence orchestrate cellular decision-making in the presence of both signal and noise. Here we tested different topologies and verified a synthetic gene circuit with mutual inhibition and auto-activations to be quadrastable, which enables direct study of quadruple cell fate determination on an engineered landscape. We show that cells indeed gravitate towards local minima and signal inductions dictate cell fates through modulating the shape of the multistable landscape. Experiments, guided by model predictions, reveal that sequential inductions generate distinct cell fates by changing landscape in sequence and hence navigating cells to different final states. This work provides a synthetic biology framework to approach cell fate determination and suggests a landscape-based explanation of fixed induction sequences for targeted differentiation.

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.