Learn More
We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and clustering coefficients which are determined by the dimension of the network. The values obtained for these parameters are(More)
The objective of this study was to develop a remediation strategy for soil co-contaminated with decabromodiphenyl ether (BDE-209) and heavy metals (Cd, Pb and Zn) using co-plantation of the hyperaccumulator plant (Sedum alfredii) with tall fescue (Festuca arundinaceae) associated with a BDE degrader (Bacillus cereus strain JP12). A 120-day remediation(More)
Small-world networks are ubiquitous in real-life systems. Most previous models of small-world networks are stochastic. The randomness makes it more difficult to gain a visual understanding on how do different nodes of networks interact with each other and is not appropriate for communication networks that have fixed in-terconnections. Here we present a(More)
The Barabási-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability p, we add a new node with m edges which preferentially link to the nodes presented in the network; with probability 1 − p, we add m edges among the present nodes. A node is preferentially selected by its degree to add(More)
In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E 83, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the discovery of maximum modularity partitions of the node set into communities in unipartite, bipartite, and directed networks. The authors claim that "detection of communities in unipartite networks or in(More)
We introduce a minimal extended evolving model for small-world networks which is controlled by a parameter. In this model the network growth is determined by the attachment of new nodes to already existing nodes that are geographically close. We analyze several topological properties for our model both analytically and by numerical simulations. The(More)
Incompatibility graphs (networks) are abundant in the real world. In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a random incompatibility network—random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal that the properties of(More)
We perform an in-depth study for mean first-passage time (MFPT)--a primary quantity for random walks with numerous applications--of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we derive an explicit expression of MFPT in terms of the eigenvalues and eigenvectors of the adjacency matrix associated with the(More)