:: Library Catalog

Imatge de la portada

Guardat en:

Dades bibliogràfiques
Autor principal:	Kolesnik, Brett
Format:	Preprint
Publicat:	2020
Matèries:	Probability Combinatorics 05C80, 05C85, 49M25, 60F10, 65N22, 68W40
Accés en línia:	https://arxiv.org/abs/2011.04613
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
per: Bartha, Zsolt, et al.
Publicat: (2025)

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
per: Diaconis, Persi, et al.
Publicat: (2019)

Thresholds for contagious sets in random graphs
per: Angel, Omer, et al.
Publicat: (2016)

$H$-percolation with a random $H$
per: Bartha, Zsolt, et al.
Publicat: (2023)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
per: Mörters, Peter, et al.
Publicat: (2025)

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

On Conjectures concerning the Labeled Coupon Collector Problem
per: Barak-Pelleg, Dina, et al.
Publicat: (2025)

Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
per: Diamond, Harvey, et al.
Publicat: (2024)

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
per: Diamond, Harvey, et al.
Publicat: (2024)

Majority dynamics on sparse random graphs
per: Chakraborti, Debsoumya, et al.
Publicat: (2021)

Local limit of Prim's algorithm
per: Corsini, Benoît, et al.
Publicat: (2025)

Isomorphisms between random $d$-hypergraphs
per: Lenoir, Théo
Publicat: (2024)

The degree-restricted random process is far from uniform
per: Molloy, Michael, et al.
Publicat: (2022)

Zero-free regions of partition functions with applications to algorithms and graph limits
per: Regts, Guus
Publicat: (2015)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
per: Galby, Esther, et al.
Publicat: (2024)

Finding cliques and dense subgraphs using edge queries
per: Csóka, Endre, et al.
Publicat: (2023)

The spread of fire on a random multigraph
per: Goldschmidt, Christina, et al.
Publicat: (2017)

Normal approximation for subgraph count in random hypergraphs
per: Michalczuk, Wojciech, et al.
Publicat: (2024)

The law of the circumference of sparse binomial random graphs
per: Anastos, Michael, et al.
Publicat: (2025)

Optimal Hardness of Online Algorithms for Large Independent Sets
per: Gamarnik, David, et al.
Publicat: (2025)

A note on limits of sequences of binary trees
per: Grübel, Rudolf
Publicat: (2023)

Maximum number of points in general position in a random subset of finite $3$-dimensional spaces
per: Balogh, József, et al.
Publicat: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
per: Bosch-Calvo, Miguel, et al.
Publicat: (2024)

Large graph limits of local matching algorithms on Configuration model graphs
per: Aoudi, Mohamed Habib Aliou Diallo, et al.
Publicat: (2024)

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

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

On the thresholds of degenerate hypergraphs
per: Chen, Yu, et al.
Publicat: (2024)

The critical activation density in graph bootstrap percolation
per: Kolesnik, Brett, et al.
Publicat: (2026)

Weakly saturated random graphs
per: Bartha, Zsolt, et al.
Publicat: (2020)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
per: Goedgebeur, Jan, et al.
Publicat: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
per: Balkanski, Eric, et al.
Publicat: (2026)

Scaling limits of random graphs
per: Addario-Berry, Louigi, et al.
Publicat: (2024)

Universal diameter bounds for random graphs with given degrees
per: Addario-Berry, Louigi, et al.
Publicat: (2025)

Parities in random Latin squares
per: Kwan, Matthew, et al.
Publicat: (2025)

Random cliques in random graphs revisited
per: Morris, Robert, et al.
Publicat: (2025)

W-state graphs: Structure and Algorithms
per: Gajjala, Rishikesh, et al.
Publicat: (2026)

Optimal non-adaptive algorithm for edge estimation
per: Bishnu, Arijit, et al.
Publicat: (2025)

Typical structure of sparse exponential random graph models
per: Cook, Nicholas A., et al.
Publicat: (2022)

Isomorphisms between dense random graphs
per: Surya, Erlang, et al.
Publicat: (2023)

Approximating inter-point distances in directed Bernoulli graphs
per: Barbour, A. D., et al.
Publicat: (2026)