Complex networks are ubiquitous to represent real systems in many contexts, such as social networks, computer networks, or biological networks, among others. Most of the real-world networks exhibit non-trivial topological features, and the interest in analyzing their properties has resulted in the emergence of random models to generate them. Probabilistic models are, in general, based on the probability of each edge to occur, and the topology of the network is the consequence of such a probability distribution. In deep generative approaches, a model is trained to learn the features of a training set of examples and generate new networks with similar properties. In this seminar we will review a (non-exhaustive) list of random models of complex networks generation, and analyze how these models can be applied to another challenging problem: the generation of realistic random SAT instances.