Related papers: Toric Symplectic Geometry and Full Spark Frames
We introduce a random matrix framework for studying statistical-mechanical lattice systems through spectral observables. Equilibrium configurations sampled from a Boltzmann measure are mapped to matrix ensembles whose covariance structure…
Symplectic maps can provide a straightforward and accurate way to visualize and quantify the dynamics of conservative systems with two degrees of freedom. These maps can be easily iterated from the simplest computers to obtain trajectories…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…
We study ensembles of sparse random block matrices generated from the adjacency matrix of a Erd\"os-Renyi random graph with $N$ vertices of average degree $Z$, inserting a real symmetric $d \times d$ random block at each non-vanishing…
The theory of $D$-norms is an offspring of multivariate extreme value theory. We present recent results on $D$-norms, which are completely determined by a certain random vector called generator. In the first part it is shown that the space…
We study the dynamics in the neighborhood of fixed points in a 4D symplectic map by means of the color and rotation method. We compare the results with the corresponding cases encountered in galactic type potentials and we find that they…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…
The general aim of manifold estimation is reconstructing, by statistical methods, an $m$-dimensional compact manifold $S$ on ${\mathbb R}^d$ (with $m\leq d$) or estimating some relevant quantities related to the geometric properties of $S$.…
Probabilistic separation logic offers an approach to reasoning about imperative probabilistic programs in which a separating conjunction is used as a mechanism for expressing independence properties. Crucial to the effectiveness of the…
The gap probability generating function has as its coefficients the probability of an interval containing exactly $k$ eigenvalues. For scaled random matrices with orthogonal symmetry, and the interval at the hard or soft spectrum edge, the…
The main purpose of this paper is to propose an ergodic theoretic approach to the study of entire holomorphic curves. Brody curves are one-Lipschitz holomorphic maps from the complex plane to the complex projective space. They naturally…
Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
Pseudospectral analysis serves as a powerful tool in matrix computation and the study of both linear and nonlinear dynamical systems. Among various numerical strategies, random sampling, especially in the form of rank-$1$ perturbations,…
Symplectic and Poisson structures of certain moduli spaces/Huebschmann,J./ Abstract: Let $\pi$ be the fundamental group of a closed surface and $G$ a Lie group with a biinvariant metric, not necessarily positive definite. It is shown that a…
A new method involving particle diagrams is introduced and developed into a rigorous framework for carrying out embedded random matrix calculations. Using particle diagrams and the attendant methodology including loop counting it becomes…
Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…
We consider the problem of rescaling the lengths of a finite frame thereby transforming it into a tight one. Such frames are called scalable and have received a lot of attention in recent years. In this note we investigate the question in…
Symmetry is usually defined via transformations described by a (higher) group. But a symmetry really corresponds to an algebra of local symmetric operators, which directly constrains the properties of the system. In this paper, we point out…