Related papers: A Counterexample to the Generalized Linial-Nisan C…

This is the fifth 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…

In our companion paper \cite{Stojnicgscomp16} we introduce a collection of fairly powerful statistical comparison results. They relate to a general comparison concept and its an upgrade that we call lifting procedure. Here we provide a…

We prove the Gan-Gross-Prasad conjecture for $\left(\mathrm{U}\left(2n\right),\mathrm{U}\left(1\right)\right)$ in general and prove its refinement, namely the Ichino-Ikeda type explicit formula for the central $L$-values, under certain…

We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…

Let $G$ be an arbitrary finite group. The McKay conjecture asserts that $G$ and the normaliser $N_G (P)$ of a Sylow $p$-subgroup $P$ in $G$ have the same number of characters of degree not divisible by $p$ (that is, of $p'$-degree). We…

Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. However, their predictions are often not interpretable. Post-hoc instance-level explanation methods have been proposed…

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…

The accurate predictions and principled uncertainty measures provided by GP regression incur O(n^3) cost which is prohibitive for modern-day large-scale applications. This has motivated extensive work on computationally efficient…

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

An almost perfect nonlinear (APN) function (necessarily a polynomial function) on a finite field $\mathbb{F}$ is called exceptional APN, if it is also APN on infinitely many extensions of $\mathbb{F}$. In this article we consider the most…

We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…

We derive nearly sharp bounds for the bidirectional GAN (BiGAN) estimation error under the Dudley distance between the latent joint distribution and the data joint distribution with appropriately specified architecture of the neural…

This note reports partial results related to the Gaussian product inequality (GPI) conjecture for the joint distribution of traces of Wishart matrices. In particular, several GPI-related results from Wei (2014) and Liu et al. (2015) are…

The p-adic local Langlands correspondence for GL2(Qp) attaches to any 2-dimensional irreducible p-adic representation V of the absolute Galois groups of Qp an admissible unitary representation Pi(V) of GL2(Qp). The unitary principal series…

To a higher Landau Level corresponds a generalization of the Poisson distribution arising from generalized coherent states. In this paper, we write down the atomic decomposition of this probability measure and expressed its weights through…

Recent work has shown that the prior over functions induced by a deep Bayesian neural network (BNN) behaves as a Gaussian process (GP) as the width of all layers becomes large. However, many BNN applications are concerned with the BNN…

In this paper, we take a closer look at Czerwinski's "${\rm P}\neq{\rm NP}$ relative to a ${\rm P}$-complete oracle" [Cze23]. There are (uncountably) infinitely-many relativized worlds where ${\rm P}$ and ${\rm NP}$ differ, and it is…

Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…

We prove that the length of any gap in the differential grading of the Khovanov homology of any quasi-alternating link is one. As a consequence, we obtain that the length of any gap in the Jones polynomial of any such link is one. This…