The cook-book approach to the differential equation method
DOI10.1016/J.COSREV.2010.04.002zbMATH Open1302.05168OpenAlexW2011146667WikidataQ115358379 ScholiaQ115358379MaRDI QIDQ465658FDOQ465658
Authors: D. Mitsche, J. Díaz 
Publication date: 24 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2010.04.002
Recommendations
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)
Cites Work
- Probability and random processes.
- Probability Inequalities for Sums of Bounded Random Variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Sudden emergence of a giant \(k\)-core in a random graph
- Random graphs.
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Title not available (Why is that?)
- Solutions of ordinary differential equations as limits of pure jump markov processes
- Large deviations
- Weighted sums of certain dependent random variables
- Acyclic edge colorings of graphs
- A simple solution to the k‐core problem
- New methods to color the vertices of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability and Computing
- The first cycles in an evolving graph
- Title not available (Why is that?)
- Concentration of Measure for the Analysis of Randomized Algorithms
- A guided tour of Chernoff bounds
- Approximating the unsatisfiability threshold of random formulas
- On the independence and chromatic numbers of random regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- Title not available (Why is that?)
- On the independence number of random cubic graphs
- Title not available (Why is that?)
- The isoperimetric number of random regular graphs
- Sharp thresholds of graph properties, and the $k$-sat problem
- Large independent sets in random regular graphs
- NP-completeness of some generalizations of the maximum matching problem
- Analysis of greedy algorithms on graphs with bounded degrees
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Differential equations for random processes and random graphs
- Bounds on the bisection width for random \(d\)-regular graphs
- Title not available (Why is that?)
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
- Colouring Random 4-Regular Graphs
- Thek-Core and Branching Processes
- On the existence of a factor of degree one of a connected random graph
- Encores on cores
- Generating Random Regular Graphs Quickly
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- On the satisfiability threshold of formulas with three literals per clause
- Title not available (Why is that?)
- Analysis of Two Simple Heuristics on a Random Instance ofk-sat
- Uniform generation of random regular graphs of moderate degree
- Almost all graphs with average degree 4 are 3-colorable
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- Advanced Lectures on Machine Learning
- Title not available (Why is that?)
- Size and connectivity of the \(k\)-core of a random graph
- Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings
- Small maximal matchings in random graphs.
- Title not available (Why is that?)
- Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
- On the chromatic number of a random 5-regular graph
- Title not available (Why is that?)
- Minimum independent dominating sets of random cubic graphs
- Random formulas have frozen variables
- On the Independent Domination Number of Random Regular Graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- The probabilistic analysis of a greedy satisfiability algorithm
- Random 2-SAT: Results and problems
- Lower bounds for random 3-SAT via differential equations
- A threshold for unsatisfiability
Cited In (6)
- On minimum vertex bisection of random \(d\)-regular graphs
- Asymptotic bounds on total domination in regular graphs
- A central limit theorem via differential equations
- Title not available (Why is that?)
- 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)
