Geometric Convergence Rates for Time-Sampled Markov Chains

We consider time-sampled Markov chain kernels, of the form P = _n n P ⁿ . We prove bounds on the total variation distance to stationarity of such chains. We are motivated by the analysis of near-periodic MCMC algorithms.     

Continuous-Time Controlled Markov Chains with Discounted Rewards

This paper studies denumerable state continuous-time controlled Markov chains with the discounted reward criterion and a Borel action space. The reward and transition rates are unbounded, and the reward rates are allowed to take positive or negative values. First, we present new conditions for a nonhomogeneous Q(t)-process to be regular. Then, using these conditions, we give a new set of mild hypotheses that ensure the existence of -optimal (0) stationary policies. We also present a martingale characterization of an optimal stationary policy. Our results are illustrated with controlled birth and death processes.     

Exactly Solvable su(N) Mixed Spin Ladders

It is shown that solvable mixed spin ladder models can be constructed from su(N) permutators. Heisenberg rung interactions appear as chemical potential terms in the Bethe Ansatz solution. Explicit examples given are a mixed spin- spin-1 ladder, a mixed spin- spin- ladder and a spin-1 ladder with biquadratic interactions.     

Old and new from SOR

From the long history of Successive Over Relaxation (SOR) between the end of second world war and today three points are considered: (1) Classical results of Young and Varga are described. (2) It is shown how results on semiiterative methods can be used to derive these classical results in a unifying way and to compare SOR with other iterative methods. (3) In the last 15 years the application of SOR to compute the stationary distribution of a homogeneous Markov chain has been discussed. These results are reported, considering especially the term extended convergence introduced by Kontovasilis, Plemmons and Stewart.     

Carbon linear chains inside multiwalled nanotubes

Multiwalled carbon nanotubes have been deposited on graphite cathodes by using an arc discharge technique in He atmosphere, with the insertion of a catalytic Ni-Cr mixture as well as without catalysers. The topography of such deposition has been investigated by SEM, while a parallel micro-Raman study has revealed, in particular regions of the deposited cathodes, strong bands in the range 1780-1860 cm⁻¹, assignable to linear carbon chains inside the nanotubes. The variation of intensity, frequency and bandwidth of such bands has been investigated, in relation with the spectral characters of the host multiwalled carbon nanotube. In the cathode deposited without catalyst a quite ordered configuration of multiwalled carbon nanotubes is obtained in the central zone, while the maximum concentration of linear carbon chains is found in a ring shaped zone just inside the border. In sample obtained with catalyst the deposited multiwalled carbon nanotubes appear always more disordered, and a remarkable concentration of carbon chains appears in some zones, with a more casual distribution.     

Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree

In this paper,we study the strong law of large numbers and Shannon-McMillan (S-M) theorem for Markov chains indexed by an infinite tree with uniformly bounded degree.The results generalize the analogous results on a homogeneous tree.     

Solutions to the reflection equation and integrable systems for N = 2 SQCD with classical groups

Integrable systems underlying the Seiberg-Witten solutions for the N = 2 SQCD with gauge groups SO(n) and Sp(n) are proposed. They are described by the inhomogeneous XXX spin chain with specific boundary conditions given by reflection matrices. We attribute reflection matrices to orientifold planes in the brane construction and briefly discuss its possible deformations.     

Superstochastic matrices and magic Markov chains

A brief account of the conceptual formulation of the two entities in this paper’s title, plus an initial preliminary investigation of some of their mathematical properties, is given.     

套链分解

Let X1,X2,...,Xk be k disjoint subsets of S with the same cardinality m.Define H(m,k) = {X (C) S: X (C) Xi for 1 ≤I ≤k} and P(m,k) = {X (C) S : X ∩ Xi ≠φ for at least two Xi's}.Suppose S = Uki=1 Xi,and let Q(m,k,2) be the collection of all subsets K of S satisfying|K ∩ Xi|≥ 2 for some 1 ≤ I ≤ k.For any two disjoint subsets Y1 and Y2 of S,we define F1,j = {X (C) S : either |X ∩ Y1|≥ 1 or |X ∩ Y2|≥ j}.It is obvious that the four posers are graded posets ordered by inclusion.In this paper we will prove that the four posets are nested chain orders.     

Some identities between basic hypergeometric series deriving from a new Bailey-type transformation

We prove a new Bailey-type transformation relating WP-Bailey pairs. We then use this transformation to derive a number of new 3- and 4-term transformation formulae between basic hypergeometric series.