Search Results - "Random structures & algorithms"

Concentration and regularization of random graphs by Le, Can M., Levina, Elizaveta, Vershynin, Roman

“…This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and…”
Get full text

Dynamic concentration of the triangle‐free process by Bohman, Tom, Keevash, Peter

“…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…”
Get full text

Testing for high-dimensional geometry in random graphs by Bubeck, Sébastien, Ding, Jian, Eldan, Ronen, Rácz, Miklós Z.

“…We study the problem of detecting the presence of an underlying high‐dimensional geometric structure in a random graph. Under the null hypothesis, the observed…”
Get full text

Seeded graph matching via large neighborhood statistics by Mossel, Elchanan, Xu, Jiaming

“…We study a noisy graph isomorphism problem, where the goal is to perfectly recover the vertex correspondence between two edge‐correlated graphs, with an…”
Get full text

Approximating the distance to monotonicity of Boolean functions by Pallavoor, Ramesh Krishnan S., Raskhodnikova, Sofya, Waingarten, Erik

“…We design a nonadaptive algorithm that, given oracle access to a function f:{0,1} n→{0,1} which is α‐far from monotone, makes poly(n,1/α) queries and returns…”
Get full text

Universality for bounded degree spanning trees in randomly perturbed graphs by Böttcher, Julia, Han, Jie, Kohayakawa, Yoshiharu, Montgomery, Richard, Parczyk, Olaf, Person, Yury

“…We solve a problem of Krivelevich, Kwan and Sudakov concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly…”
Get full text

Fast algorithms at low temperatures via Markov chains by Chen, Zongchen, Galanis, Andreas, Goldberg, Leslie A., Perkins, Will, Stewart, James, Vigoda, Eric

“…Efficient algorithms for approximate counting and sampling in spin systems typically apply in the so‐called high‐temperature regime, where the interaction…”
Get full text

The Johansson‐Molloy theorem for DP‐coloring by Bernshteyn, Anton

“…The aim of this note is twofold. On the one hand, we present a streamlined version of Molloy's new proof of the bound χ(G)≤(1+o(1))Δ(G)/lnΔ(G) for…”
Get full text

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu by Han, Jie, Morris, Patrick, Treglown, Andrew

“…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…”
Get full text

Community detection in the sparse hypergraph stochastic block model by Pal, Soumik, Zhu, Yizhe

“…We consider the community detection problem in sparse random hypergraphs. Angelini et al. in [6] conjectured the existence of a sharp threshold on model…”
Get full text

Combinatorial and stochastic properties of ranked tree‐child networks by Bienvenu, François, Lambert, Amaury, Steel, Mike

“…Tree‐child networks are a class of directed acyclic graphs that have recently risen to prominence in phylogenetics. Although these networks have numerous,…”
Get full text

On‐line balancing of random inputs by Bansal, Nikhil, Spencer, Joel H.

“…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…”
Get full text

Clustering and percolation on superpositions of Bernoulli random graphs by Bloznelis, Mindaugas, Leskelä, Lasse

“…A simple but powerful network model with n$$ n $$ nodes and m$$ m $$ partly overlapping layers is generated as an overlay of independent random graphs…”
Get full text

Outliers in spectrum of sparse Wigner matrices by Tikhomirov, Konstantin, Youssef, Pierre

“…In this paper, we study the effect of sparsity on the appearance of outliers in the semi‐circular law. Let (Wn)n=1∞ be a sequence of random symmetric matrices…”
Get full text

On the variational problem for upper tails in sparse random graphs by Lubetzky, Eyal, Zhao, Yufei

“…What is the probability that the number of triangles in Gn,p, the Erdős‐Rényi random graph with edge density p, is at least twice its mean? Writing it as…”
Get full text

Permutations with fixed pattern densities by Kenyon, Richard, Král', Daniel, Radin, Charles, Winkler, Peter

“…We study scaling limits of random permutations (“permutons”) constrained by having fixed densities of a finite number of patterns. We show that the limit…”
Get full text

Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree by El Alaoui, Ahmed, Montanari, Andrea, Sellke, Mark

“…Given a graph G$$ G $$ of degree k$$ k $$ over n$$ n $$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in…”
Get full text

Approximately counting independent sets in bipartite graphs via graph containers by Jenssen, Matthew, Perkins, Will, Potukuchi, Aditya

“…By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in…”
Get full text

Subcritical monotone cellular automata by Balister, Paul, Bollobás, Béla, Morris, Robert, Smith, Paul

“…We study monotone cellular automata (also known as 𝒰‐bootstrap percolation) in ℤd$$ {\mathbb{Z}}^d $$ with random initial configurations. Confirming a…”
Get full text

Simplicial complexes: Spectrum, homology and random walks by Parzanchevski, Ori, Rosenthal, Ron

“…This paper studies the dynamical and asymptotic aspects of high‐dimensional expanders. We define a stochastic process on simplicial complexes of arbitrary…”
Get full text