Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.

Generation of nonground-state condensates and adiabatic paradox

The problem of resonant generation of nonground-state condensates is addressed aiming at resolving the seeming paradox that arises when one resorts to the adiabatic representation. In this picture, the eigenvalues and eigenfunctions of a time-dependent Gross-Pitaevskii Hamiltonian are also functions of time. Since the level energies vary in time, no definite transition frequency can be introduced. Hence no external modulation with a fixed frequency can be made resonant. Thus, the resonant generation of adiabatic coherent modes is impossible. However, this paradox occurs only in the frame of the adiabatic picture. It is shown that no paradox exists in the properly formulated diabatic representation. The resonant generation of diabatic coherent modes is a well defined phenomenon. As an example, the equations are derived, describing the generation of diabatic coherent modes by the combined resonant modulation of the trapping potential and atomic scattering length.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.