English
Related papers

Related papers: A sharp growth condition for a fast escaping spide…

200 papers

A spatial three level food web model with a closed nutrient cycle is presented and analyzed via Monte Carlo simulations. The time evolution of the model reveals two asymptotic states: an absorbing one with all species being extinct, and a…

Populations and Evolution · Quantitative Biology 2015-06-12 Janusz Szwabiński

Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant…

Physics and Society · Physics 2015-05-26 Zhihao Wu , Giulia Menichetti , Christoph Rahmede , Ginestra Bianconi

In recent years, there has been significant progress in the understanding of the dynamics of transcendental entire functions with bounded postsingular set. In particular, for certain classes of such functions, a complete description of…

Dynamical Systems · Mathematics 2022-06-14 Leticia Pardo-Simón

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

Discrete Mathematics · Computer Science 2009-12-17 Otfried Cheong , Xavier Goaoc , Cyril Nicaud

Based on measurements of the Internet topology data, we found out that there are two mechanisms which are necessary for the correct modeling of the Internet topology at the Autonomous Systems (AS) level: the Interactive Growth of new nodes…

Networking and Internet Architecture · Computer Science 2009-09-29 Shi Zhou , Raul J. Mondragon

An r.e. set $A$ is speedable if for every recursive function, there exists a program enumerating membership in $A$ faster, by the desired recursive factor, on infinitely many integers. We construct a speedable set that cannot be split into…

Logic · Mathematics 2014-10-09 Ellen Chih

In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorithm, the problem of determining the least number of rounds…

Combinatorics · Mathematics 2019-10-11 Ta Sheng Tan , Wen Chean Teh

Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…

Combinatorics · Mathematics 2019-05-08 Aninda Chakraborty , Sayan Goswami

Consider two epidemics whose expansions on $\mathbb{Z}^d$ are governed by two families of passage times that are distinct and stochastically comparable. We prove that when the weak infection survives, the space occupied by the strong one is…

Probability · Mathematics 2016-08-16 Olivier Garet , Régine Marchand

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…

Logic · Mathematics 2017-02-10 Jan Krajicek

Given a topological space $X$, we study the structure of $\infty$-convex subsets in the space $SC_p(X)$ of scatteredly continuous functions on $X$. Our main result says that for a topological space $X$ with countable strong fan tightness,…

General Topology · Mathematics 2014-12-04 Taras Banakh , Bogdan Bokalo , Nadiya Kolos

We report the results of carrying out a large number of simulations on a coevolutionary model of multispecies communities. A wide range of parameter values were investigated which allowed a rather complete picture of the change in behaviour…

Populations and Evolution · Quantitative Biology 2007-05-23 Christopher Quince , Paul Higgs , Alan McKane

In this work, we achieve gap amplification for the Small-Set Expansion problem. Specifically, we show that an instance of the Small-Set Expansion Problem with completeness $\epsilon$ and soundness $\frac{1}{2}$ is at least as difficult as…

Computational Complexity · Computer Science 2014-07-03 Prasad Raghavendra , Tselil Schramm

Let Mod(S) denote the mapping class group of a compact, orientable surface S. We prove that finitely generated subgroups of Mod(S) which are not virtually abelian have uniform exponential growth with minimal growth rate bounded below by a…

Geometric Topology · Mathematics 2009-10-04 Johanna Mangahas

Graph burning is one model for the spread of memes and contagion in social networks. The corresponding graph parameter is the burning number of a graph $G$, written $b(G)$, which measures the speed of the social contagion. While it is…

Combinatorics · Mathematics 2017-08-01 Anthony Bonato , Thomas Lidbetter

Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…

Probability · Mathematics 2021-01-04 Sean D Lawley

We analyze the mixing properties of growing networks and find that, in some cases, the assortativity patterns are reversed once links' direction is considered: the disassortative behavior observed in such networks is a spurious effect, and…

Statistical Mechanics · Physics 2009-11-11 Andrea Capocci , Francesca Colaiori

Tip-driven growth processes underlie the development of many plants. To date, tip-driven growth processes have been modelled as an elongating path or series of segments without taking into account lateral expansion during elongation.…

Biological Physics · Physics 2014-01-24 Alexander Bucksch , Greg Turk , Joshua S. Weitz

Given an orientation-preserving diffeomorphism of the interval [0;1], consider the uniform norm of the differential of its n-th iteration. We get a function of n called the growth sequence. Its asymptotic behaviour is an interesting…

Dynamical Systems · Mathematics 2007-05-23 Leonid Polterovich , Mikhail Sodin

The one-dimensional orbit set $\langle F : s \rangle$ is formed by the images of a number $s$ under the action of a semigroup generated by integer affine functions $f_i=a_i x+b_i$ taken from the set $F=\{f_1,\ldots,f_n\}$. P.Erd\H{o}s…

Combinatorics · Mathematics 2026-02-06 Karim F. Shamazov , Alexey L. Talambutsa