相关论文: Using deterministic tourist walk as a small-world …

Deterministic tourist walk (DTW) has attracted increasing interest in computer vision. In the last years, different methods for analysis of dynamic and static textures were proposed. So far, all works based on the DTW for texture analysis…

Quantitative descriptions of network structure in big data can provide fundamental insights into the function of interconnected complex systems. Small-world structure, commonly diagnosed by high local clustering yet short average path…

Small-world networks---complex networks characterized by a combination of high clustering and short path lengths---are widely studied using the paradigmatic model of Watts and Strogatz (WS). Although the WS model is already quite minimal…

Most agent-based models include a social network that describes the structure of interactions within the artificial population. Because of the dramatic impact of this structure on the simulated dynamics, modelers create this network for it…

The famous Watts-Strogatz (WS) small-world network model does not approach the Erd\H{o}s-R\'enyi (ER) random graph model in the limit of total randomization which can lead to confusion and complicates certain analyses. In this paper we…

Small-world (SW) networks have been identified in many different fields. Topological coefficients like the clustering coefficient and the characteristic path length have been used in the past for a qualitative characterization of these…

In this paper, we study detection and fast reconstruction of the celebrated Watts-Strogatz (WS) small-world random graph model \citep{watts1998collective} which aims to describe real-world complex networks that exhibit both high clustering…

Small-world networks by Watts and Strogatz are a class of networks that are highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. These characteristics result in networks with unique…

Network classification plays a crucial role in the study of complex systems, impacting fields like biology, sociology, and computer science. In this research, we present an innovative benchmark dataset made up of synthetic networks that are…

In this study we have carried out computer simulations of random walks on Watts-Strogatz-type small world networks and measured the mean number of visited sites and the return probabilities. These quantities were found to obey scaling…

We consider navigation or search schemes on networks which are realistic in the sense that not all search chains can be completed. We show that the quantity $\mu = \rho/s_d$, where $s_d$ is the average dynamic shortest distance and $\rho$…

In this work, we propose a scheme that provides an analytical estimate for the time-dependent degree distribution of some networks. This scheme maps the problem into a random walk in degree space, and then we choose the paths that are…

Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…

Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest to sociologists, computer scientists and marketeers alike.…

We proposed a deterministic multidimensional growth model for small-world networks. The model can characterize the distinguishing properties of many real-life networks with geometric space structure. Our results show the model possesses…

A computer model is described which is used to assess the dynamical complexity of a class of networks of spiking neurons with small-world properties. Networks are constructed by forming an initially segregated set of highly intra-connected…

We introduce and define three types of small worlds: small worlds based on the diameter of the network (SWD), those based on the average geodesic distance between nodes (SWA), and those based on the median geodesic distance (SWMd). These…

Navigation process is studied on a variant of the Watts-Strogatz small world network model embedded on a square lattice. With probability $p$, each vertex sends out a long range link, and the probability of the other end of this link…

Network models have been widely used to study diverse systems and analyze their dynamic behaviors. Given the structural variability of networks, an intriguing question arises: Can we infer the type of system represented by a network based…

Over the last two decades, network theory has shown to be a fruitful paradigm in understanding the organization and functioning of real-world complex systems. One technique helpful to this endeavor is identifying functionally influential…