In this work we deal with models of diffusion in networks. Cascade and Threshold models are studied, then "influence aggregation" is defined by means of aggregation functions, t-conorms and co-copulas. Also diffusion maximization in networks is described. Since this is a NP-hard problem, a greedy algorithm and a Shapley-value based algorithm are described in order to approximate the solutions.