Related papers: Braess like Paradox in a Small World Network
Meso-scale structures (communities) are used to understand the macro-scale properties of complex networks, such as their functionality and formation mechanisms. Micro-scale structures are known to exist in most complex networks (e.g., large…
A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the node's neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks,…
This paper introduces a statistical model for the arrival times of connection events in a computer network. Edges between nodes in a network can be interpreted and modelled as point processes where events in the process indicate information…
This article describes an approach to modeling knowledge acquisition in terms of walks along complex networks. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of…
There has been significant interest in the networking community on the impact of cascade effects on the diffusion of networking technology upgrades in the Internet. Thinking of the global Internet as a graph, where each node represents an…
Network science is a rapidly expanding field, with a large and growing body of work on network-based dynamical processes. Most theoretical results in this area rely on the so-called \emph{locally tree-like approximation}. This is, however,…
We study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration $t_w$ and random long-range jumps. While the time the walker needs to cover all the…
Efficiency in passage times is an important issue in designing networks, such as transportation or computer networks. The small-world networks have structures that yield high efficiency, while keeping the network highly clustered. We show…
We show that abrupt structural transitions can arise in functionally optimal networks, driven by small changes in the level of transport congestion. Our results offer an explanation as to why so many diverse species of network structure…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
In certain instances an electric network transforms in natural ways by the addition or removal of an edge. This can have interesting consequences for random walks, in light of the known relationships between electric resistance and random…
This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
In an Achlioptas process, starting with a graph that has n vertices and no edge, in each round $d \geq 1$ edges are drawn uniformly at random, and using some rule exactly one of them is chosen and added to the evolving graph. For the class…
A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between…
We consider Markov models of large-scale networks where nodes are characterized by their local behavior and by a mobility model over a two-dimensional lattice. By assuming random walk, we prove convergence to a system of partial…
Most real complex networks -- such as protein interactions, social contacts, the internet -- are only partially known and available to us. While the process of exploring such networks in many cases resembles a random walk, it becomes a key…
The mathematical study of the small-world concept has fostered quite some interest, showing that small-world features can be identified for some abstract classes of networks. However, passing to real complex systems, as for instance…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The cost of traversing an edge depends on the {\em load};…