Related papers: Random motion on finite rings, II: Noncommutative …
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
We study a linear recursion with random Markov-dependent coefficients. In a "regular variation in, regular variation out" setup we show that its stationary solution has a multivariate regularly varying distribution. This extends results…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…
The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…
The recently established spectral Favard theorem for bounded banded matrices admitting a positive bidiagonal factorization is applied to a broader class of Markov chains with bounded banded transition matrices, extending beyond the…
The product matrix of a finite commutative ring $R=\{x_1,x_2,\ldots,x_n\}$ and an element $u \in R$ is the matrix $A_u(R)=[a_{ij}]$, where $a_{ij}=1$ if $x_ix_j=u$, and $a_{ij}=0$ otherwise. This provides a natural extension of the concept…
We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
The time evolution of a bounded quantum system is considered in the framework of the orthogonal, unitary and symplectic circular ensembles of random matrix theory. For an $N$ dimensional Hilbert space we prove that in the large $N$ limit…
Statistical properties of infinite products of random isotropically distributed matrices are investigated. Both for continuous processes with finite correlation time and discrete sequences of independent matrices, a formalism that allows to…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
We show that the stationary distribution of a finite Markov chain can be expressed as the sum of certain normal distributions. These normal distributions are associated to planar graphs consisting of a straight line with attached loops. The…
In this paper, we are mainly interested in the two questions "which are the commutative rings on which every finitely presented modules is [Formula: see text]-periodic (respectively, [Formula: see text]-periodic)?". It is proved that these…
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an…
A ring is called a commutator ring if every element is a sum of additive commutators. In this paper we give examples of such rings. In particular, we show that given any ring R, a right R-module N, and a set X, End_R(\bigoplus_X N) and…
It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…
We analyze the invariant distributions of continuous-time and discrete-time random walks on randomly weighted complete digraphs. These distributions correspond to the principal left eigenvectors of the associated random Markov generators…
We present a comprehensive study for the statistical properties of random variables that describe the domain structure of a finite Ising chain with nearest-neighbor exchange interactions and free boundary conditions. By use of extensive…