The cook-book approach to the differential equation method
From MaRDI portal
(Redirected from Publication:465658)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Enumeration in graph theory (05C30) Paths and cycles (05C38) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Recommendations
Cites work
- scientific article; zbMATH DE number 1696519 (Why is no real title available?)
- scientific article; zbMATH DE number 437557 (Why is no real title available?)
- scientific article; zbMATH DE number 3125815 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 4049676 (Why is no real title available?)
- scientific article; zbMATH DE number 3729228 (Why is no real title available?)
- scientific article; zbMATH DE number 125467 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1256700 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- scientific article; zbMATH DE number 1857648 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1405894 (Why is no real title available?)
- A guided tour of Chernoff bounds
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A simple solution to the k‐core problem
- A threshold for unsatisfiability
- Acyclic edge colorings of graphs
- Advanced Lectures on Machine Learning
- Almost all graphs with average degree 4 are 3-colorable
- Analysis of Two Simple Heuristics on a Random Instance ofk-sat
- Analysis of greedy algorithms on graphs with bounded degrees
- Approximating the unsatisfiability threshold of random formulas
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Bounds on the bisection width for random \(d\)-regular graphs
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Colouring Random 4-Regular Graphs
- Concentration of Measure for the Analysis of Randomized Algorithms
- Differential equations for random processes and random graphs
- Encores on cores
- Generating Random Regular Graphs Quickly
- Large deviations
- Large independent sets in random regular graphs
- Lower bounds for random 3-SAT via differential equations
- Minimum independent dominating sets of random cubic graphs
- NP-completeness of some generalizations of the maximum matching problem
- New methods to color the vertices of a graph
- On the Independent Domination Number of Random Regular Graphs
- On the chromatic number of a random 5-regular graph
- On the existence of a factor of degree one of a connected random graph
- On the independence and chromatic numbers of random regular graphs
- On the independence number of random cubic graphs
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
- On the satisfiability threshold of formulas with three literals per clause
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
- Probability Inequalities for Sums of Bounded Random Variables
- Probability and Computing
- Probability and random processes.
- Random 2-SAT: Results and problems
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- Random formulas have frozen variables
- Random graphs.
- Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings
- Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
- Sharp thresholds of graph properties, and the $k$-sat problem
- Size and connectivity of the \(k\)-core of a random graph
- Small maximal matchings in random graphs.
- Solutions of ordinary differential equations as limits of pure jump markov processes
- Sudden emergence of a giant k-core in a random graph
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- The asymptotic number of labeled graphs with given degree sequences
- The first cycles in an evolving graph
- The isoperimetric number of random regular graphs
- The probabilistic analysis of a greedy satisfiability algorithm
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Thek-Core and Branching Processes
- Uniform generation of random regular graphs of moderate degree
- Weighted sums of certain dependent random variables
Cited in
(6)- Asymptotic bounds on total domination in regular graphs
- On minimum vertex bisection of random \(d\)-regular graphs
- A central limit theorem via differential equations
- scientific article; zbMATH DE number 1405894 (Why is no real title available?)
- A gentle introduction to the differential equation method and dynamic concentration
- The matching process and independent process in random regular graphs and hypergraphs
This page was built for publication: The cook-book approach to the differential equation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465658)
