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

In this paper, we give a definition of Eremenko's point of a meromorphic function with infinitely many poles and a condition for its existence in narrow annuli in terms of a covering theorem of annulus.

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), enable the fastest spread of information? The dynamics of spread is described by a process…

Let $f$ be a transcendental entire function and $U$ be a Fatou component of $f$. We show that if $U$ is an escaping wandering domain of $f$, then most boundary points of $U$ (in the sense of harmonic measure) are also escaping. In the other…

In many real growing networks the mean number of connections per vertex increases with time. The Internet, the Word Wide Web, collaboration networks, and many others display this behavior. Such a growth can be called {\em accelerated}. We…

We give an example of a transcendental entire function with a simply connected fast escaping Fatou component, but with no multiply connected Fatou components. We also give a new criterion for points to be in the fast escaping set.

Let $f$ be a transcendental entire function and let $U$ be a univalent Baker domain of $f$. We prove a new result about the boundary behaviour of conformal maps and use this to show that the non-escaping boundary points of $U$ form a set of…

We introduce the concept of escaping set for semigroups of transcendental entire functions using Fatou-Julia theory. Several results of the escaping set associated with the iteration of one transcendental entire function have been extended…

Simulations of the coevolution of many interacting species are performed using the Webworld model. The model has a realistic set of predator-prey equations that describe the population dynamics of the species for any structure of the food…

We consider the dynamics of transcendental self-maps of the punctured plane, $\mathbb{C}^*=\mathbb{C}\setminus \{0\}$. We prove that the escaping set $I(f)$ is either connected, or has infinitely many components. We also show that $I(f)\cup…

We prove an effective form of Wilkie's conjecture in the structure generated by restricted sub-Pfaffian functions: the number of rational points of height $H$ lying in the transcendental part of such a set grows no faster than some power of…

Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. In this note we show that the intersection growth of some groups may not be a nicely behaved…

Food webs are networks describing who is eating whom in an ecological community. By now it is clear that many aspects of food-web structure are reproducible across diverse habitats, yet little is known about the driving force behind this…

The escaping set I(f) of a transcendental meromorphic function f consists of all points which tend to infinity under iteration. The Eremenko-Lyubich class B consists of all transcendental meromorphic functions for which the set of finite…

For a non-trivial transcendental semigroup, escaping set I(S) is in general S-forward invariant and it is S-completely invariant if semigroup S is abelian. In the contrary of this result, we investigate completely invariant escaping set…

In this paper we prove that if $1<a\leq b<a^2$ and $X$ is a locally doubling $\delta$-hyperbolic complete connected length metric measure space with $(a,b)$-pinched exponential growth at infinity, then the centred Hardy--Littlewood maximal…

We consider models of evolving networks $\{\mathcal{G}_n:n\geq 0\}$ modulated by two parameters: an attachment function $f:\mathbb{N}_0\to\mathbb{R}_+$ and a (possibly random) attachment sequence $\{m_i:i\geq 1\}$. Starting with a single…

We study a family of transcendental entire functions of genus zero, for which all of the zeros lie within a closed sector strictly smaller than a half-plane. In general these functions lie outside the Eremenko-Lyubich class. We show that…

The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media,…

Motivated by data on the evolution of the Internet and World Wide Web we consider scenarios of self-organization of the nonlinearly growing networks into free-scale structures. We find that the accelerating growth of the networks…

Spider webs are incredible biological structures, comprising thin but strong silk filament and arranged into complex hierarchical architectures with striking mechanical properties (e.g., lightweight but high strength, achieving diverse…