Related papers: Random Affine Lattices
This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…
We give a sharp upper bound on the multiplicity of a fake weighted projective space with at worst canonical singularities. This is equivalent to giving a sharp upper bound on the index of the sublattice generated by the vertices of a…
We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…
This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
We consider random Gaussian eigenfunctions of the Laplacian on the three-dimensional flat torus, and investigate the number of nodal intersections against a straight line segment. The expected intersection number, against any smooth curve,…
The geometric properties of a lattice can have profound consequences on its band spectrum. For example, symmetry constraints and geometric frustration can give rise to topologicially nontrivial and dispersionless bands, respectively.…
Consider a symmetric (finite) matrix ensemble, with a certain probability distribution. What is the probability that the spectrum belongs to a certain interval or union of intervals on the real line? In this paper, we show that, upon…
We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…
Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…
A set of binary random variables indexed by a lattice torus is considered. Under a mixing hypothesis, the probability of any proposition belonging to the first order logic of colored graphs tends to 0 or 1, as the size of the lattice tends…
We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard two-dimensional flat torus ("arithmetic random waves") with a fixed real-analytic reference curve with nonvanishing curvature. The…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
We estimate from below the expected Betti numbers of real hypersurfaces taken at random in a smooth real projective n-dimensional manifold. These random hypersurfaces are chosen in the linear system of a large d-th power of a real ample…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
We study torus bundles with affine structure groups. First, we establish a rigidity result under constraints on the first Betti numbers: If $ \text{b}_{1}(M)-\text{b}_{1}(N)=\dim M-\dim N $ holds for a torus bundle $M$ with an affine…
We consider the Norros-Reittu random graph $NR_n(\textbf{w})$, where edges are present independently but edge probabilities are moderated by vertex weights, and use probabilistic arguments based on martingales to analyse the component sizes…