{"title":"自适应随机图处理中的尖锐阈值","authors":"Calum MacRury, Erlang Surya","doi":"10.1002/rsa.21197","DOIUrl":null,"url":null,"abstract":"Abstract The ‐process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently sampled according to a distribution . The player then selects one edge from , and adds to its current graph. For a fixed monotone increasing graph property , the objective of the player is to force the graph to satisfy in as few steps as possible. The ‐process generalizes both the Achlioptas process and the semi‐random graph process. We prove a sufficient condition for the existence of a sharp threshold for in the ‐process. Using this condition, in the semi‐random process we prove the existence of a sharp threshold when corresponds to being Hamiltonian or to containing a perfect matching. This resolves two of the open questions proposed by Ben‐Eliezer et al. (RSA, 2020).","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"216 2","pages":"0"},"PeriodicalIF":0.9000,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sharp thresholds in adaptive random graph processes\",\"authors\":\"Calum MacRury, Erlang Surya\",\"doi\":\"10.1002/rsa.21197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The ‐process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently sampled according to a distribution . The player then selects one edge from , and adds to its current graph. For a fixed monotone increasing graph property , the objective of the player is to force the graph to satisfy in as few steps as possible. The ‐process generalizes both the Achlioptas process and the semi‐random graph process. We prove a sufficient condition for the existence of a sharp threshold for in the ‐process. Using this condition, in the semi‐random process we prove the existence of a sharp threshold when corresponds to being Hamiltonian or to containing a perfect matching. This resolves two of the open questions proposed by Ben‐Eliezer et al. (RSA, 2020).\",\"PeriodicalId\":54523,\"journal\":{\"name\":\"Random Structures & Algorithms\",\"volume\":\"216 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Structures & Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21197\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/rsa.21197","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Sharp thresholds in adaptive random graph processes
Abstract The ‐process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently sampled according to a distribution . The player then selects one edge from , and adds to its current graph. For a fixed monotone increasing graph property , the objective of the player is to force the graph to satisfy in as few steps as possible. The ‐process generalizes both the Achlioptas process and the semi‐random graph process. We prove a sufficient condition for the existence of a sharp threshold for in the ‐process. Using this condition, in the semi‐random process we prove the existence of a sharp threshold when corresponds to being Hamiltonian or to containing a perfect matching. This resolves two of the open questions proposed by Ben‐Eliezer et al. (RSA, 2020).
期刊介绍:
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.