相关论文: Random Walks between Leaves of Random Networks

The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to…

Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…

We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…

We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node.…

We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes…

We consider the random walk attachment graph introduced by Saram\"{a}ki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We study the coherent exciton transport of continuous-time quantum walks (CTQWs) on Erdos-Renyi networks. The Erdos-Renyi network of N nodes is constructed by connecting every pair of nodes with probability $p$. We numerically calculate the…

Random walks have been proven to be useful for constructing various algorithms to gain information on networks. Algorithm node2vec employs biased random walks to realize embeddings of nodes into low-dimensional spaces, which can then be…

Our goal is to quickly find top $k$ lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex networks), a deterministic algorithm to find a node with the…

Graph embedding has recently gained momentum in the research community, in particular after the introduction of random walk and neural network based approaches. However, most of the embedding approaches focus on representing the local…

A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…

For a simple (unbiased) random walk on a connected graph with $n$ vertices, the cover time (the expected number of steps it takes to visit all vertices) is at most $O(n^3)$. We consider locally biased random walks, in which the probability…

We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…

We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its…

In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless…

A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…

Analytic solution for the average path length in a large class of random graphs is found. We apply the approach to classical random graphs of Erd\"{o}s and R\'{e}nyi (ER) and to scale-free networks of Barab\'{a}si and Albert (BA). In both…