Related papers: Admissibility and general dichotomies for evolutio…
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these models in high-dimensions, such as when there is some sparsity…
A digraph is attached to any evolution algebra. This graph leads to some new purely algebraic results on this class of algebras and allows for some new natural proofs of known results. Nilpotency of an evolution algebra will be proved to be…
The Dollo model for reconstructing evolutionary trees from binary characters has been proposed as a generalization of the infinite sites model, also known as the Perfect Phylogeny. In particular, the Dollo model is considered more realistic…
This paper is concerned with growth series for expansion complexes for finite subdivision rules. Suppose X is an expansion complex for a finite subdivision rule with bounded valence and mesh approaching 0, and let S be a seed for X. One can…
This paper investigates the asymptotic behaviour of solutions of periodic evolution equations. Starting with a general result concerning the quantified asymptotic behaviour of periodic evolution families we go on to consider a special class…
We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in…
We propose a notion of random horseshoe for one-dimensional random dynamical systems. We prove the abundance of random horseshoes for a class of circle endomorphisms subject to additive noise, large enough to make the Lyapunov exponent…
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which…
The asymptotic expansion of the distribution of the gradient test statistic is derived for a composite hypothesis under a sequence of Pitman alternative hypotheses converging to the null hypothesis at rate $n^{-1/2}$, $n$ being the sample…
We investigate the behavior of the dichotomy spectrum of nonautonomous linear systems under general growth rates. By introducing comparison criteria we clarify how $\mu$-dichotomy and $\mu$-bounded growth interact. We also study the…
We survey recent work on normal functions, including limits and singularities of admissible normal functions, the Griffiths-Green approach to the Hodge conjecture, algebraicity of the zero-locus of a normal function, Neron models, and…
For Markov processes with absorption, we provide general criteria ensuring the existence and the exponential non-uniform convergence in total variation norm to a quasi-stationary distribution. We also characterize a subset of its domain of…
The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…
A wide range of stochastic processes that model the growth and decline of populations exhibit a curious dichotomy: with certainty either the population goes extinct or its size tends to infinity. There is a elegant and classical theorem…
We introduce the problem of estimation of the parameters of a dynamically selected population in an infinite sequence of random variables and provide its application in the statistical inference based on record values from a non-stationary…
We consider an evolution algebra which corresponds to a bisexual population with a set of females partitioned into finitely many different types and the males having only one type. We study basic properties of the algebra. This algebra is…
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…