該雜志國際簡稱:RANDOM STRUCT ALGOR,是由出版商John Wiley and Sons Ltd出版的一本致力于發(fā)布數(shù)學(xué)研究新成果的的專業(yè)學(xué)術(shù)期刊。該雜志以COMPUTER SCIENCE, SOFTWARE ENGINEERING研究為重點(diǎn),主要發(fā)表刊登有創(chuàng)見的學(xué)術(shù)論文文章、行業(yè)最新科研成果,扼要報(bào)道階段性研究成果和重要研究工作的最新進(jìn)展,選載對學(xué)科發(fā)展起指導(dǎo)作用的綜述與專論,促進(jìn)學(xué)術(shù)發(fā)展,為廣大讀者服務(wù)。該刊是一本國際優(yōu)秀雜志,在國際上有很高的學(xué)術(shù)影響力。
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
Author: Hwang, Hsien-Kuei; Jin, Emma Yu; Schlosser, Michael J.
On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Author: Chang, Yulin; Han, Jie; Thoma, Lubos
Majority dynamics on sparse random graphs
Author: Chakraborti, Debsoumya; Kim, Jeong Han; Lee, Joonkyung; Tran, Tuan
Bounds for Pairs in judicious partitioning of graphs
Author: jfhou
英文介紹
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.