3 problems

0 votes0 replies0 views
Submodularity conjecture for influence in social networks
Influence submodularity conjecture. The function $\sigma$ is submodular.
Conjectureopeninfluence-maximization social-networks submodularityarXiv posted 2 days ago
0 votes0 replies0 views
Conjecture on network-size-independent convergence complexity of the CDS method
Let $n$ be the network size, and consider the complexity of (iib), namely, the number of evaluations required for convergence divided by the size of the feasible discrete neighborh…
Conjectureopeninfluence-maximization information-propagation network-optimizationarXiv posted 2 days ago
0 votes0 replies1 view
Conjecture on the tightness of the online influence maximization regret bound
Tightness conjecture. This regret bound is at most $\widetilde{\mathcal{O}}(\sqrt{|\mathcal{E}|d})$ away from being tight.
Conjectureopenbandits influence-maximization online-learningarXiv posted 2 days ago

Submodularity conjecture for influence in social networks