相关论文: The Linking Probability of Deep Spider-Web Network…
In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…
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…
Predicting missing links in real networks is an important problem in network science to which considerable efforts have been devoted, giving as a result a vast plethora of link prediction methods in the literature. In this work, we take a…
We present a semi-Markov model of random walk on complex networks in discrete and continuous-time scenario. In the general setting of the semi-Markov chains, the duration of stay at given node - the sojourn time - is random, and the…
Most social, technological and biological networks are embedded in a finite dimensional space, and the distance between two nodes influences the likelihood that they link to each other. Indeed, in social systems, the chance that two…
We consider coherent exciton transport modeled by continuous-time quantum walks (CTQWs) on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance $m$ in the cycle graph. LRIC has a symmetric…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
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…
We consider a one dimensional Euclidean network which is grown using a preferential attachment. Here the $j$th incoming node gets attached to the $i$th existing node with the probability $\Pi_i \propto k_i {{l}}_{ij}^\alpha$, where…
Complex networks have played an important role in describing real complex systems since the end of the last century. Recently, research on real-world data sets reports intermittent interaction among social individuals. In this paper, we pay…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
In this theoretical study, we analyze quantum walks on complex networks, which model network-based processes ranging from quantum computing to biology and even sociology. Specifically, we analytically relate the average long time…
The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…
Empirical estimation of critical points at which complex systems abruptly flip from one state to another is among the remaining challenges in network science. However, due to the stochastic nature of critical transitions it is widely…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
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…
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…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
We consider a model of two interdependent networks, where every node in one network depends on one or more supply nodes in the other network and a node fails if it loses all of its supply nodes. We develop algorithms to compute the failure…
The network of interpersonal connections is one of the possible heterogeneous factors which affect the income distribution emerging from micro-to-macro economic models. In this paper we equip our model discussed in [1,2] with a network…