Related papers: Anomalous Transport in Complex Networks
Heavy-tailed networks are often characterized in the literature by their degree distribution's similarity to a power law. However, many heavy-tailed networks in real life do not have power-law degree distributions, and in many applications…
We perform a detailed numerical study of the conductance $G$ through one-dimensional (1D) tight-binding wires with on-site disorder. The random configurations of the on-site energies $\epsilon$ of the tight-binding Hamiltonian are…
We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is…
We study electron transport properties of a monoatomic graphite layer (graphene) with different types of disorder at half filling. We show that the transport properties of the system depend strongly on the symmetry of disorder. We find that…
The topology of the Internet has typically been measured by sampling traceroutes, which are roughly shortest paths from sources to destinations. The resulting measurements have been used to infer that the Internet's degree distribution is…
A majority of studied models for scale-free networks have degree distributions with exponents greater than $2$. Real networks, however, can demonstrate essentially more heavy-tailed degree distributions. We explore two models of scale-free…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
We model transport of individuals across a heterogeneous scale-free network where a few weakly connected nodes exhibit heavy-tailed residence times. Using the empirical law Axiom of Cumulative Inertia and fractional analysis we show that…
We study the spin transport properties of some disordered spin chains with a special focus on the distribution of the frequency-dependent spin conductivity. In the cases of interest here, the systems are governed by an effectively infinite…
Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges with a graph's deviation from series-parallel topology is…
We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied,…
The load of a node in a network is the total traffic going through it when every node pair sustains a uniform bidirectional traffic between them on shortest paths. We show that nodal load can be expressed in terms of the more elementary…
It is commonly believed that real networks are scale-free and fraction of nodes $P(k)$ with degree $k$ satisfies the power law $P(k) \propto k^{-\gamma} \text{ for } k > k_{min} > 0$. Preferential attachment is the mechanism that has been…
There is a renewed surge in percolation-induced transport properties of diverse nano-particle composites (cf. RSC Nanoscience & Nanotechnology Series, Paul O'Brien Editor-in-Chief). We note in particular a broad interest in nano-composites…
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major…
We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equations are derived. These equations are generalized to the…
We consider one-dimensional asymmetric exclusion processes with a simple attractive interaction, where the distance between consecutive particles is not allowed to exceed a certain limit and investigate the consequences of this coupling on…
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
The assortative behavior of a network is the tendency of similar (or dissimilar) nodes to connect to each other. This tendency can have an influence on various properties of the network, such as its robustness or the dynamics of spreading…