In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents’ performance. By changing the agent’s trust on...

We propose an agent-based model to simulate the creation of street gang rivalries. The movement dynamics of agents are coupled to an evolving network of gang rivalries, which is determined by previous interactions among agents in the system. Basic gang data, geographic information, and...

Exponential random graph models (ERGMs) are powerful tools for formulating theoretical models of network generation or learning the properties of empirical networks. They can be used to construct models that exactly reproduce network properties of interest. However, tuning these models correctly...

In recent years, online social networks (OSN) have emerged as a platform of sharing variety of information about people, and their interests, activities, events and news from real worlds. Due to the large scale and access limitations (e.g., privacy policies) of online social network services...

We study the information traffic in scale-free networks where the information generation rate varies with time as a periodic function. We observe that when the fluctuation in packet generation rate increases, the average transit time increases and network performance degrades. In order to...

In two different classes of network models, namely, the Watts Strogatz type and the Euclidean type, subtle changes have been introduced in the randomness. In the Watts Strogatz type network, rewiring has been done in different ways and although the qualitative results remain the same, finite...

A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly...

Rumor diffusion on complex networks has been widely investigated assuming that an individual learns the rumor merely from its neighbors, which, however, is not always the case. Recent studies of layered models have shown that individuals belonging to many different networks can affect the...

In this paper, we propose a novel measure that integrates both the concept of closed walks and clustering coefficients to replace the edge betweenness in the well-known divisive hierarchical clustering algorithm, the Girvan and Newman method (GN). The edges with the lowest value are removed...

In this paper, we present a new approach to extract communities in the complex networks with considerable accuracy. We introduce the core-vertex and the intimate degree between the community and its neighboring vertices. First, we find the core-vertices as the initial community. These...