7 research outputs found
Toll Based Measures for Dynamical Graphs
Biological networks are one of the most studied object in computational
biology. Several methods have been developed for studying qualitative
properties of biological networks. Last decade had seen the improvement of
molecular techniques that make quantitative analyses reachable. One of the
major biological modelling goals is therefore to deal with the quantitative
aspect of biological graphs. We propose a probabilistic model that suits with
this quantitative aspects. Our model combines graph with several dynamical
sources. It emphazises various asymptotic statistical properties that might be
useful for giving biological insightsComment: 11 page
Multi-dimensional Boltzmann Sampling of Languages
This paper addresses the uniform random generation of words from a
context-free language (over an alphabet of size ), while constraining every
letter to a targeted frequency of occurrence. Our approach consists in a
multidimensional extension of Boltzmann samplers \cite{Duchon2004}. We show
that, under mostly \emph{strong-connectivity} hypotheses, our samplers return a
word of size in and exact frequency in
expected time. Moreover, if we accept tolerance
intervals of width in for the number of occurrences of each
letters, our samplers perform an approximate-size generation of words in
expected time. We illustrate these techniques on the
generation of Tetris tessellations with uniform statistics in the different
types of tetraminoes.Comment: 12p
Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration
The field of analytic combinatorics, which studies the asymptotic behaviour
of sequences through analytic properties of their generating functions, has led
to the development of deep and powerful tools with applications across
mathematics and the natural sciences. In addition to the now classical
univariate theory, recent work in the study of analytic combinatorics in
several variables (ACSV) has shown how to derive asymptotics for the
coefficients of certain D-finite functions represented by diagonals of
multivariate rational functions. We give a pedagogical introduction to the
methods of ACSV from a computer algebra viewpoint, developing rigorous
algorithms and giving the first complexity results in this area under
conditions which are broadly satisfied. Furthermore, we give several new
applications of ACSV to the enumeration of lattice walks restricted to certain
regions. In addition to proving several open conjectures on the asymptotics of
such walks, a detailed study of lattice walk models with weighted steps is
undertaken.Comment: PhD thesis, University of Waterloo and ENS Lyon - 259 page