Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex networks under game-based interactions from small amounts of data. The method is validated by using a variety of model networks and by conducting an actual experiment to reconstruct a social network. While most existing methods in this area assume oscillator networks that generate continuous-time data, our work successfully demonstrates that the extremely challenging problem of reverse engineering of complex networks can also be addressed even when the underlying dynamical processes are governed by realistic, evolutionary-game type of interactions in discrete time.

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.

Introduction: Fluorescence-guided surgery is one of the rapidly emerging methods of surgical “theranostics.” In this review, we summarize current fluorescence techniques used in neurosurgical practice for brain tumor patients as well as future applications of recent laboratory and translational studies.

Methods: Review of the literature.

Results: A wide spectrum of fluorophores that have been tested for brain surgery is reviewed. Beginning with a fluorescein sodium application in 1948 by Moore, fluorescence-guided brain tumor surgery is either routinely applied in some centers or is under active study in clinical trials. Besides the trinity of commonly used drugs (fluorescein sodium, 5-aminolevulinic acid, and indocyanine green), less studied fluorescent stains, such as tetracyclines, cancer-selective alkylphosphocholine analogs, cresyl violet, acridine orange, and acriflavine, can be used for rapid tumor detection and pathological tissue examination. Other emerging agents, such as activity-based probes and targeted molecular probes that can provide biomolecular specificity for surgical visualization and treatment, are reviewed. Furthermore, we review available engineering and optical solutions for fluorescent surgical visualization. Instruments for fluorescent-guided surgery are divided into wide-field imaging systems and hand-held probes. Recent advancements in quantitative fluorescence-guided surgery are discussed.

Conclusion: We are standing on the threshold of the era of marker-assisted tumor management. Innovations in the fields of surgical optics, computer image analysis, and molecular bioengineering are advancing fluorescence-guided tumor resection paradigms, leading to cell-level approaches to visualization and resection of brain tumors.

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.

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. 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 meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating 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.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.

Improved tools for providing specific intraoperative diagnoses could improve patient care. In neurosurgery, intraoperatively differentiating non-operative lesions such as CNS B-cell lymphoma from operative lesions can be challenging, often necessitating immunohistochemical (IHC) procedures which require up to 24-48 hours. Here, we evaluate the feasibility of generating rapid ex vivo specific labeling using a novel lymphoma-specific fluorescent switchable aptamer. Our B-cell lymphoma-specific switchable aptamer produced only low-level fluorescence in its unbound conformation and generated an 8-fold increase in fluorescence once bound to its target on CD20-positive lymphoma cells. The aptamer demonstrated strong binding to B-cell lymphoma cells within 15 minutes of incubation as observed by flow cytometry. We applied the switchable aptamer to ex vivo xenograft tissue harboring B-cell lymphoma and astrocytoma, and within one hour specific visual identification of lymphoma was routinely possible. In this proof-of-concept study in human cell culture and orthotopic xenografts, we conclude that a fluorescent switchable aptamer can provide rapid and specific labeling of B-cell lymphoma, and that developing aptamer-based labeling approaches could simplify tissue staining and drastically reduce time to histopathological diagnoses compared with IHC-based methods. We propose that switchable aptamers could enhance expeditious, accurate intraoperative decision-making.

Background: Immunomodulatory drugs (IMiDs), such as lenalidomide, are therapeutically active compounds that bind and modulate the E3 ubiquitin ligase substrate recruiter cereblon, thereby affect steady-state levels of cereblon and cereblon binding partners, such as ikaros and aiolos, and induce many cellular responses, including cytotoxicity to multiple myeloma (MM) cells. Nevertheless, it takes many days for MM cells to die after IMiD induced depletion of ikaros and aiolos and thus we searched for other cereblon binding partners that participate in IMiD cytotoxicity.

Methods: Cereblon binding partners were identified from a MM cell line expressing histidine-tagged cereblon by pulling down cereblon and its binding partners and verified by co-immunoprecipitation. IMiD effects were determined by western blot analysis, cell viability assay, microRNA array and apoptosis analysis.

Results: We identified argonaute 2 (AGO2) as a cereblon binding partner and found that the steady-state levels of AGO2 were regulated by cereblon. Upon treatment of IMiD-sensitive MM cells with lenalidomide, the steady-state levels of cereblon were significantly increased, whereas levels of AGO2 were significantly decreased. It has been reported that AGO2 plays a pivotal role in microRNA maturation and function. Interestingly, upon treatment of MM cells with lenalidomide, the steady-state levels of microRNAs were significantly altered. In addition, silencing of AGO2 in MM cells, regardless of sensitivity to IMiDs, significantly decreased the levels of AGO2 and microRNAs and massively induced cell death.

Conclusion: These results support the notion that the cereblon binding partner AGO2 plays an important role in regulating MM cell growth and survival and AGO2 could be considered as a novel drug target for overcoming IMiD resistance in MM cells.

Two classes of scaling behaviours, namely the super-linear scaling of links or activities, and the sub-linear scaling of area, diversity, or time elapsed with respect to size have been found to prevail in the growth of complex networked systems. Despite some pioneering modelling approaches proposed for specific systems, whether there exists some general mechanisms that account for the origins of such scaling behaviours in different contexts, especially in socioeconomic systems, remains an open question. We address this problem by introducing a geometric network model without free parameter, finding that both super-linear and sub-linear scaling behaviours can be simultaneously reproduced and that the scaling exponents are exclusively determined by the dimension of the Euclidean space in which the network is embedded. We implement some realistic extensions to the basic model to offer more accurate predictions for cities of various scaling behaviours and the Zipf distribution reported in the literature and observed in our empirical studies. All of the empirical results can be precisely recovered by our model with analytical predictions of all major properties. By virtue of these general findings concerning scaling behaviour, our models with simple mechanisms gain new insights into the evolution and development of complex networked systems.