6 problems
Information-order conjecture. If the nodes which have more information communicate first, then this brings down the overall communication complexity.
Zero-one law conjecture for k-connectivity. Under this scaling,
One-law conjecture for k-connectivity. If the one-law holds for the minimum node degree being at least , then the one-law for -connectivity is identical: under…
Asymptotic independence conjecture. The fluctuations of and under are asymptotically independent; consequently, the false-alarm c…
Finite-memory analogy conjecture. The reduction in sensing capacity caused by contiguous sensor fields of view is similar to the inferior performance of channel codes that have fin…
Weighted-sum distinguishability conjecture. The higher sensing capacity of a weighted sum than an un-weighted sum occurs because a weighted sum can distinguish among more target co…