相关论文: Kronecker Product Graphs and Counting Walks in Res…
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…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
We propose a formula for the enumeration of closed lattice random walks of length $n$ enclosing a given algebraic area. The information is contained in the Kreft coefficients which encode, in the commensurate case, the Hofstadter secular…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
We propose an experimental mathematics approach leading to the computer-driven discovery of various structural properties of general counting functions coming from enumeration of walks.
The relationships between eigenvalues and eigenvectors of a product graph and those of its factor graphs have been known for the standard products, while characterization of Laplacian eigenvalues and eigenvectors of the Kronecker product of…
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
We develop two applications of the Kronecker's limit formula associated to elliptic Eisenstein series: A factorization theorem for holomorphic modular forms, and a proof of Weil's reciprocity law. Several examples of the general…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
We present general algorithms (fully implemented in Maple) for calculations of various quantities related to constrained directed walks for a general set of steps on the square lattice in two dimensions. As a special case, we rederive…
We focus on the algebraic area probability distribution of planar random walks on a square lattice with $m_1$, $m_2$, $l_1$ and $l_2$ steps right, left, up and down. We aim, in particular, at the algebraic area generating function…
Returning walks on a lattice are sequences of moves that start at a given lattice site and return to the same site after $n$ steps. Determining the total number of returning walks of a given length $n$ is a typical graph-theoretical problem…
Kronecker product covariance structure provides an efficient way to modeling the inter-correlations of matrix-variate data. In this paper, we propose testing statistics for Kronecker product covariance matrix based on linear spectral…
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove…
We relate the $m$-truncated Kronecker products of symmetric functions to the semi-invariant rings of a family of quiver representations. We find cluster algebra structures for these semi-invariant rings when $m=2$. Each {\sf g}-vector cone…
New bounds are derived for the eigenvalues of sums of Kronecker products of square matrices by relating the corresponding matrix expressions to the covariance structure of suitable bi-linear stochastic systems in discrete and continuous…
The Kronecker product is an invaluable tool for data-sparse representations of large networks and matrices with countless applications in machine learning, graph theory and numerical linear algebra. In some instances, the sparsity pattern…
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, computer science). The aim of this paper is to propose a new approach to obtain some…
We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…
This paper proposes methods for likelihood-based inference in multivariate linear regressions when the correlation matrix of the responses is separable; that is, it has a Kronecker product structure, but the variances are unrestricted. The…