Related papers: Braess like Paradox in a Small World Network

We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of $G$, there is a vertex $x$ of $M$ and a vertex $y$ of $G$…

While logistic regression models are easily accessible to researchers, when applied to network data there are unrealistic assumptions made about the dependence structure of the data. For temporal networks measured in discrete time, recent…

Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I…

We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…

We establish a relationship between the Small-World behavior found in complex networks and a family of Random Walks trajectories using, as a linking bridge, a maze iconography. Simple methods to generate mazes using Random Walks are…

Inspired by studies on airline networks we propose a general model for weighted networks in which topological growth and weight dynamics are both determined by cost adversarial mechanism. Since transportation networks are designed and…

Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…

Many hierarchically modular systems are structured in a way that resembles an hourglass. This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that…

A statistically principled way of conducting weighted network analysis is still lacking. Comparison of different populations of weighted networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the…

We characterize the distributions of short cycles in a large metabolic network previously shown to have small world characteristics and a power law degree distribution. Compared with three classes of random networks, including Erdoes-Renyi…

We show that in an undirected graph under degree biased sampling the expected degree of vertices is equal to the expected degree of their neighbors. In consequence, under the biased sampling the social network result known as the friendship…

We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a stream of edges. Our procedure is based on the classic…

We study the fundamental problem of counting the number of nodes in a sparse network (of unknown size) under the presence of a large number of Byzantine nodes. We assume the full information model where the Byzantine nodes have complete…

This paper defines the toroidal small world labeling problem that asks for a labeling of the vertices of a network such that the labels possess information that allows a compact routing scheme in the network. We consider the problem over a…

We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…

Many complex networks demonstrate a phenomenon of striking degree correlations, i.e., a node tends to link to other nodes with similar (or dissimilar) degrees. From the perspective of degree correlations, this paper attempts to characterize…

We study shortest paths and spanning trees of complex networks with random edge weights. Edges which do not belong to the spanning tree are inactive in a transport process within the network. The introduction of quenched disorder modifies…

In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to…

We study network growth from a fixed set of initially isolated nodes placed at random on the surface of a sphere. The growth mechanism we use adds edges to the network depending on strictly local gain and cost criteria. Only nodes that are…

Growth dynamic of real networks because of emerging complexities is an open and interesting question. Indeed it is not realistic to ignore history impact on the current events. The mystery behind that complexity could be in the role of…