Related papers: Spectral Independence in High-Dimensional Expander…
We consider spin systems on the integer lattice graph $\mathbb{Z}^d$ with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the…
Let $G$ be a graph on $n$ vertices of maximum degree $\Delta$. We show that, for any $\delta > 0$, the down-up walk on independent sets of size $k \leq (1-\delta)\alpha_c(\Delta)n$ mixes in time $O_{\Delta,\delta}(k\log{n})$, thereby…
We study the universality of spectral statistics of large random matrices. We consider $N\times N$ symmetric, hermitian or quaternion self-dual random matrices with independent, identically distributed entries (Wigner matrices) where the…
We analyse in a systematic way the occurrences of a remarkable structure in the theory of integrable probability that we call a ``max-independence structure'', when random variables are constructed as a maximum of a sequence of independent…
Using the standard concepts of free random variables, we show that for a large class of nonhermitean random matrix models, the support of the eigenvalue distribution follows from their hermitean analogs using a conformal transformation. We…
The problem of uniformly sampling hypergraph independent sets is revisited. We design an efficient perfect sampler for the problem under a condition similar to that of the asymmetric Lov\'asz Local Lemma. When applied to $d$-regular…
We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…
The random-cluster model with parameters $(p,q)$ is a random graph model that generalizes bond percolation ($q=1$) and the Ising and Potts models ($q\geq 2$). We study its Glauber dynamics on $n\times n$ boxes $\Lambda_{n}$ of the integer…
We construct a random matrix model for the bijection \Psi between clas- sical and free infinitely divisible distributions: for every d\geq1, we associate in a quite natural way to each *-infinitely divisible distribution \mu a distribution…
We study an algorithm for approximating the multivariate independence polynomial $Z(\mathbf{z})$, with negative and complex arguments, an object that has strong connections to combinatorics and to statistical physics. In particular, the…
We investigate the asymptotic behavior of the eigenvalues of the sum A+U*BU, where A and B are deterministic N by N Hermitian matrices having respective limiting compactly supported distributions \mu, \nu, and U is a random N by N unitary…
For given two unitary and self-adjoint operators on a Hilbert space, a spectral mapping theorem was proved in \cite{HiSeSu}. In this paper, as an application of the spectral mapping theorem, we investigate the spectrum of a one-dimensional…
This paper introduces the notion of local spectral expansion of a simplicial complex as a possible analogue of spectral expansion defined for graphs. We then show that the condition of local spectral expansion for a complex yields various…
We derive the asymptotic distribution of the spatial Cram'{e}r--von Mises statistic for testing bivariate independence in stationary random fields on $\mathbb{R}^2$ under polynomial $\beta$-mixing dependence, and document the Python…
We present a formula for determining synchronizability in large, randomized and weighted simplicial complexes. This formula leverages eigenratios and costs to assess complete synchronizability under diverse network topologies and intensity…
Assign to each vertex of the one-dimensional torus i.i.d. weights with a heavy-tail of index $\tau-1>0$. Connect then each couple of vertices with probability roughly proportional to the product of their weights and that decays polynomially…
In this paper the question about statistical properties of block--hierarchical random matrices is raised for the first time in connection with structural characteristics of random hierarchical networks obtained by mipmapping procedure. In…
We study the eigenvalue profile of concentration operators (multiplication by an indicator function followed by projection) acting on reproducing kernel Hilbert spaces. The spectral profile of such operators provides a useful notion of…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…