Results 1  10
of
74
The tropical Grassmannian
, 2003
"... In tropical algebraic geometry, the solution sets of polynomial equations are piecewiselinear. We introduce the tropical variety of a polynomial ideal, and we identify it with a polyhedral subcomplex of the Gröbner fan. The tropical Grassmannian arises in this manner from the ideal of quadratic Plü ..."
Abstract

Cited by 101 (13 self)
 Add to MetaCart
In tropical algebraic geometry, the solution sets of polynomial equations are piecewiselinear. We introduce the tropical variety of a polynomial ideal, and we identify it with a polyhedral subcomplex of the Gröbner fan. The tropical Grassmannian arises in this manner from the ideal of quadratic Plücker relations. It is shown to parametrize all tropical linear spaces. Lines in tropical projective space are trees, and their tropical Grassmannian G2,n equals the space of phylogenetic trees studied by Billera, Holmes and Vogtmann. Higher Grassmannians offer a natural generalization of the space of trees. Their facets correspond to binomial initial ideals of the Plücker ideal. The tropical Grassmannian G3,6 is a simplicial complex glued from 1035 tetrahedra.
Tropical geometry and its applications
 the Proceedings of the Madrid ICM
"... Abstract. These notes outline some basic notions of Tropical Geometry and survey some of its applications for problems in classical (real and complex) geometry. To appear in the Proceedings of the Madrid ICM. 1. ..."
Abstract

Cited by 60 (3 self)
 Add to MetaCart
Abstract. These notes outline some basic notions of Tropical Geometry and survey some of its applications for problems in classical (real and complex) geometry. To appear in the Proceedings of the Madrid ICM. 1.
Rayleigh processes, real trees, and root growth with regrafting
, 2004
"... Abstract. The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous’s Brownian continuum random tree, the random treelike object naturally associated with ..."
Abstract

Cited by 47 (11 self)
 Add to MetaCart
Abstract. The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous’s Brownian continuum random tree, the random treelike object naturally associated with a standard Brownian excursion, may be thought of as a random compact real tree. The continuum random tree is a scaling limit as N → ∞ of both a critical GaltonWatson tree conditioned to have total population size N as well as a uniform random rooted combinatorial tree with N vertices. The Aldous–Broder algorithm is a Markov chain on the space of rooted combinatorial trees with N vertices that has the uniform tree as its stationary distribution. We construct and study a Markov process on the space of all rooted compact real trees that has the continuum random tree as its stationary distribution and arises as the scaling limit as N → ∞ of the Aldous–Broder chain. A key technical ingredient in this work is the use of a pointed Gromov–
The Bergman complex of a matroid and phylogenetic trees
 THE JOURNAL OF COMBINATORIAL THEORY, SERIES B
, 2005
"... ..."
Tropical convexity
 Documenta Math
"... Abstract. The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications to phylogenetic trees are discussed. 1. ..."
Abstract

Cited by 42 (6 self)
 Add to MetaCart
Abstract. The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications to phylogenetic trees are discussed. 1.
Tropical curves, their jacobians and theta functions
, 612
"... Abstract. We study Jacobian varieties for tropical curves. These are real tori equipped with integral affine structure and symmetric bilinear form. We define tropical counterpart of the theta function and establish tropical versions of the AbelJacobi, RiemannRoch and Riemann theta divisor theorems ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
Abstract. We study Jacobian varieties for tropical curves. These are real tori equipped with integral affine structure and symmetric bilinear form. We define tropical counterpart of the theta function and establish tropical versions of the AbelJacobi, RiemannRoch and Riemann theta divisor theorems. 1.
Subtree prune and regraft: A reversible realtree valued Markov chain
 Ann. Prob
"... Abstract. We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and regraft (SPR) Markov chains that appear in phylogenetic analysis. A key technic ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
Abstract. We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and regraft (SPR) Markov chains that appear in phylogenetic analysis. A key technical ingredient in this work is the use of a novel Gromov– Hausdorff type distance to metrize the space whose elements are compact real trees equipped with a probability measure. Also, the investigation of the Dirichlet form hinges on a new path decomposition of the Brownian excursion. 1.
Analysis of systematic scan Metropolis algorithms using Iwahori–Hecke algebra techniques
 Michigan Math. J
, 2000
"... Abstract. We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
Abstract. We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication in the IwahoriHecke algebra. 1.
Tropical fans and the moduli spaces of tropical curves
 COMPOS. MATH
, 2009
"... We give a rigorous definition of tropical fans (the “local building blocks for tropical varieties”) and their morphisms. For such a morphism of tropical fans of the same dimension we show that the number of inverse images (counted with suitable tropical multiplicities) of a point in the target does ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We give a rigorous definition of tropical fans (the “local building blocks for tropical varieties”) and their morphisms. For such a morphism of tropical fans of the same dimension we show that the number of inverse images (counted with suitable tropical multiplicities) of a point in the target does not depend on the chosen point — a statement that can be viewed as the beginning of a tropical intersection theory. As an application we consider the moduli spaces of rational tropical curves (both abstract and in some Rr) together with the evaluation and forgetful morphisms. Using our results this gives new, easy, and unified proofs of various tropical independence statements, e.g. of the fact that the numbers of rational tropical curves (in any Rr) through given points are independent of the points.
Metric graph theory and geometry: a survey
 CONTEMPORARY MATHEMATICS
"... The article surveys structural characterizations of several graph classes defined by distance properties, which have in part a general algebraic flavor and can be interpreted as subdirect decomposition. The graphs we feature in the first place are the median graphs and their various kinds of general ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
The article surveys structural characterizations of several graph classes defined by distance properties, which have in part a general algebraic flavor and can be interpreted as subdirect decomposition. The graphs we feature in the first place are the median graphs and their various kinds of generalizations, e.g., weakly modular graphs, or fibercomplemented graphs, or l1graphs. Several kinds of l1graphs admit natural geometric realizations as polyhedral complexes. Particular instances of these graphs also occur in other geometric contexts, for example, as dual polar graphs, basis graphs of (even ∆)matroids, tope graphs, lopsided sets, or plane graphs with vertex degrees and face sizes bounded from below. Several other classes of graphs, e.g., Helly graphs (as injective objects), or bridged graphs (generalizing chordal graphs), or treelike graphs such as distancehereditary graphs occur in the investigation of graphs satisfying some basic properties of the distance function, such as the Helly property for balls, or the convexity of balls or of the neighborhoods of convex sets, etc. Operators between graphs or complexes relate some of the