Imagen de Portada

Minimum stationary values of sparse random directed graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cai, Xing Shi, Perarnau, Guillem
Formato:	Preprint
Publicado:	2020
Materias:	Probability Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

First Order Logic of Sparse Graphs with Given Degree Sequences
por: Larrauri, Alberto, et al.
Publicado: (2024)

Canonical labelling of sparse random graphs
por: Verbitsky, Oleg, et al.
Publicado: (2024)

Twin-width of sparse random graphs
por: Hendrey, Kevin, et al.
Publicado: (2023)

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

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

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

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

Equitable coloring of sparse graphs
por: Liu, Weichan, et al.
Publicado: (2024)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
por: Chinyaev, Boris
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)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Sunflowers in set systems with small VC-dimension
por: Balogh, József, et al.
Publicado: (2024)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
por: Gajjala, Rishikesh
Publicado: (2026)

A lower bound on the spectrum of unimodular networks
por: Rahman, Mustazee
Publicado: (2016)

Random 0/1-polytopes expand rapidly
por: Guo, He, et al.
Publicado: (2026)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
por: Pépin, Martin, et al.
Publicado: (2023)

Long induced paths in sparse graphs and graphs with forbidden patterns
por: Duron, Julien, et al.
Publicado: (2024)

On cuts of small chromatic number in sparse graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

On locating and neighbor-locating colorings of sparse graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2023)

Minimum length word-representants of graph products
por: Srinivasan, Eshwar, et al.
Publicado: (2024)

Sample compression schemes for balls in structurally sparse graphs
por: Bourneuf, Romain, et al.
Publicado: (2026)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
por: Bencs, Ferenc, et al.
Publicado: (2023)

Cutoff profile of the Metropolis biased card shuffling
por: Zhang, Lingfu
Publicado: (2022)

First order distinguishability of sparse random graphs
por: Hershko, Tal, et al.
Publicado: (2024)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

The number of random 2-SAT solutions is asymptotically log-normal
por: Chatterjee, Arnab, et al.
Publicado: (2024)