A geometric Achlioptas process
From MaRDI portal
Publication:894807
DOI10.1214/14-AAP1074zbMath1326.05143arXiv1510.07428OpenAlexW3099038112MaRDI QIDQ894807
Publication date: 24 November 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.07428
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Achlioptas process phase transitions are continuous
- Small subgraphs in random graphs and the power of multiple choices
- Hamilton cycles in random geometric graphs
- On the chromatic number of random geometric graphs
- Birth control for giants
- Two-point concentration in random geometric graphs
- Avoiding a giant component
- Balanced allocations (extended abstract)
- Creating Small Subgraphs in Achlioptas Processes With Growing Parameter
- The cover time of random geometric graphs
- Hamiltonicity thresholds in Achlioptas processes
- Avoiding small subgraphs in Achlioptas processes
- Random Plane Networks
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Balanced Allocations
- Random Geometric Graphs
- Creating a Giant Component
- A phase transition for avoiding a giant component
- Embracing the giant component
- Explosive Percolation in Random Networks
This page was built for publication: A geometric Achlioptas process