Related papers: Topological expansion in isomorphism theorems betw…
The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…
Here we give brief account of hermitian symplectic spaces, showing that they are intimately connected to symmetric as well as self-adjoint extensions of a symmetric operator. Furthermore we find an explicit parameterisation of the Lagrange…
We consider a generalized Gauss sum supported on matrices over a number field. We evaluate this Gauss sum and relate it to the number of totally isotropic subspaces of related quadratic spaces. Then we consider a further generalization of…
The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and combinatorics of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links…
Temporal multiplexing provides an efficient and scalable approach to realize a quantum random walk with photons that can exhibit topological properties. But two dimensional time-multiplexed topological quantum walks studied so far have…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
Non-Hermiticity enriches the contents of topological classification of matter including exceptional points, bulk-edge correspondence and skin effect. Gain and loss can be described by imaginary diagonal elements in Hamiltonians and the…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
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 survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The…
This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…
In this work, we study a class of random matrices which interpolate between the Wigner matrix model and various types of patterned random matrices such as random Toeplitz, Hankel, and circulant matrices. The interpolation mechanism is…
We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…
We discuss the extension of loop quantum gravity to topspin networks, a proposal which allows topological information to be encoded in spin networks. We will show that this requires minimal changes to the phase space, C*-algebra and Hilbert…
The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of…
The celebrated Borel--Tits theorem provides a classification of abstract isomorphisms between (simple) isotropic groups over fields, showing that such isomorphisms arise from field isomorphisms and group-scheme isomorphisms. In this work,…
The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…