  In this paper, we present a stochastic forward-backward-half forward
splitting algorithm with variance reduction for solving the structured monotone
inclusion problem composed of a maximally monotone operator, a maximally
monotone and Lipschitz continuous operator and a cocoercive operator. By
defining a Lyapunov function, we establish the almost sure convergence of the
proposed algorithm, and obtain the linear convergence when one of the maximally
monotone operators is strongly monotone. Numerical examples are provided to
show the performance of the proposed algorithm.
