Epidemic spreading with time delay on complex networks

In this paper, we propose a susceptible-infected-susceptible (SIS) model on complex networks, small-world (WS) networks and scale-free (SF) networks, to study the epidemic spreading behavior with time delay which is added into the infected phase. Considering the uniform delay, the basic reproduction number R ₀ on WS networks and \(\bar R_0\) on SF networks are obtained respectively. On WS networks, if R ₀ ≤ 1, there is a disease-free equilibrium and it is locally asymptotically stable; if R ₀ > 1, there is an epidemic equilibrium and it is locally asymptotically stable. On SF networks, if \(\bar R_0 \leqslant 1\), there is a disease-free equilibrium; if \(\bar R_0 > 1\), there is an epidemic equilibrium. Finally, we carry out simulations to verify the conclusions and analyze the effect of the time delay τ, the effective rate λ, average connectivity 〈k〉 and the minimum connectivity m on the epidemic spreading.     

The distribution of extreme points in best complex polynomial approximation

LetK be a compact point set in the complex plane having positive logarithmic capacity and connected complement. For anyf continuous onK and analytic in the interior ofK we investigate the distribution of the extreme points for the error in best uniform approximation tof onK by polynomials. More precisely, if $$A_n (f): = \{ z \in K:|f(z) - p_n^* (f;z)| = \parallel f - p_n^* (f)\parallel _K \} ,$$ wherep _n ^* (f) is the polynomial of degree≤n of best uniform approximation tof onK, we show that there is a subsequencen _k with the property that the sequence of (n _k +2)-point Fekete subsets of \(A_{n_k }\) has limiting distribution (ask→∞) equal to the equilibrium distribution forK. Analogues for weighted approximation are also given.     

The citation networks model with random aging

In citation networks, the age of the articles published plays an important role in deciding the preferential attachment probability of the publishing article. In this article, we consider the aging to be cited of the article decays as (t?t_i) ^?η, where t ? t_i denotes the time when node i exists in the networks, η is a random variable and denotes the aging decay exponent of the article published. We deduce that the degree distribution of a citation network also shows power‐law dependence P(k) ～ k ^?γ with exponent γ ≈ 3. At the same time, we study the clustering property of this networks, calculate the clustering coefficient of node i in citation network. We find that the clustering coefficient of node i is larger if its neighbors add into the net earlier. © 2011 Wiley Periodicals, Inc. Complexity, 2012.     

Weak quasi‐randomness for uniform hypergraphs

We study quasi‐random properties of k‐uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will find several equivalent characterisations of this property and our work can be viewed as an extension of the well known Chung‐Graham‐Wilson theorem for quasi‐random graphs. Moreover, let K_k be the complete graph on k vertices and M(k) the line graph of the graph of the k‐dimensional hypercube. We will show that the pair of graphs (K_k,M(k)) has the property that if the number of copies of both K_k and M(k) in another graph G are as expected in the random graph of density d, then G is quasi‐random (in the sense of the Chung‐Graham‐Wilson theorem) with density close to d. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

Small transversals in hypergraphs

For each positive integerk, we consider the setA _k of all ordered pairs [a, b] such that in everyk-graph withn vertices andm edges some set of at mostam+bn vertices meets all the edges. We show that eachA _k withk2 has infinitely many extreme points and conjecture that, for every positive , it has only finitely many extreme points [a, b] witha. With the extreme points ordered by the first coordinate, we identify the last two extreme points of everyA _k , identify the last three extreme points ofA ₃, and describeA ₂ completely. A by-product of our arguments is a new algorithmic proof of Turán's theorem.     

Probabilistic Extensions of the Erdős–Ko–Rado Property

The classical Erdős–Ko–Rado (EKR) Theorem states that if we choose a family of subsets, each of size k, from a fixed set of size , then the largest possible pairwise intersecting family has size . We consider the probability that a randomly selected family of size t=t _n has the EKR property (pairwise nonempty intersection) as n and k=k _n tend to infinity, the latter at a specific rate. As t gets large, the EKR property is less likely to occur, while as t gets smaller, the EKR property is satisfied with high probability. We derive the threshold value for t using Janson’s inequality. Using the Stein–Chen method we show that the distribution of X ₀, defined as the number of disjoint pairs of subsets in our family, can be approximated by a Poisson distribution. We extend our results to yield similar conclusions for X _i , the number of pairs of subsets that overlap in exactly i elements. Finally, we show that the joint distribution (X ₀, X ₁, ..., X _b ) can be approximated by a multidimensional Poisson vector with independent components.      

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.     

On the rate of convergence of sums of extremes to a stable law

Summary LetX ₁,X ₂, ..., be a sequence of independent and identically distributed random variables in the domain of normal attraction of a nonnormal stabler law. It is known that only the sum of thek _n largest andk _n smallest extreme values in thenth partial sum withk _n andk _n /n0 are responsible for the asymptotic stable distribution of the whole sum. We investigate the rate at which such sums of extreme values converge to a stable law in conjunction with the rate at which the sums of the middle terms become asymptotically negligible. In terms of rates of convergence our results provide in many cases a quantitative measure of exactly what portion of the sample is asymptotically stable.Research partially supported by the Deutsche Forschungsgemeinschaft while visiting the University of DelawareResearch partially supported by NSF Grant no. DMS-8803209     

The extreme core

For a Siegel modular cusp formf of weightk letv(f) be the closure of the convex ray hull of the support of the Fourier series inside the cone of semidefinite forms. We show the existence of the extreme core,C _ext, which satisfiesv(f) ⊇k C_ext for all cusp forms. This is a generalization of the Valence Inequality to Siegel modular cusp forms. We give estimations of the extreme core for general n. For n ≤5 we use noble forms to improve these estimates. Forn = 2 we almost specify the extreme core but fall short. We supply improved estimates for all relevant constants and show optimality in some cases. The techniques are mainly from the geometry of numbers but we also use IGUSA’s generators for the ring of Siegel modular forms in degree two.     

On the law of the iterated logarithm for trigonometric series with bounded gaps

Let (n _k ) _k??1 be an increasing sequence of positive integers. Bobkov and G?tze proved that if the distribution of $$\label{distr}\frac{\cos 2\pi n_1 x + \cdots +\cos 2 \pi n_N x}{\sqrt{N}}\qquad\quad\quad\quad (1)$$ converges to a Gaussian distribution, then the value of the variance is bounded from above by 1/2 ? lim sup k/(2n _k ). In particular it is impossible that for a sequence (n _k ) _k??1 with bounded gaps (i.e. n _k+1 ? n _k ?? c for some constant c) the distribution of (1) converges to a Gaussian distribution with variance ?? ²?=?1/2 or larger. In this paper we show that the situation is considerably different in the case of the law of the iterated logarithm. We prove the existence of an increasing sequence of positive integers satisfying $$n_{k+1} - n_k \leq 2$$ such that $$\limsup_{N \to \infty}\frac{\sum_{k=1}^N \cos 2 \pi n_k x}{\sqrt{2N \log \log N}} = +\infty \quad {a.e.}$$      

Cyclic networks with general blocking and starvation

We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k₁..., k_m) subject to a fixed total buffer capacityK=k ₁ +... + k_m. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818.     

Atomic decomposition for the vorticity of a viscous flow in the whole space

We show that the vorticity of a viscous flow in ?³ admits an atomic decomposition of the form ω(x, t) = ω_k(x – x_k, t), with localized and oscillating building blocks ω_k, if such a property is satisfied at the beginning of the evolution. We also study the long time behavior of an isolated coherent structure and the special behavior of flows with highly oscillating vorticities. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

О раэложении мероморфных функций специального вида на простейщие дроби

The paper is devoted to study the entire functions L(λ) with simple real zeros λ_k, k = 1, 2, ..., that admit an expansion of Krein’s type: $$\frac{1}{{\mathcal{L}(\lambda )}} = \sum\limits_{k = 1}^\infty {\frac{{c_k }}{{\lambda - \lambda _k }}} ,\sum\limits_{k = 1}^\infty {\left| {c_k } \right| < \infty } .$$ We present a criterion for these expansions in terms of the sequence {L′ (λ _k )} _k=1 ^∞ . We show that this criterion is applicable to certain classes of meromorphic functions and make more precise a theorem of Sedletski? on the annihilating property in L ² systems of exponents.     

Special orthogonal splittings of<Emphasis Type="Italic">L</Emphasis><Stack><Subscript>1</Subscript><Superscript>2<Emphasis Type="Italic">k</Emphasis></Superscript></Stack>

We show that for each positive integerk there is ak×k matrixB with ±1 entries such that puttingE to be the span of the rows of thek×2k matrix [√kI _k,B], thenE,E ^⊥ is a Kashin splitting: TheL ₁ ^2k and theL ₂ ^2k are universally equivalent on bothE andE ^⊥. Moreover, the probability that a random ±1 matrix satisfies the above is exponentially close to 1. Supported by the Israel Science Foundation.     

Singularity of orbits in classical Lie algebras

We determine the maximum k such that the k-fold sum of some nontrivial, adjoint orbit in the Lie algebra of a classical, compact Lie group has measure zero. The orbits of minimal dimension are seen to be the extreme examples. We show that for this choice of k there is a central, continuous measure on the group such that ^k is singular to L ¹. For Lie groups other than type B _n or C ₃ this result is sharp.     

S-forcing,I. A “black-box” theorem for morasses,with applications to super-Souslin trees

We formulate, for regular μ>ω, a “forcing principle” S_μ which we show is equivalent to the existence of morasses, thus providing a new and systematic method for obtaining applications of morasses. Various examples are given, notably that for infinitek, if 2 ^k =k ⁺ and there exists a (k ⁺, 1)-morass, then there exists ak ⁺⁺-super-Souslin tree: a normalk ⁺⁺ tree characterized by a highly absolute “positive” property, and which has ak ⁺⁺-Souslin subtree. As a consequence we show that CH+SH_{ℵ 2}⟹ℵ₂ is (inaccessible)^L. This author thanks the US-Israel Binational Science Foundation for partial support of this research.     

A generalized Sibuya distribution

The Sibuya distribution arises as the distribution of the waiting time for the first success in Bernoulli trials, where the probabilities of success are inversely proportional to the number of a trial. We study a generalization that can be viewed as the distribution of the excess random variable \(N-k\) given \(N>k\), where N has the Sibuya distribution and k is an integer. We summarize basic facts regarding this distribution and provide several new results and characterizations, shedding more light on its origin and possible applications. In particular, we emphasize the role Sibuya distribution plays in the extreme value theory and point out its invariance property with respect to random thinning operation.     

Final group topologies,Kac-Moody groups and Pontryagin duality

We study final group topologies and their relations to compactness properties. In particular, we are interested in situations where a colimit or direct limit is locally compact, a k _ω-space, or locally k _ω. As a first application, we show that unitary forms of complex Kac-Moody groups can be described as the colimit of an amalgam of subgroups (in the category of Hausdorff topological groups, and the category of k _ω-groups). Our second application concerns Pontryagin duality theory for the classes of almost metrizable topological abelian groups, resp., locally k _ω topological abelian groups, which are dual to each other. In particular, we explore the relations between countable projective limits of almost metrizable abelian groups and countable direct limits of locally k _ω abelian groups.     

About a family of deformations of the Costa-Hoffman-Meeks surfaces

We show the existence of a family of minimal surfaces obtained by deformations of the Costa-Hoffman-Meeks surface of genus k ⩾ 1, M _k . These surfaces are obtained varying the logarithmic growths of the ends and the directions of the axes of revolution of the catenoidal type ends of M _k . Also we obtain a result about the non degeneracy property of the surface M _k .     

Closure and stable Hamiltonian properties in claw‐free graphs

In the class of k‐connected claw‐free graphs, we study the stability of some Hamiltonian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these properties there is an infinite family of graphs G_k of arbitrarily high connectivity k such that the closure of G_k has the property while the graph G_k does not); (ii) traceability is a stable property even for k = 1; (iii) homogeneous traceability is not stable for k = 2 (although it is stable for k = 7). The article is concluded with several open questions concerning stability of homogeneous traceability and Hamiltonian connectedness. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 30–41, 2000