We study the unitary matrix model with a topological term. We call the topological term the theta term. In the symmetric model there is the phase transition at λc = 2. If the Wilson term is larger than the theta term, there is the phase transition at the same λc. On the other hand, if the theta term is larger than the Wilson term, there is no phase transition.

Classical dynamics in SU(2) Matrix theory is investigated. A classical chaosorder transition is found. For the angular momentum small enough (even for small coupling constant) the system exhibits a chaotic behavior, for angular momentum large enough the system is regular.

We study an evolutionary game model based on a transition matrix approach, in which the total change in the proportion of a population playing a given strategy is summed directly over contributions from all other strategies. This general approach combines aspects of the traditional replicator model, such as preserving unpopulated strategies, with mutation-type dynamics, which allow for nonzero ...

Extracting important statistical patterns from wind speed time series at different time scales is of interest to wind energy industry in terms of wind turbine optimal control, wind energy dispatch/scheduling, wind energy project design and assessment, and so on. In this paper, a systematic way is presented to estimate the first order (one step) Markov chain transition matrix from wind speed tim...

This paper describes a compression algorithm for probability transition matrices. The compressed matrix is itself a probability transition matrix. In general the compression is not error-free, but the error appears to be small even for high levels of compression.

The transition matrix, which characterizes a discrete time homogeneous Markov chain, is a stochastic matrix. A stochastic matrix is a special nonnegative matrix with each row summing up to 1. In this paper, we focus on the computation of the stationary distribution of a transition matrix from the viewpoint of the Perron vector of a nonnegative matrix, based on which an algorithm for the station...

We propose a Dynamic Boolean Network in which a state of a Boolean network and an output label associated with the state are interacting with each other, and a transition matrix keeps changing perpetually. We extrapolate a mutation of a transition matrix as T → Q−1TQ where T is a transition matrix and Q is a matrix representation of a permutation P (where the objects permuted are states of DBN)...

FePt nanoparticles with thermally stable room-temperature ferromagnetism are investigated. The monodisperse nanoparticles are prepared by chemical synthesis and a salt-matrix annealing technique. Structural and magnetic characterizations confirm the phase transition from the disordered face-centered cubic structure. In this paper, 3 nm FePt nanoparticles are first synthesized by superhydride re...

The complexity of molecular kinetics can be reduced significantly by a restriction to metastable conformations which are almost invariant sets of molecular dynamical systems. With the Robust Perron Cluster Analysis PCCA+, developed by Weber and Deuflhard [6], we have a tool available which can be used to identify these conformations from a transition probability matrix. This method can also be ...