A note on the almost one half holomorphic pinching

Motivated by a previous work of Zheng and the second named author, we study pinching constants of compact K\"ahler manifolds with positive holomorphic sectional curvature. In particular we prove a gap theorem following the work of Petersen and Tao on Riemannian manifolds with almost quarter-pinched sectional curvature.Comment: 6 pages. This is the version which the authors submitted to a journal for consideration for publication in June 2017. The reference has not been updated since the

Rebels Lead to the Doctrine of the Mean: Opinion Dynamic in a Heterogeneous DeGroot Model

We study an extension of the DeGroot model where part of the players may be rebels. The updating rule for rebels is quite different with that of normal players (which are referred to as conformists): at each step a rebel first takes the opposite value of the weighted average of her neighbors' opinions, i.e. 1 minus that average (the opinion space is assumed to be [0,1] as usual), and then updates her opinion by taking another weighted average between that value and her own opinion in the last round. We find that the effect of rebels is rather significant: as long as there is at least one rebel in every closed and strongly connected group, under very weak conditions, the opinion of each player in the whole society will eventually tend to 0.5.Comment: 7 pages, Proceedings of The 6th International Conference on Knowledge, Information and Creativity Support Systems, Beijing, 201

Joint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks

Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high SNR and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and develop an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes.Comment: 30 pages, 6 pages, submitted to IEEE GLOBECOM 2017 and IEEE Trans. Commo