Related papers: Asymptotic Enumeration of Difference Matrices over…

Correlation functions for matrix ensembles with orthogonal and unitarysymplectic rotation symmetry are more complicated to calculate than in the unitary case. The supersymmetry method and the orthogonal polynomials are two techniques to…

The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…

We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…

In this paper, we focus on the enumeration of permutations by number of cyclic occurrence of peaks and valleys. We find several recurrence relations involving the number of permutations with a prescribed number of cyclic peaks, cyclic…

We briefly review the random matrix theory for large N by N matrices viewed as free random variables in a context of stochastic diffusion. We establish a surprising link between the spectral properties of matrix-valued multiplicative…

We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…

The paper investigates the asymptotic behavior of (non-normalized) traces of certain classes of matrices with non-commutative random variables as entries. We show that, unlike in the commutative framework, the asymptotic behavior of…

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

In the past decade, the use of ordinal patterns in the analysis of time series and dynamical systems has become an important and rich tool. Ordinal patterns (otherwise known as a permutation patterns) are found in time series by taking $n$…

The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Motivated by discrete kinetic models for non-cooperative molecular motors on periodic tracks, we consider random walks (also not Markov) on quasi one dimensional (1d) lattices, obtained by gluing several copies of a fundamental graph in a…

We study the cut-off phenomenon for random walks on free unitary quantum groups coming from quantum conjugacy classes of classical reflections. We obtain in particular a quantum analogue of the result of U. Porod concerning certain mixtures…

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…

This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

We analyze final-time dependent discrete-time quantum walks in one dimension. We compute asymptotics of the return probability of the quantum walk by a path counting approach. Moreover, we discuss a relation between the quantum walk and the…