Z-flows in the random environment

In the talk we state, explain, comment, and finally prove a
theorem (proved jointly with Yuval Peled) on the size and the structure
of certain homology groups of random simplicial complexes. The main
purpose of this presentation is to demonstrate that, despite topological
setting, the result can be viewed as a statement on Z-flows in certain
model of random hypergraphs, which can be shown using elementary
algebraic and combinatorial tools.