Related papers: Generating Scale-free Networks with Adjustable Clu…

We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree…

We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…

We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…

We propose a method of generating different scale-free networks, which has several input parameters in order to adjust the structure, so that they can serve as a basis for computer simulation of real-world phenomena. The topological…

We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the interactions of which lead to a dynamic graph. The walkers of the…

Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to…

In the paper, we present an incremental approach in the construction of scale free networks with hidden variables. The work arises from the necessity to generate that type of networks with a given number of links instead of obtaining a…

There are many networks in real life which exist as form of Scale-free networks such as World Wide Web, protein-protein interaction network, semantic networks, airline networks, interbank payment networks, etc. If we want to analyze these…

Scale-free networks are characterized by a degree distribution with power-law behavior and have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks. Degree distributions of observed…

The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…

This paper proposes an attributed network growth model. Despite the knowledge that individuals use limited resources to form connections to similar others, we lack an understanding of how local and resource-constrained mechanisms explain…

The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…

We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…

Many realistic networks are scale-free, with small characteristic path lengths, high clustering, and power law in their degree distribution. They can be obtained by dynamical networks in which a preferential attachment process takes place.…

We show that not only preferential attachment but also preferential depletion leads to scale-free networks. The resulting degree distribution exponents is typically less than two (5/3) as opposed to the case of the growth models studied…

We study a recently introduced class of scale-free networks showing a high clustering coefficient and non-trivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the…

This article explores and analyzes the unsupervised clustering of large partially observed graphs. We propose a scalable and provable randomized framework for clustering graphs generated from the stochastic block model. The clustering is…

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…

In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…

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…