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

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the…

We discuss the dynamics of semigroups of transcendental entire functions using Fatou-Julia theory and provide a condition for the complete invariance of escaping set and Julia set of transcendental semigroups. Results regarding limit…

A generalized family of transcendental (non-polynomial entire) functions is constructed, where the Hausdorff dimension and the packing dimension of the Julia sets are equal to one. Further, there exist multiply connected wandering domains,…

Suppose that $f(z)$ is a transcendental entire function and that the Fatou set $F(f)\neq\emptyset$. Set $$B_1(f):=\sup_{U}\frac{\sup_{z\in U}\log(|z|+3)}{\inf_{w\in U}\log(|w|+3)}$$ and $$B_2(f):=\sup_{U}\frac{\sup_{z\in…

We investigate mechanisms of the typically observed recoverable prevalence in epidemic spreading. Assuming the time-independent connectivity correlations, we analyze the dynamics of spreading on linearly growing scale-free (SF) networks,…

In this paper, we explore how geometric structures can be grown exponentially fast. The studied processes start from an initial shape and apply a sequence of centralized growth operations to grow other shapes. We focus on the case where the…

We develop a mathematical model to capture the web dynamics of slingshot spiders (Araneae: Theridiosomatidae), which utilize a tension line to deform their orb webs into conical springs to hunt flying insects. Slingshot spiders are…

The escaping set of an entire function is the set of points that tend to infinity under iteration. We consider subsets of the escaping set defined in terms of escape rates and obtain upper and lower bounds for the Hausdorff measure of these…

In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of…

An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling…

We consider chaotic (hyperbolic) dynamical systems which have a generating Markov partition. Then, open dynamical systems are built by making one element of a Markov partition a hole through which orbits escape. We compare various estimates…

We consider the asymmetric simple exclusion processes (ASEP) on a ring constrained to produce an atypically large flux, or an extreme activity. Using quantum free fermion techniques we find the time-dependent conditional transition…

In the present paper we define Samuelson's webs and their rank. The main result of the paper is the proof that the rank of the Samuelson webs does not exceed 6, as well as finding the conditions under which this rank is maximal for the…

For a fixed initial reference measure, we study the dependence of the escape rate on the hole for a smooth or piecewise smooth hyperbolic map. First, we prove the existence and Holder continuity of the escape rate for systems with small…

We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotients of non-elementary subgroups of $SL_2 (\mathbb{F}_p [t])$ modulo certain square-free ideals. We describe some applications of our results…

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \in S$ such that $u$'s path…

We study the rate of growth of ergodic sums along a sequence (a_n) of times: S_N f(x)=f(T^{a_1}x) + ... + f(T^{a_N}x). We characterize the maximal rate of growth of these ergodic sums and identify a number of sequences such as (2^n) that…

Evolving out-of-equilibrium networks have been under intense scrutiny recently. In many real-world settings the number of links added per new node is not constant but depends on the time at which the node is introduced in the system. This…

Populations experience a complex interplay of continuous and discrete processes: continuous growth and interactions are punctuated by discrete reproduction events, dispersal, and external disturbances. These dynamics can be modeled by…