Related papers: Small-world networks and RNA secondary structures
Recent empirical work [Leskovec2009] has suggested the existence of a size threshold for the existence of clusters within many real-world networks. We give the first proof that this clustering size threshold exists within a real-world…
The functional consequences of local and global dynamics can be very different in natural systems. Many such systems have a network description that exhibits strong local clustering as well as high communication efficiency, often termed as…
We study the effective resistance of small-world resistor networks. Utilizing recent analytic results for the propagator of the Edwards-Wilkinson process on small-world networks, we obtain the asymptotic behavior of the disorder-averaged…
We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving constant bounded distortions. The model builds networks with both number of vertices and size…
Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we…
A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…
Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others are random. Compared with deterministic networks, random…
This study introduces an algorithm that generates undirected graphs with three main characteristics of real-world networks: scale-freeness, short distances between nodes (small-world phenomenon), and large clustering coefficients. The main…
In this paper we generalize the concept of random networks to describe networks with non trivial features by a statistical mechanics approach. This framework is able to describe ensembles of undirected, directed as well as weighted…
Analytic solution for the average path length in a large class of uncorrelated random networks with hidden variables is found. We apply the approach to classical random graphs of Erdos and Renyi (ER), evolving networks introduced by…
We show the expected order of RNA saturated secondary structures of size $n$ is $\log_4n(1+O(\frac{\log_2n}{n}))$, if we select the saturated secondary structure uniformly at random. Furthermore, the order of saturated secondary structures…
A striking discovery in the field of network science is that the majority of real networked systems have some universal structural properties. In generally, they are simultaneously sparse, scale-free, small-world, and loopy. In this paper,…
It is a classical result of Stein and Waterman that the asymptotic number of RNA secondary structures is $1.104366 n^{-3/2} 2.618034^n$. In this paper, we study combinatorial asymptotics for two special subclasses of RNA secondary…
In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained…
Small-world networks (SWN) are found to be closer to the real social systems than both regular and random lattices. Then, a model for the evolution of economic systems is generalized to SWN. The Sznajd model for the two-state opinion…
In a recent letter (cond-mat/9903108), Barthelemy and Nunes Amaral discuss the crossover phenomenon between regular and ``small-world'' networks, as a function of the network size $n$ and of the disorder $p$. They claim that the average…
Real growing networks like the WWW or personal connection based networks are characterized by a high degree of clustering, in addition to the small-world property and the absence of a characteristic scale. Appropriate modifications of the…
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
We investigate small-world networks from the point of view of their origin. While the characteristics of small-world networks are now fairly well understood, there is as yet no work on what drives the emergence of such a network…