Related papers: A sharp growth condition for a fast escaping spide…
Let $f$ and $g$ be two quasiregular maps in $\mathbb{R}^d$ that are of transcendental type and also satisfy $f\circ g =g \circ f$. We show that if the fast escaping sets of those functions are contained in their respective Julia sets then…
We prove an analog of Boettcher's theorem for transcendental entire functions in the Eremenko-Lyubich class B. More precisely, let f and g be entire functions with bounded sets of singular values and suppose that f and g belong to the same…
Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurring on the unguarded vertices by moving there (yielding a new…
We investigate the dependence of the escape rate on the position of a hole placed in uniformly hyperbolic systems admitting a finite Markov partition. We derive an exact periodic orbit formula for finite size Markov holes which differs from…
We describe the anomalous phase transition of the emergence of the giant connected component in scale-free networks growing under mechanism of preferential linking. We obtain exact results for the size of the giant connected component and…
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node…
It is known that the Frank-Wolfe (FW) algorithm, which is affine-covariant, enjoys accelerated convergence rates when the constraint set is strongly convex. However, these results rely on norm-dependent assumptions, usually incurring…
Experimental and empirical observations on cell metabolism cannot be understood as a whole without their integration into a consistent systematic framework. However, the characterization of metabolic flux phenotypes is typically reduced to…
Let $f$ be a transcendental entire function. By a result of Rippon and Stallard, there exist points whose orbit escapes arbitrarily slowly. By using a range of techniques to prove new covering results, we extend their theorem to prove the…
In this paper, we study the exceptional sets $S_f$ of $p$-adic transcendental analytic functions $f$ with rational and algebraic coefficients. We establish a necessary condition for a subset $S \subseteq \overline{\mathbb{Q}} \cap B(0,…
In this paper, we prove several results on the structure of maximal sets $S \subseteq [N]$ such that $S$ mod $p$ is contained in a short arithmetic progression, or the union of short progressions, where $p$ ranges over a subset of primes in…
Filaments are a natural generalization of the well-known concept of dynamic rays in complex dynamics. In this article we investigate which periodic or preperiodic filaments land together for arbitrary post-singularly finite transcendental…
Many real systems possess accelerating statistics where the total number of edges grows faster than the network size. In this paper, we propose a simple weighted network model with accelerating growth. We derive analytical expressions for…
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants,…
We consider two families of functions $\mathcal{F}=\{f_{{\la},{\xi}}(z)= e^{-z+\la}+\xi: \la,\,\xi\in\C, \RE{\la}<0, \RE\xi\geq 1\}$ and $\mathcal{F}'=\{f_{{\mu},{\ze}}(z)= e^{z+\mu}+\ze: \mu,\,\ze\in\C, \RE{\mu}<0, \RE\ze\leq-1\}$ and…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We study the following paradox associated with networks growing according to superlinear preferential attachment: superlinear preference cannot produce scale-free networks in the thermodynamic limit, but there are superlinearly growing…
This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…
For a transcendental entire function f, we study the set of points BU(f) whose iterates under f neither escape to infinity nor are bounded. We give new results on the connectedness properties of this set and show that, if U is a Fatou…
We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When…