|
Cheeger Constant
In Riemannian geometry, the Cheeger isoperimetric constant of a compact Riemannian manifold ''M'' is a positive real number ''h''(''M'') defined in terms of the minimal area of a hypersurface that divides ''M'' into two disjoint pieces. In 1971, Jeff Cheeger proved an inequality that related the first nontrivial eigenvalue of the Laplace–Beltrami operator on ''M'' to ''h''(''M''). In 1982, Peter Buser proved a reverse version of this inequality, and the two inequalities put together are sometimes called the ''Cheeger-Buser inequality''. These inequalities were highly influential not only in Riemannian geometry and global analysis, but also in the theory of Markov chains and in graph theory, where they have inspired the analogous Cheeger constant of a graph and the notion of conductance. Definition Let ''M'' be an ''n''-dimensional closed Riemannian manifold. Let ''V''(''A'') denote the volume of an ''n''-dimensional submanifold ''A'' and ''S''(''E'') denote the ''n''&mi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemannian Geometry
Riemannian geometry is the branch of differential geometry that studies Riemannian manifolds, defined as manifold, smooth manifolds with a ''Riemannian metric'' (an inner product on the tangent space at each point that varies smooth function, smoothly from point to point). This gives, in particular, local notions of angle, arc length, length of curves, surface area and volume. From those, some other global quantities can be derived by integral, integrating local contributions. Riemannian geometry originated with the vision of Bernhard Riemann expressed in his inaugural lecture "" ("On the Hypotheses on which Geometry is Based"). It is a very broad and abstract generalization of the differential geometry of surfaces in Three-dimensional space, R3. Development of Riemannian geometry resulted in synthesis of diverse results concerning the geometry of surfaces and the behavior of geodesics on them, with techniques that can be applied to the study of differentiable manifolds of higher ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Markov Chain
In probability theory and statistics, a Markov chain or Markov process is a stochastic process describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs ''now''." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). Markov processes are named in honor of the Russian mathematician Andrey Markov. Markov chains have many applications as statistical models of real-world processes. They provide the basis for general stochastic simulation methods known as Markov chain Monte Carlo, which are used for simulating sampling from complex probability distributions, and have found application in areas including Bayesian statistics, biology, chemistry, economics, fin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isoperimetric Problem
In mathematics, the isoperimetric inequality is a geometric inequality involving the square of the circumference of a closed curve in the plane and the area of a plane region it encloses, as well as its various generalizations. '' Isoperimetric'' literally means "having the same perimeter". Specifically, the isoperimetric inequality states, for the length ''L'' of a closed curve and the area ''A'' of the planar region that it encloses, that :4\pi A \le L^2, and that equality holds if and only if the curve is a circle. The isoperimetric problem is to determine a plane figure of the largest possible area whose boundary has a specified length. The closely related ''Dido's problem'' asks for a region of the maximal area bounded by a straight line and a curvilinear arc whose endpoints belong to that line. It is named after Dido, the legendary founder and first queen of Carthage. The solution to the isoperimetric problem is given by a circle and was known already in Ancient Greece. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ricci Curvature
In differential geometry, the Ricci curvature tensor, named after Gregorio Ricci-Curbastro, is a geometric object which is determined by a choice of Riemannian or pseudo-Riemannian metric on a manifold. It can be considered, broadly, as a measure of the degree to which the geometry of a given metric tensor differs locally from that of ordinary Euclidean space or pseudo-Euclidean space. The Ricci tensor can be characterized by measurement of how a shape is deformed as one moves along geodesics in the space. In general relativity, which involves the pseudo-Riemannian setting, this is reflected by the presence of the Ricci tensor in the Raychaudhuri equation. Partly for this reason, the Einstein field equations propose that spacetime can be described by a pseudo-Riemannian metric, with a strikingly simple relationship between the Ricci tensor and the matter content of the universe. Like the metric tensor, the Ricci tensor assigns to each tangent space of the manifold a symmetric bi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Infimum
In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, and if ''b'' is a lower bound of S, then ''b'' is less than or equal to the infimum of S. Consequently, the term ''greatest lower bound'' (abbreviated as ) is also commonly used. The supremum (abbreviated sup; : suprema) of a subset S of a partially ordered set P is the least element in P that is greater than or equal to each element of S, if such an element exists. If the supremum of S exists, it is unique, and if ''b'' is an upper bound of S, then the supremum of S is less than or equal to ''b''. Consequently, the supremum is also referred to as the ''least upper bound'' (or ). The infimum is, in a precise sense, dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in anal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Closed Manifold
In mathematics, a closed manifold is a manifold Manifold with boundary, without boundary that is Compact space, compact. In comparison, an open manifold is a manifold without boundary that has only ''non-compact'' components. Examples The only Connected space, connected one-dimensional example is a circle. The sphere, torus, and the Klein bottle are all closed two-dimensional manifolds. The real projective space RP''n'' is a closed ''n''-dimensional manifold. The complex projective space CP''n'' is a closed 2''n''-dimensional manifold. A Real line, line is not closed because it is not compact. A closed disk is a compact two-dimensional manifold, but it is not closed because it has a boundary. Properties Every closed manifold is a Euclidean neighborhood retract and thus has finitely generated homology groups. If M is a closed connected n-manifold, the n-th homology group H_(M;\mathbb) is \mathbb or 0 depending on whether M is Orientability, orientable or not. Moreover, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Conductance (graph Theory)
In theoretical computer science, graph theory, and mathematics, the conductance is a parameter of a Markov chain that is closely tied to its Markov chain mixing time, mixing time, that is, how rapidly the chain converges to its Discrete-time Markov chain#Stationary distributions, stationary distribution, should it exist. Equivalently, the conductance can be viewed as a parameter of a directed Graph (discrete mathematics), graph, in which case it can be used to analyze how quickly random walk, random walks in the graph converge. The conductance of a graph is closely related to the Cheeger constant (graph theory), Cheeger constant of the graph, which is also known as the Expander graph#Edge expansion, edge expansion or the isoperimetic number. However, due to subtly different definitions, the conductance and the edge expansion do not generally coincide if the graphs are not Regular graph, regular. On the other hand, the notion of electrical conductance that appears in electrical ne ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cheeger Constant (graph Theory)
In mathematics, the Cheeger constant (also Cheeger number or isoperimetric number) of a graph is a numerical measure of whether or not a graph has a "bottleneck". The Cheeger constant as a measure of "bottleneckedness" is of great interest in many areas: for example, constructing well-connected networks of computers, card shuffling. The graph theoretical notion originated after the Cheeger isoperimetric constant of a compact Riemannian manifold. The Cheeger constant is named after the mathematician Jeff Cheeger. Definition Let be an undirected finite graph with vertex set and edge set . For a collection of vertices , let denote the collection of all edges going from a vertex in to a vertex outside of (sometimes called the ''edge boundary'' of ): :\partial A := \. Note that the edges are unordered, i.e., \ = \. The Cheeger constant of , denoted , is defined by :h(G) := \min \left\. The Cheeger constant is strictly positive if and only if is a connected graph. Intui ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') which are connected by ''Glossary of graph theory terms#edge, edges'' (also called ''arcs'', ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a Set (mathematics), set of vertices (also called nodes or points); * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Global Analysis
In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles. Global analysis uses techniques in infinite-dimensional manifold theory and topological spaces of mappings to classify behaviors of differential equations, particularly nonlinear differential equations. These spaces can include singularities and hence catastrophe theory is a part of global analysis. Optimization problems, such as finding geodesics on Riemannian manifolds, can be solved using differential equations, so that the calculus of variations overlaps with global analysis. Global analysis finds application in physics Physics is the scientific study of matter, its Elementary particle, fundamental constituents, its motion and behavior through space and time, and the related entities of energy and force. "Physical science is that department of knowledge whi ... in the study of dynamica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact Space
In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space. The idea is that a compact space has no "punctures" or "missing endpoints", i.e., it includes all ''limiting values'' of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval ,1would be compact. Similarly, the space of rational numbers \mathbb is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers \mathbb is not compact either, because it excludes the two limiting values +\infty and -\infty. However, the ''extended'' real number line ''would'' be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other topological spaces. One suc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jürg Peter Buser
Jürg Peter Buser, known as Peter Buser, (born 27 February 1946 in Basel) is a Swiss mathematician, specializing in differential geometry and global analysis. Education and career Buser received his doctorate in 1976 from the University of Basel with advisor Heinz Huber and thesis ''Untersuchungen über den ersten Eigenwert des Laplaceoperators auf kompakten Flächen'' (Studies on the first eigenvalue of the Laplace operator on compact surfaces). As a post-doctoral student he was at the University of Bonn, the University of Minnesota. and the State University of New York at Stony Brook, before he habilitated at the University of Bonn with a thesis on the length spectrum of Riemann surfaces. Buser is known for his construction of curved isospectral surfaces (published in 1986 and 1988). His 1988 construction led to a negative solution to Mark Kac's famous 1966 problem '' Can one hear the shape of a drum?''. The negative solution was published in 1992 by Scott Wolpert, David Webb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
