Related papers: Asymptotically Optimal Amplifiers for the Moran Pr…
To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on…
We study ancestral structures for the two-type Moran model with mutation and frequency-dependent selection under the nonlinear dominance or fittest-type-wins scheme. Under appropriate conditions, both lead, in distribution, to the same…
We consider time-inhomogeneous ODEs whose parameters are governed by an underlying ergodic Markov process. When this underlying process is accelerated by a factor $\varepsilon^{-1}$, an averaging phenomenon occurs and the solution of the…
We describe a simple deterministic $O( \varepsilon^{-1} \log \Delta)$ round distributed algorithm for $(2\alpha+1)(1 + \varepsilon)$ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$…
A simple criterion to optimise coarse-grainings for exact renormalisation group equations is given. It is aimed at improving the convergence of approximate solutions of flow equations. The optimisation criterion is generic, as it refers…
We prove that, for any measurable phase space subset $\Omega\subset\mathbb{R}^{2d}$ with $0<|\Omega|<\infty$ and any $1\le p < \infty$, the nonlinear concentration problem $$ \sup_{f \in…
The Muon optimizer has recently attracted considerable attention for its strong empirical performance and use of orthogonalized updates on matrix-shaped parameters, yet its underlying mechanisms and relationship to adaptive optimizers such…
Gaussian elimination is the most popular technique for solving a dense linear system. Large errors in this procedure can occur in floating point arithmetic when the matrix's growth factor is large. In the study of numerical linear algebra,…
Galluccio--Loebl and Tesler showed that the perfect-matching polynomial of a graph embedded in an orientable surface of genus $g$ can be written as a linear combination of at most $4^g$ Pfaffians. We show that, in general, exponentially…
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that…
Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One problem of this type was recently raised by Alon, Gujgiczer,…
For $\Omega \subset \mathbb{R}^n$, a convex and bounded domain, we study the spectrum of $-\Delta_\Omega$ the Dirichlet Laplacian on $\Omega$. For $\Lambda\geq0$ and $\gamma \geq 0$ let $\Omega_{\Lambda, \gamma}(\mathcal{A})$ denote any…
We study stochastic evolutionary game dynamics in a population of finite size. Individuals in the population are divided into two dynamically evolving groups. The structure of the population is formally described by a Wright-Fisher type…
The Wright-Fisher model and the Moran model are both widely used in population genetics. They describe the time evolution of the frequency of an allele in a well-mixed population with fixed size. We propose a simple and tractable model…
We consider three classical models of biological evolution: (i) the Moran process, an example of a reducible Markov Chain; (ii) the Kimura Equation, a particular case of a degenerated Fokker-Planck Diffusion; (iii) the Replicator Equation,…
In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…
Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…
This paper deals with evolution problem for the $1$-Laplacian with mixed boundary conditions on a bounded open set $\Omega$ of $\R^N$. We prove existence and uniqueness of strong solutions for data in $L^2(\Omega)$ by mean of the theory of…
The paper is devoted to the study of the asymptotic behaviour of Moran process in random environment, say random selection. In finite population, the Moran process may be degenerate in finite time, thus we will study its limiting process in…
Several domination results have been obtained for maximal outerplanar graphs (mops). The classical domination problem is to minimize the size of a set $S$ of vertices of an $n$-vertex graph $G$ such that $G - N[S]$, the graph obtained by…