当前期刊: Random Structures & Algorithms Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • On the probabilistic degree of OR over the reals
    Random Struct. Algorithms (IF 1.047) Pub Date : 2021-01-19
    Siddharth Bhandari; Prahladh Harsha; Tulasimohan Molli; Srikanth Srinivasan

    We study the probabilistic degree over of the OR function on n variables. For , the ‐error probabilistic degree of any Boolean function f : {0, 1}n → {0, 1} over is the smallest nonnegative integer d such that the following holds: there exists a distribution P of polynomials of degree at most d such that for all , we have . It is known from the works of Tarui (Theoret. Comput. Sci. 1993) and Beigel

    更新日期:2021-01-19
  • The number of satisfying assignments of random 2‐SAT formulas
    Random Struct. Algorithms (IF 1.047) Pub Date : 2021-01-17
    Dimitris Achlioptas; Amin Coja‐Oghlan; Max Hahn‐Klimroth; Joon Lee; Noëla Müller; Manuel Penschuck; Guangyan Zhou

    We show that throughout the satisfiable phase the normalized number of satisfying assignments of a random 2‐SAT formula converges in probability to an expression predicted by the cavity method from statistical physics. The proof is based on showing that the Belief Propagation algorithm renders the correct marginal probability that a variable is set to “true” under a uniformly random satisfying assignment

    更新日期:2021-01-18
  • Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
    Random Struct. Algorithms (IF 1.047) Pub Date : 2021-01-11
    Nobutaka Shimizu; Takeharu Shiraga

    This is concerned with voting processes on graphs where each vertex holds one of two different opinions. In particular, we study the Best‐of‐two and the Best‐of‐three. Here at each synchronous round, each vertex updates its opinion to match the majority among the opinions of two random neighbors and itself (the Best‐of‐two) or the opinions of three random neighbors (the Best‐of‐three). In this study

    更新日期:2021-01-11
  • The size‐Ramsey number of short subdivisions
    Random Struct. Algorithms (IF 1.047) Pub Date : 2021-01-11
    Nemanja Draganić; Michael Krivelevich; Rajko Nenadov

    The r‐size‐Ramsey number of a graph H is the smallest number of edges a graph G can have such that for every edge‐coloring of G with r colors there exists a monochromatic copy of H in G. For a graph H, we denote by Hq the graph obtained from H by subdividing its edges with q − 1 vertices each. In a recent paper of Kohayakawa, Retter and Rödl, it is shown that for all constant integers q, r ≥ 2 and

    更新日期:2021-01-11
  • On the upper tail problem for random hypergraphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-08
    Yang P. Liu; Yufei Zhao

    The upper tail problem in a random graph asks to estimate the probability that the number of copies of some fixed subgraph in an Erdős‐Rényi random graph exceeds its expectation by some constant factor. There has been much exciting recent progress on this problem. We study the corresponding problem for hypergraphs, for which less is known about the large deviation rate. We present new phenomena in

    更新日期:2021-01-11
  • Dynamic concentration of the triangle‐free process
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-17
    Tom Bohman; Peter Keevash

    The triangle‐free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal triangle‐free graph at which the triangle‐free process terminates. We also bound the independence number of this graph, which gives an improved lower bound on the Ramsey

    更新日期:2021-01-11
  • On some graph densities in locally dense graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-24
    Joonkyung Lee

    The Kohayakawa–Nagle–Rödl‐Schacht conjecture roughly states that every sufficiently large locally d‐dense graph G on n vertices must contain at least (1 − o(1))d|E(H )|n|V (H )| copies of a fixed graph H. Despite its important connections to both quasirandomness and Ramsey theory, there are very few examples known to satisfy the conjecture. We provide various new classes of graphs that satisfy the

    更新日期:2021-01-11
  • A randomized construction of high girth regular graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-18
    Nati Linial; Michael Simkin

    We describe a new random greedy algorithm for generating regular graphs of high girth: Let k ≥ 3 and c ∈ (0, 1) be fixed. Let ℕ be even and set . Begin with a Hamilton cycle G on n vertices. As long as the smallest degree , choose, uniformly at random, two vertices u, v ∈ V(G) of degree whose distance is at least g − 1. If there are no such vertex pairs, abort. Otherwise, add the edge uv to E(G). We

    更新日期:2021-01-11
  • On the Littlewood‐Offord problem for arbitrary distributions
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-03
    Tomas Juškevičius; Valentas Kurauskas

    Let X1, … , Xn be independent identically distributed discrete random vectors in . We consider upper bounds on under various restrictions on Xi and weights ai. When , this corresponds to the classical Littlewood‐Offord problem. We prove that in general for identically distributed random vectors and even values of n the optimal choice for (ai) is ai = 1 for and ai = −1 for , regardless of the distribution

    更新日期:2021-01-11
  • Topological embeddings into random 2‐complexes
    Random Struct. Algorithms (IF 1.047) Pub Date : 2021-01-06
    Michael Farber; Tahl Nowik

    We consider 2‐dimensional random simplicial complexes Y in the multiparameter model. We establish the multiparameter threshold for the property that every 2‐dimensional simplicial complex S admits a topological embedding into Y asymptotically almost surely. Namely, if in the procedure of the multiparameter model on n vertices, each i‐dimensional simplex is taken with probability pi = pi(n), then the

    更新日期:2021-01-06
  • Phase transition for the volume of high‐dimensional random polytopes
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-12-28
    Gilles Bonnet; Zakhar Kabluchko; Nicola Turchi

    The beta polytope is the convex hull of n i.i.d. random points distributed in the unit ball of according to a density proportional to if (in particular, corresponds to the uniform distribution in the ball), or uniformly on the unit sphere if . We show that the expected normalized volumes of high‐dimensional beta polytopes exhibit a phase transition and we describe its shape. We derive analogous results

    更新日期:2020-12-28
  • On Bollobás‐Riordan random pairing model of preferential attachment graph
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-12-28
    Boris Pittel

    Bollobás‐Riordan random pairing model of a preferential attachment graph is studied. Let {Wj}j ≤ mn + 1 be the process of sums of independent exponentials with mean 1. We prove that the degrees of the first vertices are jointly, and uniformly, asymptotic to , and that with high probability (whp) the smallest of these degrees is , at least. Next we bound the probability that there exists a pair of large

    更新日期:2020-12-28
  • Permutations avoiding a pattern of length three under Mallows distributions
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-12-26
    Ross G. Pinsky

    We consider permutations avoiding a pattern of length three under the family of Mallows distributions. In particular, for any pattern , we obtain rather precise results on the asymptotic probability as n → ∞ that a permutation under the Mallows distribution with parameter q ∈ (0, 1) avoids the pattern. By a duality between the parameters q and , we also obtain rather precise results on the above probability

    更新日期:2020-12-27
  • Long cycle of random permutations with polynomially growing cycle weights
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-12-22
    Dirk Zeindler

    We study random permutations of n objects with respect to multiplicative measures with polynomial growing cycle weights. We determine in this paper the asymptotic behavior of the long cycles under this measure and also prove that the cumulative cycle numbers converge in the region of the long cycles to a Poisson process.

    更新日期:2020-12-22
  • Sets without k‐term progressions can have many shorter progressions
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-12-15
    Jacob Fox; Cosmin Pohoata

    Let fs, k(n) be the maximum possible number of s‐term arithmetic progressions in a set of n integers which contains no k‐term arithmetic progression. For all fixed integers k > s ≥ 3, we prove that fs, k(n) = n2 − o(1), which answers an old question of Erdős. In fact, we prove upper and lower bounds for fs, k(n) which show that its growth is closely related to the bounds in Szemerédi's theorem.

    更新日期:2020-12-16
  • Testing linear inequalities of subgraph statistics
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-12-02
    Lior Gishboliner; Asaf Shapira; Henrique Stagni

    Property testers are fast randomized algorithms whose task is to distinguish between inputs satisfying some predetermined property and those that are far from satisfying it. A landmark result of Alon et al. states that for any finite family of graphs , the property of being induced ‐free (i.e., not containing an induced copy of any ) is testable. Goldreich and Shinkar conjectured that one can extend

    更新日期:2020-12-03
  • Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-28
    Jie Han; Patrick Morris; Andrew Treglown

    A perfect Kr‐tiling in a graph G is a collection of vertex‐disjoint copies of Kr that together cover all the vertices in G. In this paper we consider perfect Kr‐tilings in the setting of randomly perturbed graphs; a model introduced by Bohman, Frieze, and Martin [7] where one starts with a dense graph and then adds m random edges to it. Specifically, given any fixed we determine how many random edges

    更新日期:2020-12-01
  • Outliers in spectrum of sparse Wigner matrices
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-27
    Konstantin Tikhomirov; Pierre Youssef

    In this paper, we study the effect of sparsity on the appearance of outliers in the semi‐circular law. Let be a sequence of random symmetric matrices such that each Wn is n × n with i.i.d. entries above and on the main diagonal equidistributed with the product , where is a real centered uniformly bounded random variable of unit variance and bn is an independent Bernoulli random variable with a probability

    更新日期:2020-12-01
  • Node profiles of symmetric digital search trees: Concentration properties
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-24
    Michael Drmota; Michael Fuchs; Hsien‐Kuei Hwang; Ralph Neininger

    We give a detailed asymptotic analysis of the profiles of random symmetric digital search trees, which are in close connection with the performance of the search complexity of random queries in such trees. While the expected profiles have been analyzed for several decades, the analysis of the variance turns out to be very difficult and challenging, and requires the combination of several different

    更新日期:2020-11-25
  • Finding maximum matchings in random regular graphs in linear expected time
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-11-24
    Michael Anastos; Alan Frieze

    In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has received less attention. Empirical results by Karp and Sipser suggest that the first algorithm is superior. In this paper we show that this is indeed the case, at least

    更新日期:2020-11-25
  • Local limit theorems for occupancy models
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-09-27
    A. D. Barbour; Peter Braunsteins; Nathan Ross

    We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both Stein's method for distributional approximation and Stein's method for concentration. As applications, we prove local central limit theorems with rate of convergence for

    更新日期:2020-11-17
  • A probabilistic approach to the leader problem in random graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-15
    Louigi Addario‐Berry; Shankar Bhamidi; Sanchayan Sen

    We study the fixation time of the identity of the leader, that is, the most massive component, in the general setting of Aldous's multiplicative coalescent, which in an asymptotic sense describes the evolution of the component sizes of a wide array of near‐critical coalescent processes, including the classical Erdős‐Rényi process. We show tightness of the fixation time in the “Brownian” regime, explicitly

    更新日期:2020-11-17
  • Partial resampling to approximate covering integer programs†
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-09-27
    Antares Chen; David G. Harris; Aravind Srinivasan

    We consider column‐sparse covering integer programs, a generalization of set cover. We develop a new rounding scheme based on the partial resampling variant of the Lovász Local Lemma developed by Harris and Srinivasan. This achieves an approximation ratio of , where amin is the minimum covering constraint and is the maximum ℓ1‐norm of any column of the covering matrix A (whose entries are scaled to

    更新日期:2020-11-17
  • Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-03
    Jean‐François Delmas; Jean‐Stéphane Dhersin; Marion Sciauveau

    We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. This result is a first step for giving a nonparametric test for identifying the degree function of a large random graph. Replacing the indicator function in the empirical CDF by a smoother function

    更新日期:2020-11-17
  • Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-16
    Michael Anastos; Alan Frieze

    In this paper we consider the existence of Hamilton cycles in the random graph . This random graph is chosen uniformly from , the set of graphs with vertex set [n], m edges and minimum degree at least 3. Our ultimate goal is to prove that if m = cn and c > 3/2 is constant then G is Hamiltonian w.h.p. In Frieze (2014), the second author showed that c ≥ 10 is sufficient for this and in this paper we

    更新日期:2020-10-30
  • On‐line balancing of random inputs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-08-25
    Nikhil Bansal; Joel H. Spencer

    We consider an online vector balancing game where vectors vt, chosen uniformly at random in {− 1, + 1}n, arrive over time and a sign xt ∈ {− 1, + 1} must be picked immediately upon the arrival of vt. The goal is to minimize the L∞ norm of the signed sum . We give an online strategy for picking the signs xt that has value O(n1/2) with high probability. Up to constants, this is the best possible even

    更新日期:2020-10-30
  • Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-09-27
    Omri Ben‐Eliezer; Lior Gishboliner; Dan Hefetz; Michael Krivelevich

    In this paper, we study the following recently proposed semi‐random graph process: starting with an empty graph on n vertices, the process proceeds in rounds, where in each round we are given a uniformly random vertex v, and must immediately (in an online manner) add to our graph an edge incident with v. The end goal is to make the constructed graph satisfy some predetermined monotone graph property

    更新日期:2020-10-30
  • Characterization of quasirandom permutations by a pattern sum
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-08-27
    Timothy F. N. Chan; Daniel Král'; Jonathan A. Noel; Yanitsa Pehova; Maryam Sharifzadeh; Jan Volec

    It is known that a sequence of permutations is quasirandom if and only if the pattern density of every 4‐point permutation in converges to 1/24. We show that there is a set S of 4‐point permutations such that the sum of the pattern densities of the permutations from S in the permutations converges to if and only if the sequence is quasirandom. Moreover, we are able to completely characterize the sets

    更新日期:2020-10-30
  • Ramsey games near the critical threshold
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-17
    David Conlon; Shagnik Das; Joonkyung Lee; Tamás Mészáros

    A well‐known result of Rödl and Ruciński states that for any graph H there exists a constant C such that if , then the random graph Gn, p is a.a.s. H‐Ramsey, that is, any 2‐coloring of its edges contains a monochromatic copy of H. Aside from a few simple exceptions, the corresponding 0‐statement also holds, that is, there exists c > 0 such that whenever the random graph Gn, p is a.a.s. not H‐Ramsey

    更新日期:2020-10-30
  • Short proofs of some extremal results III
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-08-30
    David Conlon; Jacob Fox; Benny Sudakov

    We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are reasonably short.

    更新日期:2020-10-30
  • Vertex Ramsey properties of randomly perturbed graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-14
    Shagnik Das; Patrick Morris; Andrew Treglown

    Given graphs F, H and G, we say that G is (F, H )v‐Ramsey if every red/blue vertex coloring of G contains a red copy of F or a blue copy of H. Results of Łuczak, Ruciński and Voigt, and Kreuter determine the threshold for the property that the random graph G(n, p) is (F, H )v‐Ramsey. In this paper we consider the sister problem in the setting of randomly perturbed graphs. In particular, we determine

    更新日期:2020-10-30
  • Long paths and connectivity in 1‐independent random graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-16
    A. Nicholas Day; Victor Falgas‐Ravry; Robert Hancock

    A probability measure on the subsets of the edge set of a graph G is a 1‐independent probability measure (1‐ipm) on G if events determined by edge sets that are at graph distance at least 1 apart in G are independent. Given a 1‐ipm , denote by the associated random graph model. Let denote the collection of 1‐ipms on G for which each edge is included in with probability at least p. For , Balister and

    更新日期:2020-10-30
  • The Glauber dynamics for edge‐colorings of trees
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-09-26
    Michelle Delcourt; Marc Heinrich; Guillem Perarnau

    Let T be a tree on n vertices and with maximum degree . We show that for the Glauber dynamics for k‐edge‐ colorings of T mixes in polynomial time in n. The bound on the number of colors is best possible as the chain is not even ergodic for . Our proof uses a recursive decomposition of the tree into subtrees; we bound the relaxation time of the original tree in terms of the relaxation time of its subtrees

    更新日期:2020-10-30
  • Embedding spanning subgraphs in uniformly dense and inseparable graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-08-24
    Oliver Ebsen; Giulia S. Maesaka; Christian Reiher; Mathias Schacht; Bjarne Schülke

    We consider sufficient conditions for the existence of kth powers of Hamiltonian cycles in n‐vertex graphs G with minimum degree for arbitrarily small . About 20 years ago Komlós, Sarközy, and Szemerédi resolved the conjectures of Pósa and Seymour and obtained optimal minimum degree conditions for this problem by showing that suffices for large n. For smaller values of the given graph G must satisfy

    更新日期:2020-10-30
  • Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-13
    Nikolaos Fountoulakis; Mihyun Kang; Tamás Makai

    We study majority dynamics on the binomial random graph G(n, p) with p = d/n and , for some large . In this process, each vertex has a state in {− 1, + 1} and at each round every vertex adopts the state of the majority of its neighbors, retaining its state in the case of a tie. We show that with high probability the process reaches unanimity in at most four rounds. This confirms a conjecture of Benjamini

    更新日期:2020-10-30
  • On edge‐ordered Ramsey numbers
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-09-02
    Jacob Fox; Ray Li

    An edge‐ordered graph is a graph with a linear ordering of its edges. Two edge‐ordered graphs are equivalent if there is an isomorphism between them preserving the edge‐ordering. The edge‐ordered Ramsey number redge(H; q) of an edge‐ordered graph H is the smallest N such that there exists an edge‐ordered graph G on N vertices such that, for every q‐coloring of the edges of G, there is a monochromatic

    更新日期:2020-10-30
  • Successive shortest paths in complete graphs with random edge weights
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-13
    Stefanie Gerke; Balázs F. Mezei; Gregory B. Sorkin

    Consider a complete graph Kn with edge weights drawn independently from a uniform distribution U(0, 1). The weight of the shortest (minimum‐weight) path P1 between two given vertices is known to be , asymptotically. Define a second‐shortest path P2 to be the shortest path edge‐disjoint from P1, and consider more generally the shortest path Pk edge‐disjoint from all earlier paths. We show that the cost

    更新日期:2020-10-30
  • Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-09-27
    Paweł Hitczenko; Aleksandr Yaroslavskiy

    In this paper, we study corners in tree‐like and permutation tableaux. Tree‐like tableaux are in bijection with other combinatorial structures, including permutation tableaux, and have a connection to the partially asymmetric simple exclusion process (PASEP), an important model of an interacting particles system. In particular, in the context of tree‐like tableaux, a corner corresponds to a node occupied

    更新日期:2020-10-30
  • The Kőnig graph process
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-09
    Nina Kamčev; Michael Krivelevich; Natasha Morrison; Benny Sudakov

    Say that a graph G has property if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set and let e1, e2, … eN be a uniformly random ordering of the edges of Kn, with n an even integer. Let G0 be the empty graph on n vertices. For m ≥ 0, Gm + 1 is obtained from Gm by adding the edge em + 1 exactly if Gm ∪ {em + 1} has property . We analyze

    更新日期:2020-10-30
  • Fast algorithms at low temperatures via Markov chains†
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-10-05
    Zongchen Chen; Andreas Galanis; Leslie A. Goldberg; Will Perkins; James Stewart; Eric Vigoda

    Efficient algorithms for approximate counting and sampling in spin systems typically apply in the so‐called high‐temperature regime, where the interaction between neighboring spins is “weak.” Instead, recent work of Jenssen, Keevash, and Perkins yields polynomial‐time algorithms in the low‐temperature regime on bounded‐degree (bipartite) expander graphs using polymer models and the cluster expansion

    更新日期:2020-10-05
  • Ronald Louis Graham (1935 ‐ 2020)
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-08-16

    Figure 1 Open in figure viewerPowerPoint

    更新日期:2020-08-24
  • Seeded graph matching via large neighborhood statistics
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-30
    Elchanan Mossel; Jiaming Xu

    We study a noisy graph isomorphism problem, where the goal is to perfectly recover the vertex correspondence between two edge‐correlated graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. We show that it is possible to achieve the information‐theoretic limit of graph sparsity in time polynomial in the number of vertices n. Moreover, we show the number of

    更新日期:2020-08-17
  • Rapid mixing of the switch Markov chain for strongly stable degree sequences
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-07-20
    Georgios Amanatidis; Pieter Kleer

    The switch Markov chain has been extensively studied as the most natural Markov chain Monte Carlo approach for sampling graphs with prescribed degree sequences. We show that the switch chain for sampling simple undirected graphs with a given degree sequence is rapidly mixing when the degree sequence is so‐called strongly stable. Strong stability is satisfied by all degree sequences for which the switch

    更新日期:2020-08-17
  • Local decoding and testing of polynomials over grids
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-27
    Mitali Bafna; Srikanth Srinivasan; Madhu Sudan

    We study the local decodability and (tolerant) local testability of low‐degree n‐variate polynomials over arbitrary fields, evaluated over the domain {0,1}n. We show that for every field there is a tolerant local test whose query complexity depends only on the degree. In contrast we show that decodability is possible over fields of positive characteristic, but not over the reals.

    更新日期:2020-08-17
  • On the discrepancy of random low degree set systems
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-13
    Nikhil Bansal; Raghu Meka

    Motivated by the celebrated Beck‐Fiala conjecture, we consider the random setting where there are n elements and m sets and each element lies in t randomly chosen sets. In this setting, Ezra and Lovett showed an discrepancy bound when n ≤ m and an O(1) bound when n ≫ mt. In this paper, we give a tight bound for the entire range of n and m, under a mild assumption that . The result is based on two steps

    更新日期:2020-08-17
  • Coloring triangle‐free graphs with local list sizes
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-07-13
    Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot

    We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow‐up work of Bernshteyn) on the (list) chromatic number of triangle‐free graphs. In both our results, we permit the amount of color made available to vertices of lower degree to be accordingly lower. One result concerns list coloring and correspondence coloring, while the other concerns fractional coloring

    更新日期:2020-08-17
  • Weighted distances in scale‐free preferential attachment models
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-07-03
    Joost Jorritsma; Júlia Komjáthy

    We study three preferential attachment models where the parameters are such that the asymptotic degree distribution has infinite variance. Every edge is equipped with a nonnegative i.i.d. weight. We study the weighted distance between two vertices chosen uniformly at random, the typical weighted distance, and the number of edges on this path, the typical hopcount. We prove that there are precisely

    更新日期:2020-08-17
  • Existence thresholds and Ramsey properties of random posets
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-08-06
    Victor Falgas‐Ravry; Klas Markström; Andrew Treglown; Yi Zhao

    Let denote the power set of [n], ordered by inclusion, and let denote the random poset obtained from by retaining each element from independently at random with probability p and discarding it otherwise. Given any fixed poset F we determine the threshold for the property that contains F as an induced subposet. We also asymptotically determine the number of copies of a fixed poset F in . Finally, we

    更新日期:2020-08-06
  • 1‐Factorizations of pseudorandom graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-05-21
    Asaf Ferber; Vishesh Jain

    A 1‐factorization of a graph G is a collection of edge‐disjoint perfect matchings whose union is E (G ). In this paper, we prove that for any ϵ >0, an (n ,d ,λ )‐graph G admits a 1‐factorization provided that n is even, C 0 ≤ d  ≤ n −1 (where C 0=C 0(ϵ ) is a constant depending only on ϵ ), and λ  ≤ d 1−ϵ . In particular, since (as is well known) a typical random d ‐regular graph G n ,d is such a graph

    更新日期:2020-07-21
  • The real tau‐conjecture is true on average
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-05-15
    Irénée Briquel; Peter Bürgisser

    Koiran's real τ ‐conjecture claims that the number of real zeros of a structured polynomial given as a sum of m products of k real sparse polynomials, each with at most t monomials, is bounded by a polynomial in mkt . This conjecture has a major consequence in complexity theory since it would lead to superpolynomial lower bounds for the arithmetic circuit size of the permanent. We confirm the conjecture

    更新日期:2020-07-21
  • A simple network of nodes moving on the circle
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-01
    Dimitris Cheliotis; Ioannis Kontoyiannis; Michail Loulakis; Stavros Toumpis

    Two simple Markov processes are examined, one in discrete and one in continuous time, arising from idealized versions of a transmission protocol for mobile networks. We consider two independent walkers moving with constant speed on the discrete or continuous circle, and changing directions at independent geometric (respectively, exponential) times. One of the walkers carries a message that wishes to

    更新日期:2020-07-21
  • Ramsey, Paper, Scissors
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-07-20
    Jacob Fox; Xiaoyu He; Yuval Wigderson

    We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on n vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when

    更新日期:2020-07-20
  • Sharp bounds for the variance of linear statistics on random permutations
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-07-20
    Eugenijus Manstavičius

    We are concerned with the variance of a completely additive function defined on the symmetric group endowed with the Ewens probability. Overcoming specific dependence of the summands, we obtain the upper and lower bounds including optimal constants. We also derive a decomposition of such a function into a sum with uncorrelated summands. The results can be reformulated for the linear statistics defined

    更新日期:2020-07-20
  • The range of once‐reinforced random walk in one dimension
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-07-10
    Peter Pfaffelhuber; Jakob Stiefel

    We study once‐reinforced random walk on . For this model, we derive limit results on all moments of its range using Tauberian theory.

    更新日期:2020-07-10
  • Site percolation and isoperimetric inequalities for plane graphs
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-25
    John Haslegrave; Christoforos Panagiotis

    We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for certain classes of hyperbolic graphs. This establishes the vertex isoperimetric constant for all triangular and square hyperbolic lattices, answering a question of Lyons

    更新日期:2020-06-25
  • Every planar graph with the Liouville property is amenable
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-07
    Johannes Carmesin; Agelos Georgakopoulos

    We introduce a strengthening of the notion of transience for planar maps in order to relax the standard condition of bounded degree appearing in various results, in particular, the existence of Dirichlet harmonic function s proved by Benjamini and Schramm. As a corollary we obtain that every planar nonamenable graph admits nonconstant Dirichlet harmonic function s27.

    更新日期:2020-06-07
  • Information percolation and cutoff for the random‐cluster model
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-06-05
    Shirshendu Ganguly; Insuk Seo

    We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the

    更新日期:2020-06-05
  • Diameter of P.A. random graphs with edge‐step functions
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-05-26
    Caio Alves; Rodrigo Ribeiro; Rémy Sanchis

    In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function f:N→[0,1] that drives the asymptotic proportion between the numbers of vertices and edges. These results are sharp when f is a regularly varying function at infinity with strictly negative index of regular variation −γ. For this particular class, we prove

    更新日期:2020-05-26
  • Projections of the Aldous chain on binary trees: Intertwining and consistency
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-05-23
    Noah Forman; Soumik Pal; Douglas Rizzolo; Matthias Winkel

    Consider the Aldous Markov chain on the space of rooted binary trees with n labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix 1 ≤ k

    更新日期:2020-05-23
  • Constrained percolation, Ising model, and XOR Ising model on planar lattices
    Random Struct. Algorithms (IF 1.047) Pub Date : 2020-05-07
    Zhongyang Li

    We study site percolation models on planar lattices including the [m ,4,n ,4] lattice and the square tilings on the Euclidean plane () or the hyperbolic plane (), satisfying certain local constraints on degree‐4 faces. These models are closely related to Ising models and XOR Ising models (product of two i.i.d Ising models) on regular tilings of or . In particular, we obtain a description of the numbers

    更新日期:2020-05-07
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
微生物研究
亚洲大洋洲地球科学
NPJ欢迎投稿
自然科研论文编辑
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
上海中医药大学
浙江大学
清华大学
南科大
北京理工大学
清华
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
清华大学-1
武汉大学
浙江大学
天合科研
x-mol收录
试剂库存
down
wechat
bug