1,721,047 research outputs found

    Epistasis, reguläre Unterteilungen und Spannbäume

    No full text
    In this thesis, we use techniques from polyhedral geometry and statistics in order to detect and quantify biological interactions within a system of genes or species described by a given data set. Our concept relies on the theory of regular subdivisions. A regular subdivision decomposes a space into convex cells and can be used to showcase some distinct aspects of the given data set in its cell structure. After all, one can implement and compute with regular subdivisions and this is an important feature of polyhedral and discrete geometry. The way these cells spatially relate to each other is exploited to determine a list of moderate length with potentially significant biological interactions. A statistical test allows us to diminish this list further and to point to few but statistically significant interactions. A major benefit of our method, and in a way this is reciprocal compared to other existing methods, is the concise extent of our findings which allows for communicating them in a comprehensive form, for instance in data tables or specifically developed bar diagrams. We applied our methods to several experimentally obtained genetic and microbiome data sets. A central use case was the analysis of two instances of Drosophila melanogaster fly gut microbiome studies. The gut of these fruit flies has a microbiome with a small number of constituting species and can be manipulated in the laboratory by regulation of the food. The two Drosophila data sets we applied our methods on describe a microbiome system with five species and hence each of the two data sets can be related to some regular subdivision of the 5-dimensional 0/1-cube from where our method departs. We are able to point to significant higher dimensional interactions which are not perceived by other existing methods and, in particular, are not captured by looking at pairs of interacting species only. Further, we reinterpret and analyze our method mathematically. It produces and is in some way equivalent to naming a network of shortest genetic distances, i.e. a minimum spanning tree of a certain fixed weighted graph with biological meaning. Tropical hypersurfaces, central objects of tropical geometry, which is an active field of research at the border of polyhedral, discrete and algebraic geometry, encapsulate these structures inside their 1-dimensional skeleton. We determine the parameter space of the minimum spanning trees arising this way. It turns out to be encoded by a collection of cones given by linear hyperplanes. For a few elected examples we computed an explicit representation of all occuring parameter cones. Yet, this rapidly reaches limits of complexity. The rest of this thesis is about an achievement beyond these limits. Given a cell decomposition in some implicit form, one may not be able to recuperate the defining geometric data for every cell. But it still may be possible to enumerate them. We present a method for computing the number of chambers of a hyperplane arrangement in real euclidean space which uses purely combinatorial techniques and which makes use of the combinatorial symmetries of the given hyperplane arrangement. With this method, it was possible to compute the previously unknown number of chambers of the ninth resonance arrangement given by 511 hyperplanes in R^9.In dieser Arbeit werden Techniken aus der polyedrischen Geometrie und der Statistik vorgestellt, die benutzt werden können, um biologische Wechselwirkungen in einem durch Datensätze beschriebenen Gen- oder Speziensystem aufzufinden und zu quantifizieren. Unser Konzept beruht auf der Theorie der regulären Unterteilungen. Eine reguläre Unterteilung zerlegt einen Raum in konvexe Zellen, die im vorliegenden Fall dazu dienen, ausgewiesene Eigenschaften der zugrundeliegenden Daten aufzuzeigen. Desweiteren lassen sich reguläre Unterteilungen in Computerprogrammen implementieren und berechnen, was allgemein einen wichtigen Aspekt der polyedrischen und diskreten Geometrie darstellt. Der räumliche Bezug der Zellen zueinander wird hierbei benutzt, um eine Liste angemessener Länge mit potenziell signifikanten biologischen Wechselwirkungen zu erstellen. Desweiteren dient ein statistischer Signifikanztest zur weiteren Ausdünnung dieser Liste, die schließlich nur noch statistisch nachweißbar signifikante Wechselwirkungen enthält. Durch die Bündelung und Konzentration auf relevante Wechselwirkungen zeichnet sich unsere Methode wesentlich aus, da dies sich durchaus konträr zu den bereits existierenden Methoden verhält und eine stringente Kommunikation der Ergebnisse gestattet, beispielsweise in Form von Datentabellen oder eigens konzipierter Bardiagramme. Wir haben unsere Methode auf mehrere Experimentaldatensätze mit Genetik- und Mikrobiombezug angewandt. Ein zentraler Anwendungsfall stellte dabei die Analyse zweier Datensätze dar, die das Mikrobiom des Magens der Drosophila melanogaster Fliege experimentell erfassen. Das Mikrobiom des Magens dieser Fruchtfliege hat die besondere Eigenschaft, durch eine geringe Anzahl von teilhabenden Spezien bestimmt und im Labor leicht manipulierbar zu sein, etwa durch Regulierung des Futters. Die zwei Drosophila Datensätze, die wir betrachteten, beschreiben jeweils ein Mikrobiomsystem mit fünf konstituierenden Spezien und können folglich mit regulären Unterteilungen des fünfdimensionalen 0/1-Würfels assoziiert werden, welche die von uns entwickelte Methode verarbeitet. Es war uns möglich, höherdimensionale Wechselwirkungen zu finden, die von den bereits existierenden Methoden nicht gesehen werden und insbesondere vom Paarvergleich wechselwirkender Spezien übergangen werden. Desweiteren interpretieren und analysieren wir unsere biologisch motivierte Methode innermathematisch. Im Einzelfall ist der Verlauf dieser äquivalent zur Konstruktion eines Spannbaums minimalen Gewichts in einem festgeschriebenen gewichteten Graph. Dieser Spannbaum lässt sich biologisch wiederum als Netzwerk kürzester genetischer Distanz interpretieren. Tropische Hyperflächen sind zentrale Objekte der tropischen Geometrie, eines eigens für sich aktiven Forschungsgebiets mit Anknüpfungspunkten zur polyedrischen, diskreten und algebraischen Geometrie. Diese Hyperflächen enthalten die betreffenden minimalen Spannbäume in ihrem eindimensionalen Skelett. Wir zeigen, dass der Parameterbereich dieser minimalen Spannbäume durch eine Sammlung polyedrischer Kegel gegeben ist. Für ausgewählte, kleine Bespiele gelingt es, eine explizite Darstellung für jeden einzelnen Parameterkegel zu berechnen. Dennoch stößt man dabei schnell auf unüberwindbare Komplexitätsschranken. Der Rest dieser Arbeit beschäftigt sich mit einer Thematik, die jenseits dieser Komplexitätsschranken liegt. Zwar mag es für eine implizit gegebene Zellzerlegung mit den aktuellen Methoden unmöglich sein, für jede einzelne Zelle eine explizite geometrische Beschreibung zu errechnen, jedoch kann durchaus eine Abzählung der Zellen erfolgen. Wir präsentieren eine rein kombinatorische Methode zur Abzählung der Kammern eines reellen Hyperebenenarrangements, die wesentlich auf der Ausnutzung kombinatorischer Symmetrie fußt. Mit dieser Methode war es uns möglich, die zuvor unbekannte Kammeranzahl des neunten Resonanzarrangements zu bestimmen, das durch 511 Hyperebenen im R^9 gegeben ist.DFG, 286237555, TRR 195: Symbolische Werkzeuge in der Mathematik und ihre Anwendun

    CORRELATIONS IN THE MULTISPECIES TASEP AND A CONJECTURE BY LAM

    No full text
    We study correlations in the multispecies TASEP on a ring. Results on the correlation of two adjacent points prove two conjectures by Thomas Lam on (a) the limiting direction of a reduced random walk in (A) over tilde (n-1) and (b) the asymptotic shape of a random integer partition with no hooks of length n, a so called n-core. We further investigate two-point correlations far apart and three-point nearest neighbour correlations and prove explicit formulas in almost all cases. These results can be seen as a finite strengthening of correlations in the TASEP speed process by Amir, Angel and Valko. We also give conjectures for certain higher order nearest neighbour correlations. We find an unexplained independence property (provably for two points, conjecturally for more points) between points that are closer in position than in value that deserves more study

    An inhomogeneous multispecies TASEP on a ring

    No full text
    We reinterpret and generalize conjectures of Lam and Williams as statements about the stationary distribution of a multispecies exclusion process on the ring. The central objects in our study are the multiline queues of Ferrari and Martin. We make some progress on some of the conjectures in different directions. First, we prove Lam and Williams' conjectures in two special cases by generalizing the rates of the Ferrari-Martin transitions. Secondly, we define a new process on multiline queues, which have a certain minimality property. This gives another proof for one of the special cases; namely arbitrary jump rates for three species. (C) 2014 Elsevier Inc. All rights reserved

    Uddaltasmetoden och röstningsprocesser

    No full text

    Erratum to 'On Percolation and the Bunkbed Conjecture' (vol 20, pg 103, 2011)

    No full text
    There was an incorrect argument in the proof of the main theorem in 'On percolation and the bunkbed conjecture', in Combin. Probab. Comput. (2011) 20 103-117 doi:10.1017/S0963548309990666. I thus no longer claim to have a proof for the bunkbed conjecture for outerplanar graphs.</p

    Partitions with Restricted Block Sizes, Möbius Functions and the k-of-each Problem.

    No full text
    {\newcommand{\R} {{\rm {\mbox{\protect\makebox[.15em][l]{I}R}}}} Given a list of nn numbers in R\R , one wants to decide wether every number in the list occurs at least kk times. I will show that (1ϵ)nlog3(n/k)(1-\epsilon)n\log_3(n/k) is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lov\'asz method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general.

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Get PDF
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    The cyclic sieving phenomenon on circular Dyck paths

    No full text
    We give a q-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this q-analogue exhibits the cyclic sieving phenomenon under a natural action of the cyclic group. The enumeration and cyclic sieving is generalized to Mobius paths. We also discuss properties of a generalization of cyclic sieving, which we call subset cyclic sieving, and introduce the notion of Lyndon-like cyclic sieving that concerns special recursive properties of combinatorial objects exhibiting the cyclic sieving phenomenon.</p

    Variations on the Author

    Get PDF
    “Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
    corecore