2 problems

0 votes0 replies0 views
Conjecture on pairwise cliques and induced higher-order behaviors in random hypergraphs
Let $P_M^r$ and $P_M^s$ denote the distributions of a measure $M$ for random nodes and hyperedges, respectively, and let $\delta(P_M)=\delta(P_M^r,P_M^s)$ . For simplices, write…
Conjectureopencontagion-dynamics higher-order-networks random-hypergraphsarXiv posted 2 days ago
0 votes0 replies1 view
The computational gap conjecture for higher-order network parameter estimation
Computational gap conjecture. When the MLE fails to exist, there is an intrinsic gap between the information-theoretic lower bound on estimation risk and the performance achievable…
Conjectureopendifferential-privacy higher-order-networks statistical-computationarXiv posted 2 days ago

Conjecture on pairwise cliques and induced higher-order behaviors in random hypergraphs