Combinatorics and geometry of finite and infinite squaregraphs

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar dual of a finite squaregraph is determined by a triangle-free chord diagram of the unit disk, which could alternatively be viewed as a triangle-free line arrangement in the hyperbolic plane. This representation carries over to infinite plane graphs with finite vertex degrees in which the balls are finite squaregraphs. Algebraically, finite squaregraphs are median graphs for which the duals are finite circular split systems. Hence squaregraphs are at the crosspoint of two dualities, an algebraic and a geometric one, and thus lend themselves to several combinatorial interpretations and structural characterizations. With these and the 5-colorability theorem for circle graphs at hand, we prove that every squaregraph can be isometrically embedded into the Cartesian product of five trees. This embedding result can also be extended to the infinite case without reference to an embedding in the plane and without any cardinality restriction when formulated for median graphs free of cubes and further finite obstructions. Further, we exhibit a class of squaregraphs that can be embedded into the product of three trees and we characterize those squaregraphs that are embeddable into the product of just two trees. Finally, finite squaregraphs enjoy a number of algorithmic features that do not extend to arbitrary median graphs. For instance, we show that median-generating sets of finite squaregraphs can be computed in polynomial time, whereas, not unexpectedly, the corresponding problem for median graphs turns out to be NP-hard.Comment: 46 pages, 14 figure

Topological Data Analysis with Bregman Divergences

Given a finite set in a metric space, the topological analysis generalizes hierarchical clustering using a 1-parameter family of homology groups to quantify connectivity in all dimensions. The connectivity is compactly described by the persistence diagram. One limitation of the current framework is the reliance on metric distances, whereas in many practical applications objects are compared by non-metric dissimilarity measures. Examples are the Kullback-Leibler divergence, which is commonly used for comparing text and images, and the Itakura-Saito divergence, popular for speech and sound. These are two members of the broad family of dissimilarities called Bregman divergences. We show that the framework of topological data analysis can be extended to general Bregman divergences, widening the scope of possible applications. In particular, we prove that appropriately generalized Cech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized Cech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory

Discrete isometry groups of symmetric spaces

This survey is based on a series of lectures that we gave at MSRI in Spring 2015 and on a series of papers, mostly written jointly with Joan Porti. Our goal here is to: 1. Describe a class of discrete subgroups $\Gamma<G$ of higher rank semisimple Lie groups, which exhibit some "rank 1 behavior". 2. Give different characterizations of the subclass of Anosov subgroups, which generalize convex-cocompact subgroups of rank 1 Lie groups, in terms of various equivalent dynamical and geometric properties (such as asymptotically embedded, RCA, Morse, URU). 3. Discuss the topological dynamics of discrete subgroups $\Gamma$ on flag manifolds associated to $G$ and Finsler compactifications of associated symmetric spaces $X=G/K$. Find domains of proper discontinuity and use them to construct natural bordifications and compactifications of the locally symmetric spaces $X/\Gamma$.Comment: 77 page

Hypothesis Testing For Network Data in Functional Neuroimaging

In recent years, it has become common practice in neuroscience to use networks to summarize relational information in a set of measurements, typically assumed to be reflective of either functional or structural relationships between regions of interest in the brain. One of the most basic tasks of interest in the analysis of such data is the testing of hypotheses, in answer to questions such as "Is there a difference between the networks of these two groups of subjects?" In the classical setting, where the unit of interest is a scalar or a vector, such questions are answered through the use of familiar two-sample testing strategies. Networks, however, are not Euclidean objects, and hence classical methods do not directly apply. We address this challenge by drawing on concepts and techniques from geometry, and high-dimensional statistical inference. Our work is based on a precise geometric characterization of the space of graph Laplacian matrices and a nonparametric notion of averaging due to Fr\'echet. We motivate and illustrate our resulting methodologies for testing in the context of networks derived from functional neuroimaging data on human subjects from the 1000 Functional Connectomes Project. In particular, we show that this global test is more statistical powerful, than a mass-univariate approach. In addition, we have also provided a method for visualizing the individual contribution of each edge to the overall test statistic.Comment: 34 pages. 5 figure

Amenable hyperbolic groups

We give a complete characterization of the locally compact groups that are non-elementary Gromov-hyperbolic and amenable. They coincide with the class of mapping tori of discrete or continuous one-parameter groups of compacting automorphisms. We moreover give a description of all Gromov-hyperbolic locally compact groups with a cocompact amenable subgroup: modulo a compact normal subgroup, these turn out to be either rank one simple Lie groups, or automorphism groups of semi-regular trees acting doubly transitively on the set of ends. As an application, we show that the class of hyperbolic locally compact groups with a cusp-uniform non-uniform lattice, is very restricted.Comment: 41 pages, no figure. v2: revised version (minor changes

Structural stability of meandering-hyperbolic group actions

In his 1985 paper Sullivan sketched a proof of his structural stability theorem for group actions satisfying certain expansion-hyperbolicity axioms. In this paper we relax Sullivan's axioms and introduce a notion of meandering hyperbolicity for group actions on general metric spaces. This generalization is substantial enough to encompass actions of certain non-hyperbolic groups, such as actions of uniform lattices in semisimple Lie groups on flag manifolds. At the same time, our notion is sufficiently robust and we prove that meandering-hyperbolic actions are still structurally stable. We also prove some basic results on meandering-hyperbolic actions and give other examples of such actions.Comment: 58 pages, 5 figures; [v2] Corollary 3.19 is wrong and thus removed; [v3] Introduced a new notion of meandering hyperbolicity, generalized the main structural stability theorem even further, and added a new Section 5 on uniform lattices and their structural stabilit

Small eigenvalues of random 3-manifolds

We show that for every $g\geq 2$ there exists a number $c(g)>0$ such that the smallest positive eigenvalue of a random closed 3-manifold $M$ of Heegaard genus $g$ is at most $c(g)/{\rm vol}(M)^2$.Comment: 52 pages. Major revisio