Imagen de Portada

The number of random 2-SAT solutions is asymptotically log-normal

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chatterjee, Arnab, Coja-Oghlan, Amin, Müller, Noela, Riddlesden, Connor, Rolvien, Maurice, Zakharov, Pavel, Zhu, Haodong
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Combinatorics Probability 05C80
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The random $k$-SAT Gibbs uniqueness threshold revisited
por: Chatterjee, Arnab, et al.
Publicado: (2025)

The rank of sparse random matrices
por: Coja-Oghlan, Amin, et al.
Publicado: (2019)

Fluctuations of the Ising free energy on Erdős-Rényi graphs
por: Coja-Oghlan, Amin, et al.
Publicado: (2026)

Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
por: Chatterjee, Arnab
Publicado: (2025)

WalkSAT is linear on random 2-SAT
por: Berenbrink, Petra, et al.
Publicado: (2024)

Belief Propagation Guided Decimation on Random k-XORSAT
por: Chatterjee, Arnab, et al.
Publicado: (2025)

Asymptotic size of the Karp-Sipser Core in Configuration Model
por: Chatterjee, Arnab, et al.
Publicado: (2025)

Noisy group testing via spatial coupling
por: Coja-Oghlan, Amin, et al.
Publicado: (2024)

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
por: Müller, Noela, et al.
Publicado: (2024)

The asymptotic rank of adjacency matrices of weighted configuration models over arbitrary fields
por: van der Hofstad, Remco, et al.
Publicado: (2025)

Bad local minima exist in the stochastic block model
por: Coja-Oghlan, Amin, et al.
Publicado: (2024)

On the concentration of the chromatic number of random graphs
por: Surya, Erlang, et al.
Publicado: (2022)

Warning Propagation on random graphs
por: Coja-Oghlan, Amin, et al.
Publicado: (2021)

The clique chromatic number of sparse random graphs
por: Fernandez V, Manuel, et al.
Publicado: (2024)

Dispersion on the Complete Graph
por: De Ambroggio, Umberto, et al.
Publicado: (2023)

Isomorphisms between dense random graphs
por: Surya, Erlang, et al.
Publicado: (2023)

On the clique number of random Cayley graphs and related topics
por: Conlon, David, et al.
Publicado: (2024)

Shotgun assembly of random graphs
por: Johnston, Tom, et al.
Publicado: (2022)

A binomial random multigraph
por: Pelekis, Christos
Publicado: (2023)

Canonical labelling of random regular graphs
por: Isaev, Mikhail, et al.
Publicado: (2026)

Gaussian to log-normal transition for independent sets in a percolated hypercube
por: Chowdhury, Mriganka Basu Roy, et al.
Publicado: (2024)

Minimum stationary values of sparse random directed graphs
por: Cai, Xing Shi, et al.
Publicado: (2020)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
por: Gamarnik, David, et al.
Publicado: (2023)

Spread blow-up lemma with an application to perturbed random graphs
por: Nenadov, Rajko, et al.
Publicado: (2024)

Speeding up random walk mixing by starting from a uniform vertex
por: Díaz, Alberto Espuny, et al.
Publicado: (2022)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
por: Tiskin, Alexander
Publicado: (2022)

Temporal Exploration of Random Spanning Tree Models
por: Baguley, Samuel, et al.
Publicado: (2025)

Functionality of Random Graphs
por: Sylvester, John, et al.
Publicado: (2024)

Cover and Hitting Times of Hyperbolic Random Graphs
por: Kiwi, Marcos, et al.
Publicado: (2022)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
por: Chinyaev, Boris
Publicado: (2025)

A threshold for online balancing of sparse i.i.d. vectors
por: Altschuler, Dylan J., et al.
Publicado: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
por: Gurvits, Leonid, et al.
Publicado: (2023)

Limit Laws for Critical Dispersion on Complete Graphs
por: De Ambroggio, Umberto, et al.
Publicado: (2024)

Zero-One Laws for Random Feasibility Problems
por: Altschuler, Dylan J.
Publicado: (2023)

Infinite Schnyder Woods
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
por: Li, Ray, et al.
Publicado: (2025)

Approximate polymorphisms of predicates
por: Alekseev, Yaroslav, et al.
Publicado: (2025)

Record-biased permutations and their permuton limit
por: Bouvel, Mathilde, et al.
Publicado: (2024)

A Proof of Talagrand's Creating Large Sets Conjecture
por: Fang, Xuan, et al.
Publicado: (2025)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
por: Pham, Huy Tuan
Publicado: (2024)