Gene Expression Complex Networks: Synthesis, Identification, and Analysis

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

Asymptotic limits of a self-dual Ginzburg-Landau functional in bounded domains

In the author's joint paper [HJS] with Jest and Struwe, we discuss asymtotic limits of a self-dual Ginzburg-Landau functional involving a section of a line bundle over a closed Riemann surface and a connection on this bundle. In this paper, the author generalizes the above results [HJS] to the case of bounded domains.

Heat flow for Yang-Mills-Higgs fields, part I

The Yang-Mills-Higgs field generalizes the Yang-Mills field. The authors establish the local existence and uniqueness of the weak solution to the heat flow for the Yang-Mills-Higgs field in a vector bundle over a compact Riemannian 4-manifold, and show that the weak solution is gauge-equivalent to a smooth solution and there are at most finite singularities at the maximum existing time.

Dynamics of trapped Bose-Einstein condensates: Beyond the mean-field

Since dilute Bose gas condensates were first experimentally produced, the Gross-Pitaevskii equation has been successfully used as a descriptive tool. As a mean-field equation, it cannot by definition predict anything about the many-body quantum statistics of condensate. We show here that there are a class of dynamical systems where it cannot even make successful predictions about the mean-field behavior, starting with the process of evaporative cooling by which condensates are formed. Among others are parametric processes, such as photoassociation and dissociation of atomic and molecular condensates.

Asymptotic behaviour of two-dimensional time-delayed Navier-Stokes equations

We consider the two-dimensional Navier-Stokes equations with a time-delayed convective term and a forcing term which contains some hereditary features. Some results on existence and uniqueness of solutions are established. We discuss the asymptotic behaviour of solutions and we also show the exponential stability of stationary solutions.

C(alpha)-HOLDER CLASSICAL SOLUTIONS FOR NON-AUTONOMOUS NEUTRAL DIFFERENTIAL EQUATIONS

In this paper we discuss the existence of alpha-Holder classical solutions for non-autonomous abstract partial neutral functional differential equations. An application is considered.

Two estimates concerning asymptotics of the minimizations of a Ginzburg-Landau functional

We prove two asymptotical estimates for minimizers of a Ginzburg-Landau functional of the form integral(Omega) [1/2 \del u\(2) + 1/4 epsilon(2) (1 - \u\(2))(2) W (x)] dx.

Quantum signatures of chaos in the dynamics of a trapped ion

We show how a nonlinear chaotic system, the parametrically kicked nonlinear oscillator, may be realized in the dynamics of a trapped, laser-cooled ion, interacting with a sequence of standing-wave pulses. Unlike the original optical scheme [G. J. Milburn and C.A. Holmes, Phys. Rev. A 44, 4704 (1991)], the trapped ion enables strongly quantum dynamics with minimal dissipation. This should permit an experimental test of one of the quantum signatures of chaos: irregular collapse and revival dynamics of the average vibrational energy.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

Learning the dynamics of embedded clauses

Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations - generally in line with Siegelmann's theoretical work - which supply insights into how embedded structures of languages can be handled in analog hardware.

Measuring and Controlling the Chaotic Motion of Profits

The study of economic systems has generated deep interest in exploring the complexity of chaotic motions in economy. Due to important developments in nonlinear dynamics, the last two decades have witnessed strong revival of interest in nonlinear endogenous business chaotic models. The inability to predict the behavior of dynamical systems in the presence of chaos suggests the application of chaos control methods, when we are more interested in obtaining regular behavior. In the present article, we study a specific economic model from the literature. More precisely, a system of three ordinary differential equations gather the variables of profits, reinvestments and financial flow of borrowings in the structure of a firm. Firstly, using results of symbolic dynamics, we characterize the topological entropy and the parameter space ordering of kneading sequences, associated with one-dimensional maps that reproduce significant aspects of the model dynamics. The analysis of the variation of this numerical invariant, in some realistic system parameter region, allows us to quantify and to distinguish different chaotic regimes. Finally, we show that complicated behavior arising from the chaotic firm model can be controlled without changing its original properties and the dynamics can be turned into the desired attracting time periodic motion (a stable steady state or into a regular cycle). The orbit stabilization is illustrated by the application of a feedback control technique initially developed by Romeiras et al. [1992]. This work provides another illustration of how our understanding of economic models can be enhanced by the theoretical and numerical investigation of nonlinear dynamical systems modeled by ordinary differential equations.