Random discrete structures, as they occur in computer science, discrete mathematics, probability theory, statistical physics, or biology, form the recurring theme of the « journées ALEA ». An essential motivation is the analysis of algorithms, following Don Knuth and Philippe Flajolet, analysis that leads more specifically to the study of different models of trees, words, paths, or graphs. In the program for the 2015 installment, there are 3 short series of lectures respectively on q-series (by Sylvie Corteel), integrables systems (by Philippe Di Francesco), and on the objective method (by Charles Bordenave). A small number of invited conferences on the analysis of algorithms and other up-cited themes are also scheduled, more precisions are to follow as soon as possible.