RANDOM STRUCTURES & ALGORITHMS

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.

这本杂志的目的是为了满足两个主要的目标:涵盖离散随机结构的最新研究，并提出这种研究在组合学和计算机科学中的应用问题。其目标是为当前大量研究提供一个自然的家，并为未来随机研究提供一个有用的论坛。结果涉及随机图、超图、拟阵、树、映射、排列、矩阵、集和序，以及随机图过程和网络，特别强调在组合学中使用保罗·鄂尔多斯开发的概率方法。该杂志侧重于概率算法，确定性算法的平均案例分析，以及概率方法在密码学、数据结构、搜索和排序中的应用。该杂志还致力于概率论的渗透、随机游动和概率论的组合等领域。