Stochastic Block Model
A statistical model for generating random graphs with community structure, in which nodes are partitioned into blocks and edge probabilities differ within and between blocks.
Timeline (last 90 days)
The paper proves the speedup mainly for three classes of instances: formulas with many biased variables, semi-random 2-CNF formulas, and Max-Cut on regular expander graphs and stochastic block model graphs.
The paper applies the algorithm to the Max-Cut problem on graphs generated by regular expander graphs and stochastic block models, and likewise obtains an exponential speedup.
A stochastic block model is a model for generating random graphs with community structure, in which vertices are partitioned into several communities and edges within and between communities are generated randomly with different probabilities.
All Facts (3)
The paper proves the speedup mainly for three classes of instances: formulas with many biased variables, semi-random 2-CNF formulas, and Max-Cut on regular expander graphs and stochastic block model graphs.
50%UnverifiedThe paper applies the algorithm to the Max-Cut problem on graphs generated by regular expander graphs and stochastic block models, and likewise obtains an exponential speedup.
50%UnverifiedA stochastic block model is a model for generating random graphs with community structure, in which vertices are partitioned into several communities and edges within and between communities are generated randomly with different probabilities.
50%