2019/10/01 by Bläsius, Thomas, Friedrich, Tobias, Schirneck, Martin
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
paper · doi:10.48550/arxiv.1910.00308
We investigate the maximum-entropy model Bn,m,p for random n-vertex, m-edge multi-hypergraphs with expected edge size pn. We show that the expected size of the minimization of Bn,m,p, i.e., the number of its inclusion-wise minimal edges, undergoes a phase transition with respect to m. If m is at most 1/(1-p)(1-p)n, then the minimization is of size Θ(m). Beyond that point, for α such that m = 1/(1-p)αn and H being the entropy function, it is Θ(1) ⋅ min (1, \frac1(α - (1-p)) √(1 - α) n) ⋅ 2(H(α) + (1-α) log2 p) n. This implies that the maximum expected size over all m is Θ((1+p)n/√(n)). Our structural findings have algorithmic implications for minimizing an input hypergraph, which in turn has applications in the profiling of relational databases as well as for the Orthogonal Vectors problem studied in fine-grained complexity. The main technical tool is an improvement of the Chernoff--Hoeffding inequality, which we make tight up to constant factors. We show that for a binomial variable X ∼ Bin(n,p) and real number 0 < x ≤ p, it holds that P[X ≤ xn] = Θ(1) ⋅ min (1, (1)/((p-x) √(xn))) ⋅ 2^- D(x ‖ p) n, where D denotes the Kullback--Leibler divergence between Bernoulli distributions. The result remains true if x depends on n as long as it is bounded away from 0.