Search

We construct an uncountable family of transversely Cantor laminations of compact spaces defined by free minimal actions of solvable groups, which are not affable and whose orbits are not quasi-isometric to Cayley graphs., Comment: 12 pages, 3 figures, to appear in Proceedings of the American Mathematical Society

A filling Dehn surface in a $3$-manifold $M$ is a generically immersed surface in $M$ that induces a cellular decomposition of $M$. Given a tame link $L$ in $M$ there is a filling Dehn sphere of $M$ that "trivializes" (\emph{diametrically splits}) it. This allows to construct filling Dehn surfaces in the coverings of $M$ branched over $L$. It is shown that one of the simplest filling Dehn spheres of $S^3$ (Banchoff's sphere) diametrically splits the trefoil knot. Filling Dehn spheres, and their Johansson diagrams, are constructed for the coverings of $S^3$ branched over the trefoil. The construction is explained in detail. Johansson diagrams for generic cyclic coverings and for the simplest locally cyclic and irregular ones are constructed explicitly, providing new proofs of known results about cyclic coverings and the $3$-fold irregular covering over the trefoil., Comment: 14 pages, 10 figures. Dedicated to Prof. Maite Lozano on her 70th anniversary

Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present the first known examples of undirected structures acting as suppressors of selection for any fitness value $r > 1$. This means that the average fixation probability of an advantageous mutant or invader individual placed at some node is strictly less than that of this individual placed in a well-mixed population. This leads the way to study more robust structures less prone to invasion, contrary to what happens with the amplifiers of selection where the fixation probability is increased on average for advantageous invader individuals. A few families of amplifiers are known, although some effort was required to prove it. Here, we use computer aided techniques to find an exact analytical expression of the fixation probability for some graphs of small order (equal to $6$, $8$ and $10$) proving that selection is effectively reduced for $r > 1$. Some numerical experiments using Monte Carlo methods are also performed for larger graphs., Comment: New title, improved presentation, and further examples. Supporting Information is also included

Bond percolation on Cayley graphs provides examples of random graphs. Other examples arise from the dynamical study of proper repetitive subgraphs of Cayley graphs. In this paper we demonstrate that these two families have mutually singular laws as a corollary of a general lemma about countable Borel equivalence relations on first countable Hausdorff spaces., Comment: To appear in Stochastics and Dynamics

We prove that any knot or link in any 3-manifold can be nicely decomposed (splitted) by a filling Dehn sphere. This has interesting consequences in the study of branched coverings over knots and links. We give an algorithm for computing Johansson diagrams of filling Dehn surfaces out from coverings of 3-manifolds branched over knots or links., Comment: 9 pages, 10 figures. arXiv admin note: text overlap with arXiv:1404.1657

Evolutionary dynamics has been classically studied for homogeneous populations, but now there is a growing interest in the non-homogenous case. One of the most important models has been proposed by Lieberman, Hauert and Nowak, adapting to a weighted directed graph the classical process described by Moran. The Markov chain associated with the graph can be modified by erasing all non-trivial loops in its state space, obtaining the so-called Embedded Markov chain (EMC). The fixation probability remains unchanged, but the expected time to absorption (fixation or extinction) is reduced. In this paper, we shall use this idea to compute asymptotically the average fixation probability for complete bipartite graphs. To this end, we firstly review some recent results on evolutionary dynamics on graphs trying to clarify some points. We also revisit the 'Star Theorem' proved by Lieberman, Hauert and Nowak for the star graphs. Theoretically, EMC techniques allow fast computation of the fixation probability, but in practice this is not always true. Thus, in the last part of the paper, we compare this algorithm with the standard Monte Carlo method for some kind of complex networks., Comment: Corrected typos

The triple point numbers and the triple point spectrum of a closed 3-manifold were defined in (R. Vigara, Representaci\'on de 3-variedades por esferas de Dehn rellenantes, PhD Thesis, UNED 2006). They are topological invariants that give a measure of the complexity of a 3-manifold using the number of triple points of minimal filling Dehn surfaces. Basic properties of these invariants are presented, and the triple point spectra of $\mathbb{S}^2\times \mathbb{S}^1$ and $\mathbb{S}^3$ are computed., Comment: 16 pages, 11 figures

The aim of the paper is to investigate the relation between inverse limit of branched manifolds and codimension zero laminations. We give necessary and sufficient conditions for such an inverse limit to be a lamination. We also show that codimension zero laminations are inverse limits of branched manifolds. The inverse limit structure allows us to show that equicontinuous codimension zero laminations preserves a distance function on transversals., Comment: 13 pages, 2 figures

We show that for a given finitely generated group, its Bernoulli shift space can be equivariantly embedded as a subset of a space of pointed trees with Gromov-Hausdorff metric and natural partial action of a free group. Since the latter can be realised as a transverse space of a foliated space with leaves Riemannian manifolds, this embedding allows us to obtain a suspension of such Bernoulli shift. By a similar argument we show that the space of pointed trees is universal for compactly generated expansive pseudogroups of transformations., Comment: Minor corrections. Accepted to: Dynamical Systems. An International Journal

We give a geometric proof of the Affability Theorem of T. Giordano, H. Matui, I. Putnam and C. Skau for aperiodic and repetitive planar tilings., Comment: This paper is a completely revised version of the previously posted paper where Lemma 6.1 was not true