scientific article; zbMATH DE number 1405894
From MaRDI portal
Publication:4938890
Recommendations
Cited in
(95)- The triangle-free process
- A central limit theorem via differential equations
- Connected domination of regular graphs
- Protean graphs with a variety of ranking schemes
- Small maximal matchings in random graphs.
- Analysis of greedy algorithms on graphs with bounded degrees
- Hamiltonian decompositions of random bipartite regular graphs.
- Maximum induced matchings of random cubic graphs
- Linear multi-objective drift analysis
- The sharp threshold for making squares
- Critical random graphs and the differential equations technique
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Differential equations for random processes and random graphs
- \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
- A sharp threshold for bootstrap percolation in a random hypergraph
- Minimum 2-dominating sets in regular graphs
- The matching process and independent process in random regular graphs and hypergraphs
- Total domination in regular graphs
- GHS algorithm on a graph with random weights
- Hamilton cycles in the semi-random graph process
- Preferential attachment without vertex growth: emergence of the giant component
- On the satisfiability threshold of formulas with three literals per clause
- Parallel execution of schedules with random dependency graph
- Random triangle removal
- Bounds on the bisection width for random \(d\)-regular graphs
- An algorithm for random signed 3-SAT with intervals
- Asymptotic bounds on total domination in regular graphs
- A gentle introduction to the differential equation method and dynamic concentration
- Markovian online matching algorithms on large bipartite random graphs
- Systemic cascades on inhomogeneous random financial networks
- On the number of circuits in random graphs
- A power-of-two-choices unbalanced allocation process
- Concentration of first hitting times under additive drift
- The independent neighborhoods process
- A random triadic process
- Properties of regular graphs with large girth via local algorithms
- Dynamics of random graphs with bounded degrees
- A random triadic process
- Dense subgraphs in the H-free process
- scientific article; zbMATH DE number 1270543 (Why is no real title available?)
- Achlioptas process phase transitions are continuous
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
- The cook-book approach to the differential equation method
- scientific article; zbMATH DE number 1890147 (Why is no real title available?)
- Closing gaps in asymptotic fair division
- Large triangle packings and Tuza's conjecture in sparse random graphs
- Independent dominating sets in graphs of girth five
- Greedy bipartite matching in random type Poisson arrival model
- Greedy matching in bipartite random graphs
- The triangle-free process and the Ramsey number \(R(3,k)\)
- On the threshold problem for Latin boxes
- Large girth approximate Steiner triple systems
- A natural barrier in random greedy hypergraph matching
- Connectivity threshold and recovery time in rank-based models for complex networks
- Orientability Thresholds for Random Hypergraphs
- Convergence of Achlioptas processes via differential equations with unique solutions
- Hamiltonicity of random graphs produced by 2‐processes
- A Spatial Web Graph Model with Local Influence Regions
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
- Protean Graphs with a Variety of Ranking Schemes
- The condensation transition in random hypergraph 2-coloring
- Perfect matchings in the semirandom graph process
- Deterministic extractors for small-space sources
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences
- A randomized construction of high girth regular graphs
- Bootstrap percolation in living neural networks
- The number of n-queens configurations
- Bootstrap percolation in inhomogeneous random graphs
- Scale free properties of random \(k\)-trees
- Greedy maximal independent sets via local limits
- On minimum vertex bisection of random \(d\)-regular graphs
- Cliques, chromatic number, and independent sets in the semi-random process
- Cleaning random \(d\)-regular graphs with brooms
- The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
- Partitioning problems via random processes
- The degree-restricted random process is far from uniform
- Local limit of the random degree constrained process
- Behaviour of the minimum degree throughout the d-process
- Near critical asymptotics in the frozen Erdős-Rényi
- Phase transitions for modified Erdős--Rényi processes
- Decoding how higher-order network interactions shape contagion dynamics
- Hopping forcing number in random d-regular graphs
- A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
- Ramsey numbers of bounded degree trees versus general graphs
- Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds
- The semi-random tree process
- On the pre- and post-positional semi-random graph processes
- The linear q-hypergraph process
- An edge deletion model for complex networks
- Fluid limit and gelation in the frozen Erdős-Rényi random graph
- Sharper analysis of the random graph d-process via a balls-in-bins model
- On the robustness of random k-cores
- Birth control for giants
- The early evolution of the \(H\)-free process
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938890)
