Related papers: Anomalous Transport in Complex Networks
We study transport through a single channel t-stub geometry strongly coupled to a superconducting reservoir. In contrast to the standard stub geometry which has both transmission resonances and anti-resonances in the coherent limit, we find…
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in…
We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us…
We study electronic quantum transport in graphene nanoribbon (GNR) networks on mesoscopic length scales. We focus on zigzag GNRs and investigate the conductance properties of statistical networks. To this end we use a…
We develop a simple systematic method, valid for all strengths of disorder, to obtain analytically for the first time the full distribution of conductance P(g) for a quasi one dimensional wire in the absence of electron-electron…
We study numerically an electronic transport in strongly anisotropic weakly disorderd two-dimensional systems. We find that the conductance distribution is gaussian but the conductance fluctuations increase when anisotropy becomes stronger.…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It has been observed recently that this strategy performs…
We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another.…
Public transport routes sharing the same grid of streets and tracks are often found to proceed in parallel along shorter or longer sequences of stations. Similar phenomena are observed in other networks built with space consuming links such…
In this paper we describe the emergence of scale-free degree distributions from statistical mechanics principles. We define an energy associated to a degree sequence as the logarithm of the number of indistinguishable simple networks it is…
To analyze the transport of information or material from a source to every node of a network we use two quantities introduced in the study of river networks: the cost and the flow. For a network with $K$ nodes and $M$ levels, we show that…
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…
We have performed a theoretical study of electronic transport in single and bilayer graphene based on the standard linear-response (Kubo) formalism and continuum-model descriptions of the graphene band structure. We are focusing especially…
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large…
We study charge transport in one-dimensional graphene superlattices created by applying layered periodic and disordered potentials. It is shown that the transport and spectral properties of such structures are strongly anisotropic. In the…
Funnelling effect, in the context of searching on networks, precisely indicates that the search takes place through a few specific nodes. We define the funnelling capacity $f$ of a node as the fraction of successful dynamic paths through it…
We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the…
Random key graphs form a class of random intersection graphs and are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have…
We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path $\ell_{\rm opt}$ in a disordered Erd\H{o}s-R\'enyi (ER) random network and scale-free (SF) network. Each link $i$ is…