雜志介紹

Random Structures & Algorithms雜志介紹

《Random Structures & Algorithms》是一本以English為主的未開放獲取國際優(yōu)秀期刊，中文名稱隨機結(jié)構(gòu)和算法，本刊主要出版、報道數(shù)學(xué)-COMPUTER SCIENCE, SOFTWARE ENGINEERING領(lǐng)域的研究動態(tài)以及在該領(lǐng)域取得的各方面的經(jīng)驗和科研成果，介紹該領(lǐng)域有關(guān)本專業(yè)的最新進(jìn)展，探討行業(yè)發(fā)展的思路和方法，以促進(jìn)學(xué)術(shù)信息交流，提高行業(yè)發(fā)展。該刊已被國際權(quán)威數(shù)據(jù)庫SCIE收錄，為該領(lǐng)域相關(guān)學(xué)科的發(fā)展起到了良好的推動作用，也得到了本專業(yè)人員的廣泛認(rèn)可。該刊最新影響因子為0.9，最新CiteScore 指數(shù)為2.5。

本刊近期中國學(xué)者發(fā)表的論文主要有：

• 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.