The geometry of complex networks is closely related with their structure and function. In this paper, we investigate the Gromov-hyperbolicity of the Newman-Watts model of small-world networks. It is known that asymptotic Erdős-Rényi random graphs are not hyperbolic. We show that the Newman-Watts ones built on top of them by adding lattice-induced clustering are not hyperbolic as the network size goes to infinity. Numerical simulations are provided to illustrate the effects of various parameters...

In this paper, we study the opinion evolution over social networks with a bounded confidence rule. Node initial opinions are independently and identically distributed. At each time step, each node reviews the average opinions of several different randomly selected agents and updates its opinion only when the difference between its opinion and the average is below a threshold. First of all, we provide probability bounds of the opinion convergence and the opinion consensus, are both nontrivial events...