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

We study the different rates of escape of points under iteration by holomorphic self-maps of $\mathbb C^*=\mathbb C\setminus\{ 0\}$ for which both 0 and $\infty$ are essential singularities. Using annular covering lemmas we construct…

In this paper, we prove that the ratio of the modulus of the iterates of two points in an escaping Fatou component may be bounded even if the orbit of the component contains an infinite modulus annulus sequence and this case cannot happen…

Beginning with Devaney, several authors have studied transcendental entire functions for which every point in the escaping set can be connected to infinity by a curve in the escaping set. Such curves are often called Devaney hairs. We show…

In this paper, we mainly study hyperbolic semigroups from which we get non-empty escaping set and Eremenko's conjecture remains valid. We prove that if each generator of bounded type transcendental semigroup S is hyperbolic, then the…

It is known that a Sleptsov net, with multiple firing a transition at a step, runs exponentially faster than a Petri net opening prospects for its application as a graphical language of concurrent programming. We provide classification of…

Let $f$ and $g$ be transcendental entire functions, each with a bounded set of singular values, and suppose that $f$ and $g$ are affinely equivalent (that is, $g \circ \phi= \psi\circ f$, where $\phi,\psi:\C\to\C$ are affine). We show that…

We investigate in detail the model of a trophic web proposed by Amaral and Meyer [Phys. Rev. Lett. 82, 652 (1999)]. We focused on small-size systems that are relevant for real biological food webs and for which the fluctuations are playing…

We study the iteration of functions in the exponential family. We construct a number of sets, consisting of points which escape to infinity `slowly', and which have Hausdorff dimension equal to 1. We prove these results by using the idea of…

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…

We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial normal subset $ A $ of a finite simple group $ G $ of Lie type of…

Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular,…

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Let $f$ and $g$ be permutable transcendental entire functions. We use a recent analysis of the dynamical behaviour in multiply connected wandering domains to make progress on the long standing conjecture that the Julia sets of $f$ and $g$…

In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enables the fastest spread of information? In this paper, we assume the dynamics of spread is…

A spider consists of several, say $N$, particles. Particles can jump independently according to a random walk if the movement does not violate some given restriction rules. If the movement violates a rule it is not carried out. We consider…

We prove that a set $A$ of at most $q$ non-collinear points in the finite plane $\mathbb{F}_{q}^{2}$ spans at least $\approx\frac{|A|}{\sqrt{q}}$ directions: this is based on a lower bound contained in [FST13], which we prove again together…

Our objective is to determine which subsets of $\mathbb{R}^d$ arise as escaping sets of continuous functions from $\mathbb{R}^d$ to itself. We obtain partial answers to this problem, particularly in one dimension, and in the case of open…

Providing the neurobiological basis of information processing in higher animals, spiking neural networks must be able to learn a variety of complicated computations, including the generation of appropriate, possibly delayed reactions to…

Predicting evolution of expanding populations is critical to control biological threats such as invasive species and cancer metastasis. Expansion is primarily driven by reproduction and dispersal, but nature abounds with examples of…

In 1909, Hardy gave an example of a transcendental entire function, $f$, with the property that the set of points where $f$ achieves its maximum modulus, $\mathcal{M}(f)$, has infinitely many discontinuities. This is one of only two known…