Related papers: Non-uniform Kahn-Kalai, spread, variants, and appl…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
Let $p_\mathrm{c}$ and $q_\mathrm{c}$ be the threshold and the expectation threshold, respectively, of an increasing family $\mathcal{F}$ of subsets of a finite set $X$, and let $l$ be the size of a largest minimal element of $\mathcal{F}$.…
Due to the applications in network coding, subspace codes and designs have received many attentions. Suppose that $k\mid n$ and $V(n,q)$ is an $n$-dimensional space over the finite field $\mathbb{F}_{q}$. A $k$-spread is a…
Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…
We consider Kac's 1D N-particle system coupled to an ideal thermostat at temperature T, introduced by Bonetto, Loss, and Vaidyanathan in 2014. We obtain a propagation of chaos result for this system, with explicit and uniform-in-time rates…
This paper assumes a robust, in general not dominated, probabilistic framework and provides necessary and sufficient conditions for a bipolar representation of subsets of the set of all quasi-sure equivalence classes of non-negative random…
We prove generic versions of the no-cloning and no-broadcasting theorems, applicable to essentially {\em any} non-classical finite-dimensional probabilistic model that satisfies a no-signaling criterion. This includes quantum theory as well…
Spectral analysis plays a crucial role in high-dimensional statistics, where determining the asymptotic distribution of various spectral statistics remains a challenging task. Due to the difficulties of deriving the analytic form, recent…
This paper introduces a novel quasi-likelihood extension of the generalised Kendall \(\tau_{a}\) estimator, together with an extension of the Kemeny metric and its associated covariance and correlation forms. The central contribution is to…
For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…
This note concerns a well-known result which we term the ``spread lemma,'' which establishes the existence (with high probability) of a desired structure in a random set. The spread lemma was central to two recent celebrated results: (a)…
In the present effort we consider the most general non linear particle kinetics within the framework of the Fokker-Planck picture. We show that the kinetics imposes the form of the generalized entropy and subsequently we demonstrate the…
We make progress on a conjecture of Kahn and Kalai, the original (stronger but less general) version of what became known as the ``Kahn-Kalai Conjecture" (KKC; now a theorem of Park and Pham). This ``second" KKC concerns the threshold,…
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…
Let $u(x)$ be a subpolynomial function in a Hardy field. We establish necessary and sufficient conditions for the weighted uniform distribution of the sequences $(u(n))_{n\in\mathbb{N}}$ and $(u(p_n))_{n\in\mathbb{N}}$, where $p_n$ denotes…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
This paper studies the problem of distributed classification with a network of heterogeneous agents. The agents seek to jointly identify the underlying target class that best describes a sequence of observations. The problem is first…
In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…
Based on Beurling's theory of balayage, we develop the theory of non-uniform sampling in the context of the theory of frames for the settings of the Short Time Fourier Transform and pseudo-differential operators. There is sufficient…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…