We show that on a manifold whose Riemannian metric evolves under backwards Ricci flow two Brownian motions can be coupled in such a way that the expectation of their normalized L-distance is non-increasing. As an immediate corollary we obtain a new proof of a recent result of Topping (J. reine angew. Math. 636 (2009), 93-122), namely that the normalized L-transportation cost between two solutions of the heat equation is non-increasing as well.
The Ricci flow was introduced by Hamilton @cite_10 . There he effectively used it to solve the Poincar ' e conjecture for 3-manifolds with positive Ricci curvature. By following his approach, Perelman @cite_13 @cite_4 @cite_19 finally solved the Poincar ' e conjecture (see also @cite_3 @cite_1 @cite_7 ). There he used @math -functional as a crucial tool. At the same stage, he also studied the heat equation in @cite_13 in relation with the geometry of Ricci flows. It suggests that analysing the heat equation is still an efficient way to investigate geometry of the underlying space even in the time-dependent metric case. This general principle has been confirmed in recent developments in this direction. In connection with the theory of optimal transportation, McCann and Topping @cite_16 showed contraction in the @math -Wasserstein distance for the heat equation under backwards Ricci flow on a compact manifold. Topping's result @cite_11 can be regarded as an extension of it to contraction in the normalized @math -transportation cost (see @cite_0 also). By taking @math , he recovered the monotonicity of Perelman's @math -entropy, which is one of fundamental ingredients in Perelman's work.
@cite_4 @cite_7 @cite_10 @cite_1 @cite_3 @cite_0 @cite_19 @cite_16 @cite_13 @cite_11
2166554539 1970564715 2143075606 1984988864 2081643526 2126823361 2528005577 2103138450 2891096760 2118972993
e Conjecture, and more generally Thurston’s Geometrization Conjecture, using the Ricci flow approach of Hamilton. Perelman’s proofs are concise and, at times, sketchy. The purpose of these notes is to provide the details that are missing in [46] and [47], which contain Perelman’s arguments for the Geometrization Conjecture. Among other things, we cover the construction of the Ricci flow with surgery of [47]. We also discuss the long-time behavior of the Ricci flow with surgery, which is needed for the full Geometrization Conjecture. The papers of Colding and Minicozzi [23; 24] and Perelman [48], which are not covered in these notes, each provide a shortcut in the case of the Poincar´ e Conjecture. Namely, these papers show that if the initial manifold is simply-connected then the Ricci flow with surgery becomes extinct in a finite time, thereby removing the issue of the long-time behavior. Combining this claim with the proof of existence of Ricci flow with surgery gives the shortened proof in the simply-connected case. These notes are intended for readers with a solid background in geometric analysis. Good sources for background material on Ricci flow are Chow and Knopf [21], Chow, Lu and Ni [22], Hamilton [30] and Topping [60]. The notes are self-contained but are designed to be read along with [46; 47]. For the most part we follow the format of [46; 47] and use the section numbers of [46; 47] to label our sections. We have done this in We present a monotonic expression for the Ricci flow, valid in all dimensions and without curvature assumptions. It is interpreted as an entropy for a certain canonical ensemble. Several geometric applications are given. In particular, (1) Ricci flow, considered on the space of riemannian metrics modulo diffeomorphism and scaling, has no nontrivial periodic orbits (that is, other than fixed points); (2) In a region, where singularity is forming in finite time, the injectivity radius is controlled by the curvature; (3) Ricci flow can not quickly turn an almost euclidean region into a very curved one, no matter what happens far away. We also verify several assertions related to Richard Hamilton's program for the proof of Thurston geometrization conjecture for closed three-manifolds, and give a sketch of an eclectic proof of this conjecture, making use of earlier results on collapsing with local lower curvature bound. We show that the analogue of Hamilton’s Ricci flow in the combinatorial setting produces solutions which converge exponentially fast to Thurston’s circle packing on surfaces. As a consequence, a new proof of Thurston’s existence of circle packing theorem is obtained. As another consequence, Ricci flow suggests a new algorithm to find circle packings. In this paper, we give a complete proof of the Poincare and the geometrization conjectures. This work depends on the accumulative works of many geometric analysts in the past thirty years. This proof should be considered as the crowning achievement of the Hamilton-Perelman theory of Ricci flow. We present various characterizations of uniform lower bounds for the Ricci curvature of a smooth Riemannian manifold M in terms of convexity properties of the entropy (considered as a function on the space of probability measures on M) as well as in terms of transportation inequalities for volume measures, heat kernels, and Brownian motions and in terms of gradient estimates for the heat semigroup. © 2004 Wiley Periodicals, Inc. We show that a certain entropy-like function is convex, under an optimal transport problem that is adapted to Ricci flow. We use this to reprove the monotonicity of Perelman’s reduced volume. This paper defines a new transport metric over the space of nonnegative measures. This metric interpolates between the quadratic Wasserstein and the Fisher–Rao metrics and generalizes optimal transport to measures with different masses. It is defined as a generalization of the dynamical formulation of optimal transport of Benamou and Brenier, by introducing a source term in the continuity equation. The influence of this source term is measured using the Fisher–Rao metric and is averaged with the transportation term. This gives rise to a convex variational problem defining the new metric. Our first contribution is a proof of the existence of geodesics (i.e., solutions to this variational problem). We then show that (generalized) optimal transport and Hellinger metrics are obtained as limiting cases of our metric. Our last theoretical contribution is a proof that geodesics between mixtures of sufficiently close Dirac measures are made of translating mixtures of Dirac masses. Lastly, we propose a numerical scheme making use of first-order proximal splitting methods and we show an application of this new distance to image interpolation. This book consists of two independent works: Part I is 'Solutions of the Einstein Vacuum Equations', by Lydia Bieri. Part II is 'Solutions of the Einstein-Maxwell Equations', by Nina Zipser. A famous result of Christodoulou and Klainerman is the global nonlinear stability of Minkowski spacetime. In this book, Bieri and Zipser provide two extensions to this result. In the first part, Bieri solves the Cauchy problem for the Einstein vacuum equations with more general, asymptotically flat initial data, and describes precisely the asymptotic behavior. In particular, she assumes less decay in the power of @math and one less derivative than in the Christodoulou-Klainerman result. She proves that in this case, too, the initial data, being globally close to the trivial data, yields a solution which is a complete spacetime, tending to the Minkowski spacetime at infinity along any geodesic. In contrast to the original situation, certain estimates in this proof are borderline in view of decay, indicating that the conditions in the main theorem on the decay at infinity on the initial data are sharp. In the second part, Zipser proves the existence of smooth, global solutions to the Einstein-Maxwell equations. A nontrivial solution of these equations is a curved spacetime with an electromagnetic field. To prove the existence of solutions to the Einstein-Maxwell equations, Zipser follows the argument and methodology introduced by Christodoulou and Klainerman. To generalize the original results, she needs to contend with the additional curvature terms that arise due to the presence of the electromagnetic field @math ; in her case the Ricci curvature of the spacetime is not identically zero but rather represented by a quadratic in the components of @math . In particular the Ricci curvature is a constant multiple of the stress-energy tensor for @math . Furthermore, the traceless part of the Riemann curvature tensor no longer satisfies the homogeneous Bianchi equations but rather inhomogeneous equations including components of the spacetime Ricci curvature. Therefore, the second part of this book focuses primarily on the derivation of estimates for the new terms that arise due to the presence of the electromagnetic field. In this paper, we consider the problem of approximately aligning matching two graphs. Given two graphs (G_ 1 =(V_ 1 ,E_ 1 ) ) and (G_ 2 =(V_ 2 ,E_ 2 ) ), the objective is to map nodes (u, v G_1 ) to nodes (u',v' G_2 ) such that when u, v have an edge in (G_1 ), very likely their corresponding nodes (u', v' ) in (G_2 ) are connected as well. This problem with subgraph isomorphism as a special case has extra challenges when we consider matching complex networks exhibiting the small world phenomena. In this work, we propose to use ‘Ricci flow metric’, to define the distance between two nodes in a network. This is then used to define similarity of a pair of nodes in two networks respectively, which is the crucial step of network alignment. Specifically, the Ricci curvature of an edge describes intuitively how well the local neighborhood is connected. The graph Ricci flow uniformizes discrete Ricci curvature and induces a Ricci flow metric that is insensitive to node edge insertions and deletions. With the new metric, we can map a node in (G_1 ) to a node in (G_2 ) whose distance vector to only a few preselected landmarks is the most similar. The robustness of the graph metric makes it outperform other methods when tested on various complex graph models and real world network data sets (Emails, Internet, and protein interaction networks) (The source code of computing Ricci curvature and Ricci flow metric are available: https: github.com saibalmars GraphRicciCurvature). Abstract Since the seminal work of [Sussman, M, Smereka P, Osher S. A level set approach for computing solutions to incompressible two-phase flow. J Comput Phys 1994;114:146–59] on coupling the level set method of [Osher S, Sethian J. Fronts propagating with curvature-dependent speed: algorithms based on Hamilton–Jacobi formulations. J Comput Phys 1988;79:12–49] to the equations for two-phase incompressible flow, there has been a great deal of interest in this area. That work demonstrated the most powerful aspects of the level set method, i.e. automatic handling of topological changes such as merging and pinching, as well as robust geometric information such as normals and curvature. Interestingly, this work also demonstrated the largest weakness of the level set method, i.e. mass or information loss characteristic of most Eulerian capturing techniques. In fact, [Sussman M, Smereka P, Osher S. A level set approach for computing solutions to incompressible two-phase flow. J Comput Phys 1994;114:146–59] introduced a partial differential equation for battling this weakness, without which their work would not have been possible. In this paper, we discuss both historical and most recent works focused on improving the computational accuracy of the level set method focusing in part on applications related to incompressible flow due to both of its popularity and stringent accuracy requirements. Thus, we discuss higher order accurate numerical methods such as Hamilton–Jacobi WENO [Jiang G-S, Peng D. Weighted ENO schemes for Hamilton–Jacobi equations. SIAM J Sci Comput 2000;21:2126–43], methods for maintaining a signed distance function, hybrid methods such as the particle level set method [Enright D, Fedkiw R, Ferziger J, Mitchell I. A hybrid particle level set method for improved interface capturing. J Comput Phys 2002;183:83–116] and the coupled level set volume of fluid method [Sussman M, Puckett EG. A coupled level set and volume-of-fluid method for computing 3d and axisymmetric incompressible two-phase flows. J Comput Phys 2000;162:301–37], and adaptive gridding techniques such as the octree approach to free surface flows proposed in [Losasso F, Gibou F, Fedkiw R. Simulating water and smoke with an octree data structure, ACM Trans Graph (SIGGRAPH Proc) 2004;23:457–62].