相关论文: A sharp growth condition for a fast escaping spide…

Let f be a real entire function whose set S(f) of singular values is real and bounded. We show that, if f satisfies a certain function-theoretic condition (the "sector condition"), then $f$ has no wandering domains. Our result includes all…

We present a theory for the growth dynamics of the World Wide Web that takes into account the wide range of stochastic growth rates in the number of pages per site, as well as the fact that new sites are created at different times. This…

Recent researches on complex systems highlighted the so-called super-linear growth phenomenon. As the system size $P$ measured as population in cities or active users in online communities increases, the total activities $X$ measured as GDP…

We prove sharp asymptotic estimates for the rate of escape of the two-dimensional simple random walk conditioned to avoid a fixed finite set. We derive it from asymptotics available for the continuous analogue of this process (cf…

The networks of predator-prey interactions in ecological systems are remarkably complex, but nevertheless surprisingly stable in terms of long term persistence of the system as a whole. In order to understand the mechanism driving the…

We show that for any quasimeromorphic mapping with an essential singularity at infinity, there exist points whose iterates tend to infinity arbitrarily slowly. This extends a result by Nicks for quasiregular mappings, and Rippon and…

Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…

A transcendental entire function is called criniferous if every point in its escaping set can eventually be connected to infinity by a curve of escaping points. Many transcendental entire functions with bounded singular set have this…

We develop a general technique for realising full closed subsets of the complex plane as wandering sets of entire functions. Using this construction, we solve a number of open problems. (1) We construct a counterexample to Eremenko's…

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

We study the iteration of transcendental self-maps of $\mathbb{C}^*:=\mathbb{C}\setminus \{0\}$, that is, holomorphic functions $f:\mathbb{C}^*\to\mathbb{C}^*$ for which both zero and infinity are essential singularities. We use…

Precisely how ecological factors influence animal social structure is far from clear. We explore this question using an agent-based model inspired by the fission-fusion society of Spider monkeys (Ateles spp). Our model introduces a…

The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled…

We prove a form of the $\cos \pi \rho$ theorem which gives strong estimates for the minimum modulus of a transcendental entire function of order zero. We also prove a generalisation of a result of Hinkkanen that gives a sufficient condition…

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

Let $f$ be an entire function with the form $f(z)=P(e^z)/e^z$, where $P$ is a polynomial with degree at least $2$ and $P(0)\neq 0$. We prove that the area of the complement of the fast escaping set (hence the Fatou set) of $f$ in a…

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…

We consider the problem of identifying a subset of nodes in a network that will enable the fastest spread of information in a decentralized environment.In a model of communication based on a random walk on an undirected graph, the optimal…

We introduce a new technique that allows us to make progress on two long standing conjectures in transcendental dynamics: Baker's conjecture that a transcendental entire function of order less than 1/2 has no unbounded Fatou components, and…

We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…