Related papers: Jamming in complex networks with degree correlatio…
Clustering is often presumed to lead to enhanced agglomeration between cohesive grains due to the reduced relative velocities of particles within a cluster. Our discrete-particle simulations on gravity-driven, gas-solid flows of cohesive…
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…
The paper orders certain important issues related to both uncorrelated and correlated networks with hidden variables. In particular, we show that networks being uncorrelated at the hidden level are also lacking in correlations between node…
In a recursive way and by including a parameter, we introduce a family of deterministic scale-free networks. The resulting networks exhibit small-world effects. We calculate the exact results for the degree exponent, the clustering…
In this paper we present a new version of a network growth model, generalized in order to describe the behavior of social networks. The case of study considered is the preprint archive at cul.arxiv.org. Each node corresponds to a scientist,…
We study diffusion on multiplex networks with directed interlayer couplings. We demonstrate both numerically and analytically that even with undirected layers, interlayer directionality alone reproduces superdiffusion and the prime regime.…
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…
Some years ago a cellular automata model was proposed to describe the evolution of the immune repertoire of B cells and antibodies based on Jerne's immune network theory and shape-space formalism. Here we investigate if the networks…
Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network…
Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many…
We analyze the mixing properties of growing networks and find that, in some cases, the assortativity patterns are reversed once links' direction is considered: the disassortative behavior observed in such networks is a spurious effect, and…
We investigate the presence of triangles in a class of correlated random graphs in which hidden variables determine the pairwise connections between vertices. The class rules out self-loops and multiple edges and allows for negative degree…
In pinning control of complex networks, a tacit believing is that the system dynamics will be better controlled by pinning the large-degree nodes than the small-degree ones. Here, by changing the number of pinned nodes, we find that, when a…
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1)…
This paper applies a discrete adjoint gradient computation method for a multi-class traffic flow model on road networks. Vehicle classes are characterized by their specific velocity functions, which depend on the total traffic density,…
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…
Recent empirical studies have reported that spatiotemporal congestion clusters in urban traffic exhibit scale-free statistics, with cluster size following a power-law distribution. In this study, we address whether macroscopic continuum…
We show that discretization of internode distribution in complex networks affects internode distances l_ij calculated as a function of degrees (k_i k_j) and an average path length <l> as function of network size N. For dense networks there…
The resilience of a complex interconnected system concerns the size of the macroscopic functioning node clusters after external perturbations based on a random or designed scheme. For a representation of the interconnected systems with…
In modern data center networks, thousands of hosts contend for shared link capacity; the scale of these systems makes centralized scheduling impractical. This article models such scheduling as a bipartite matching problem under…