Related papers: Topologically biased random walk with application …
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…
We are interested in recovering information on a stochastic block model from the subgraph discovered by an exploring random walk. Stochastic block models correspond to populations structured into a finite number of types, where two…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…
Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…
Analysis of social networks with limited data access is challenging for third parties. To address this challenge, a number of studies have developed algorithms that estimate properties of social networks via a simple random walk. However,…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
One-dimensional discrete-time quantum walks show a rich spectrum of topological phases that have so far been exclusively analysed in momentum space. In this work we introduce an alternative approach to topology which is based on the…
I propose to study the complex physics of topological phases by an all optical implementation of a discrete-time quantum walk. The main novel ingredient is the use of parametric amplifiers in the random network which can in turn be used to…
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
Community structures have been identified in various complex real-world networks, for example, communication, information, internet and shareholder networks. The scaling of community size distribution indicates the heterogeneity in the…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
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…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
Community search in attributed networks poses a dual challenge: balancing structural connectivity -- the network's topological properties -- and attribute similarity -- the shared characteristics of nodes. This paper introduces a novel…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…