Adam Getchell
acgetchell@ucdavis.edu
University of California, Davis
CGAL Developers Conference, Nancy, Sept 29-October 2, 2015
Causal Dynamical Triangulations
A candidate theory of quantum gravity
CGAL
You are the experts!
Credit: NASA/WMAP Science team
Equations of Motion
Ricci scalar
Cosmological constant
Ricci tensor
Ricci scalar
Stress-Energy tensor
Transition probability amplitude
Almost impossible to calculate!
Quickly gets complicated!
Perturbative sums, renormalization, etc.
3D Delaunay Triangulation: 256 Timeslices, 7473 Vertices, 47021 Simplices
2D Icosahedron: 1 timeslice, 30 vertices, 20 Simplices
Inequivalent Triangulations
Regge Action
Partition Function
Transition probability amplitude
Area of hinge
Volume of Simplex
Deficit Angle
Regge Action
3D
4D
Wick rotation
Inequivalent Triangulations
Partition Function
Wick rotation
(2,3) & (3,2)
(4,4)
(2,6) & (6,2)
Simplices involved
Move name
(3,1) & (2,2)
2 (1,3) & 2 (3,1)
(1,3) & (3,1)
(2,4) & (4,2)
(3,3)
(4,6) & (6,4)
(2,8) & (8,2)
CDT looks like GR at cosmological scales, does it have a Newtonian limit?
At first glance, this is hard:
The static axisymmetric Weyl metric:
With two-body Chazy-Curzon (circa 1924) solutions of the Einstein field equations:
Leads to a strut:
With a stress:
That can be integrated to get the Newtonian force!
Metric
Affine connection
Riemann tensor
Ricci tensor & Ricci scalar
Einstein field equations
Find the Newtonian Limit, if it exists
Re-implement CDT
Use current tools
Easy to evaluate, use, and contribute
Mass = Epp quasilocal energy
Non-Euclidean Distance
Hausdorff Distance(?)
8 timeslices, 68 vertices, 619 faces, 298 simplices
Creation time: 0.043336s
(MacBook Pro Retina, Mid 2012)
/// @param[in] simplices The number of desired simplices in the triangulation
/// @param[in] timeslices The number of timeslices in the triangulation
/// @returns A std::unique_ptr to the foliated Delaunay triangulation
auto inline make_triangulation(const unsigned simplices,
const unsigned timeslices) {
std::cout << "Generating universe ... " << std::endl;
#ifdef CGAL_LINKED_WITH_TBB
// Construct the locking data-structure, using the bounding-box of the points
auto bounding_box_size = static_cast<double>(timeslices+1);
Delaunay::Lock_data_structure locking_ds(
CGAL::Bbox_3(-bounding_box_size, -bounding_box_size, -bounding_box_size,
bounding_box_size, bounding_box_size, bounding_box_size), 50);
Delaunay universe(K(), &locking_ds);
#else
Delaunay universe;
#endif
auto universe_ptr = std::make_unique<decltype(universe)>(universe);
auto causal_vertices = make_foliated_sphere(simplices, timeslices);
insert_into_triangulation(universe_ptr, causal_vertices);
fix_triangulation(universe_ptr);
// This isn't as expensive as it looks thanks to return value optimization
return universe_ptr;
} // make_triangulation()
256 timeslices, 222,132 vertices, 2,873,253 faces, 1,436,257 simplices
Creation time: 284.596s
(MacBook Pro Retina, Mid 2012)
[1] The CGAL Project. CGAL User and Reference Manual. CGAL Editorial Board, 4.6.3 edition, 2015.
[2] Steve Carlip. Why Quantum Gravity is Hard. Conceptual and Technical Challenges for Quantum Gravity, Rome, September 2014.
[3] J. Ambjorn, J. Jurkiewicz, and R. Loll. “Dynamically Triangulating Lorentzian Quantum Gravity.” Nuclear Physics B 610, no. 2001 (May 27, 2001): 347–82.
[4] Rajesh Kommu. “A Validation of Causal Dynamical Triangulations.” arXiv:1110.6875, October 31, 2011. http://arxiv.org/abs/1110.6875.