Replica Symmetry in Upper Tails of Mean-Field Hypergraphs

31 Mar 2019 Mukherjee Somabha Bhattacharya Bhaswar B.

Given a sequence of $s$-uniform hypergraphs $\{H_n\}_{n \geq 1}$, denote by $T_p(H_n)$ the number of edges in the random induced hypergraph obtained by including every vertex in $H_n$ independently with probability $p \in (0, 1)$. Recent advances in the large deviations of low complexity non-linear functions of independent Bernoulli variables can be used to show that tail probabilities of $T_p(H_n)$ are precisely approximated by the so-called 'mean-field' variational problem, under certain assumptions on the sequence $\{H_n\}_{n \geq 1}$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • PROBABILITY
  • COMBINATORICS