相关论文: Scaling of human behavior during portal browsing
In this work, the outward and inward accessibilities of individual nodes are defined and their potential for application is illustrated with respect to the investigation of 6 different types of networks. The outward accessibility quantifies…
We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other users as friends and foes, providing positive and negative…
Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular,…
We study the fluctuation properties and return-time statistics on inhomogeneous scale-free networks using packets moving with two different dynamical rules; random diffusion and locally navigated diffusive motion with preferred edges.…
The World Wide Web (WWW) has fundamentally changed the ways billions of people are able to access information. Thus, understanding how people seek information online is an important issue of study. Wikipedia is a hugely important part of…
The probability distribution of number of ties of an individual in a social network follows a scale-free power-law. However, how this distribution arises has not been conclusively demonstrated in direct analyses of people's actions in…
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit…
It has been recently reported that the reciprocity of real-life weighted networks is very pronounced, however its impact on dynamical processes is poorly understood. In this paper, we study random walks in a scale-free directed weighted…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We propose and study a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows the weights of links are…
We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement…
Many social, technological and biological interactions involve network relationships whose outcome intimately depends on the structure of the network and on the strengths of the connections. Yet, although much information is now available…
We revisit the cosmological evolution of domain wall networks, taking advantage of recent improvements in computing power. We carry out high-resolution field theory simulations in two, three and four spatial dimensions to study the effects…
The structure of real-world networks is usually difficult to characterize owing to the variation of topological scales, the nondyadic complex interactions, and the fluctuations in the network. We aim to address these problems by introducing…
Scale-free power law structure describes complex networks derived from a wide range of real world processes. The extensive literature focuses almost exclusively on networks with power law exponent strictly larger than 2, which can be…
Random walks play an important role in probing the structure of complex networks. On traditional networks, they can be used to extract community structure, understand node centrality, perform link prediction, or capture the similarity…
The control of complex systems is an ongoing challenge of complexity research. Recent advances using concepts of structural control deduce a wide range of control related properties from the network representation of complex systems. Here,…
We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic broadcast algorithm, where a query…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
Identifying statistical patterns characterizing human trajectories is crucial for public health, traffic engineering, city planning, and epidemic modeling. Recent developments in global positioning systems and mobile phone networks have…