Related papers: On a tracial version of Haemers bound

We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…

We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…

The independence number $\alpha(H)$ of a hypergraph $H$ is the maximum cardinality of a set of vertices of $H$ that does not contain an edge of $H$. Generalizing Shearer's classical lower bound on the independence number of triangle-free…

This is the third in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

The {\em independence ratio} of a graph $G$ is defined by \[ \iota(G) := \sup_{X \subset V(G)} \frac{|X|}{\alpha(X)},\] where $\alpha(X)$ is the independence number of the subgraph of $G$ induced by $X$. The independence ratio is a…

The inertia bound, introduced by Cvetkovi\'c in 1971, is a fundamental result in spectral graph theory that provides an upper bound for the independence number of a graph in terms of spectral information about a weighted adjacency matrix of…

For many functions of matrices $f(A)$, it is known that their entries exhibit a rapid -- often exponential or even superexponential -- decay away from the sparsity pattern of the matrix $A$. In this paper we specifically focus on the class…

The main result of this paper is a quantified version of Ingham's Tauberian theorem for bounded vector-valued sequences rather than functions. It gives an estimate on the rate of decay of such a sequence in terms of the behaviour of a…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely,…

For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…

When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…

Let $\mathbf{G}$ be a reductive group and $\mathbf{X}$ a spherical $\mathbf{G}$-variety over a local non-archimedean field $\mathbb{F}$. We denote by $S(\mathbf{X}(\mathbb{F}))$ the Schwartz-functions on $\mathbf{X}(\mathbb{F})$. In this…

In this paper we remark that Shannon entropy can be expressed as a function of the self-information (i.e. the logarithm) and the inverse of the Lambert $W$ function. It means that we consider that Shannon entropy has the trace form: $-k…

We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…

We propose an asymptotic expansion formula for matrix integrals, including oscillatory terms (derivatives of theta-functions) to all orders. This formula is heuristically derived from the analogy between matrix integrals, and formal matrix…

We prove an asymptotic formula for the Euler characteristic of Kontsevich's commutative graph complex. This formula implies that the total amount of commutative graph homology grows super-exponentially with the rank and, via a theorem of…

The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…

Directed and undirected graphical models, also called Bayesian networks and Markov random fields, respectively, are important statistical tools in a wide variety of fields, ranging from computational biology to probabilistic artificial…