這本雜志的目的是為了滿足兩個主要的目標(biāo):涵蓋離散隨機結(jié)構(gòu)的最新研究，并提出這種研究在組合學(xué)和計算機科學(xué)中的應(yīng)用問題。其目標(biāo)是為當(dāng)前大量研究提供一個自然的家，并為未來隨機研究提供一個有用的論壇。結(jié)果涉及隨機圖、超圖、擬陣、樹、映射、排列、矩陣、集和序，以及隨機圖過程和網(wǎng)絡(luò)，特別強調(diào)在組合學(xué)中使用保羅·鄂爾多斯開發(fā)的概率方法。該雜志側(cè)重于概率算法，確定性算法的平均案例分析，以及概率方法在密碼學(xué)、數(shù)據(jù)結(jié)構(gòu)、搜索和排序中的應(yīng)用。該雜志還致力于概率論的滲透、隨機游動和概率論的組合等領(lǐng)域。

It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness.Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erd?s. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.