Related papers: Highly Clustered Complex Networks in the Configura…
Complex networks theory has commonly been used for modelling and understanding the interactions taking place between the elements composing complex systems. More recently, the use of generative models has gained momentum, as they allow…
A reflection of our ultimate understanding of a complex system is our ability to control its behavior. Typically, control has multiple prerequisites: It requires an accurate map of the network that governs the interactions between the…
Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random…
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
Complex networks as the World Wide Web, the web of human sexual contacts or criminal networks often do not have an engineered architecture but instead are self-organized by the actions of a large number of individuals. From these local…
Contagion processes have been proven to fundamentally depend on the structural properties of the interaction networks conveying them. Many real networked systems are characterized by clustered substructures representing either collections…
Future wireless networks are envisioned to integrate multi-hop, multi-operator, multi-technology (m3) components in order to meet the increasing traffic demand at an acceptable price for subscribers. The performance of such a network…
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithms (e.g., clustering, conditioning) are effective only if the problem has a sparse graph captured by…
Complex network theory has been applied to solving practical problems from different domains. In this paper, we present a general framework for complex network applications. The keys of a successful application are a thorough understanding…
Motivated by the analysis of social networks, we study a model of random networks that has both a given degree distribution and a tunable clustering coefficient. We consider two types of growth processes on these graphs: diffusion and…
Clustering mechanisms are essential in certain multiuser networks for achieving efficient resource utilization. This lecture note presents the theory of coalition formation as a useful tool for distributed clustering problems. We reveal the…
Complex networks are ubiquitous to several Computer Science domains. Centrality measures are an important analysis mechanism to uncover vital elements of complex networks. However, these metrics have high computational costs and…
Naming Game is a recently proposed model for describing how a multi-agent system can converge towards a consensus state in a self-organized way. In this paper, we investigate this model on the so-called homogeneous small-world networks and…
Complex systems are ubiquitous in the real world and tend to have complicated and poorly understood dynamics. For their control issues, the challenge is to guarantee accuracy, robustness, and generalization in such bloated and troubled…
Symmetries are an essential feature of complex networks as they regulate how the graph collective dynamics organizes into clustered states. We here show how to control network symmetries, and how to enforce patterned states of…
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…
Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive disconnected clusters. The solution of the optimal…
Many real networks in nature and society share two generic properties: they are scale-free and they display a high degree of clustering. We show that these two features are the consequence of a hierarchical organization, implying that small…