Related papers: Pointwise Weyl law for graphs from quantized inter…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
We study the spectrum of quantized open maps, as a model for the resonance spectrum of quantum scattering systems. We are particularly interested in open maps admitting a fractal repeller. Using the ``open baker's map'' as an example, we…
We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…
We use the theory of Berezin-Toeplitz operators of Ma and Marinescu to study the spaces of holomorphic sections of a prequantizing line bundle over compact K\"ahler manifolds under deformations of the complex structure. We show that the…
Random Matrix Theory is a powerful tool in applied mathematics. Three canonical models of random matrix distributions are the Gaussian Orthogonal, Unitary and Symplectic Ensembles. For matrix ensembles defined on k-fold tensor products of…
Given a m-dimensional Gaussian process and polynomial m variables with real coefficients, we calculate the induced path odered exponenial in two different ways: one is purely algebraic in spirit and the other one is diagrammatic in spirit…
We take inspiration from the Okounkov-Vershik approach to the representation theory of the symmetric groups to develop a new way of understanding how the Schur-Weyl duality can be used to perform the Quantum Schur Transform. The Quantum…
A method for successive synthesis of a Weyl matrix (or Dirichlet-to-Neumann map) of an arbitrary quantum tree is proposed. It allows one, starting from one boundary edge, to compute the Weyl matrix of a whole quantum graph by adding on new…
We prove a scaling limit result for random walk on certain random planar maps with its natural time parametrization. In particular, we show that for $\gamma \in (0,2)$, the random walk on the mated-CRT map with parameter $\gamma$ converges…
We propose point estimators for the three-parameter (location, scale, and the fractional parameter) variant distributions generated by a Wright function. We also provide uncertainty quantification procedures for the proposed point…
We present a new family of quantum Weyl algebras where the polynomial part is the quantum analog of functions on homogeneous spaces corresponding to symmetric matrices, skew symmetric matrices, and the entire space of matrices of a given…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
The Wegner orbital model is a class of random operators introduced by Wegner to model the motion of a quantum particle with many internal degrees of freedom (orbitals) in a disordered medium. We consider the case when the matrix potential…
Belov-Kanel and Kontsevich conjectured that the group of automorphisms of the n'th Weyl algebra and the group of polynomial symplectomorphisms of C^2 are canonically isomorphic. We discuss how this conjecture can be approached by means of…
The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…
The paper proves several limit theorems for linear eigenvalue statistics of overlapping Wigner and sample covariance matrices. It is shown that the covariance of the limiting multivariate Gaussian distribution is diagonalized by choosing…
We perform a phase space analysis of evolution equations associated with the Weyl quantization $q^{\mathrm{w}}$ of a complex quadratic form $q$ on $\mathbb{R}^{2d}$ with non-positive real part. In particular, we obtain pointwise bounds for…
We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights to the edges of the complete graph over n vertices and normalizing by the corresponding row sum. The weights are assumed to be in the domain…
Given a family of graphs $\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\mathcal{F}$. The threshold for the classic Ramsey…
Given a graph $G=(V,E)$ on $n$ vertices and an integer $k$ between 1 and $n-1$, the $k$-token graph $F_k(G)$ has vertices representing the $k$-subsets of $V$, and two vertices are adjacent if their symmetric difference is the two…