相关论文: Towards Modelling The Internet Topology - The Inte…

In many complex systems, states and interaction structure coevolve towards a dynamic equilibrium. For the adaptive contact process, we obtain approximate expressions for the degree distributions that characterize the interaction network in…

We propose a model for the growth of weighted networks that couples the establishment of new edges and vertices and the weights' dynamical evolution. The model is based on a simple weight-driven dynamics and generates networks exhibiting…

We study the structure and evolution of the Internet's Autonomous System (AS) interconnection topology as a game with heterogeneous players. In this network formation game, the utility of a player depends on the network structure, e.g., the…

We propose a general geometric growth model for pseudofractal scale-free web, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree…

Accurate modeling of realistic network topologies is essential for evaluating novel Internet solutions. Current topology generators, notably scale-free-based models, fail to capture multiple properties of intra-AS topologies. While…

Recent years have seen a growing interest in the modeling and simulation of social networks to understand several social phenomena. Two important classes of networks, small world and scale free networks have gained a lot of research…

We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When…

We study the growth of London's street-network in its dual representation, as the city has evolved over the last 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the…

Network topology and nodal dynamics are two fundamental stones of adaptive networks. Detailed and accurate knowledge of these two ingredients is crucial for understanding the evolution and mechanism of adaptive networks. In this paper, by…

The coarsest approximation of the structure of a complex network, such as the Internet, is a simple undirected unweighted graph. This approximation, however, loses too much detail. In reality, objects represented by vertices and edges in…

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…

We evolve network topology of an asymmetrically connected threshold network by a simple local rewiring rule: quiet nodes grow links, active nodes lose links. This leads to convergence of the average connectivity of the network towards the…

We propose a growing network model that consists of two tunable mechanisms: growth by merging modules which are represented as complete graphs and a fitness-driven preferential attachment. Our model exhibits the three prominent statistical…

We consider a finite structured population of mobile individuals that strategically explore a network using a Markov movement model and interact with each other via a public goods game. We extend the model of Erovenko et al. (2019) from…

Real-world networks grow over time; statistical models based on node exchangeability are not appropriate. Instead of constraining the structure of the \textit{distribution} of edges, we propose that the relevant symmetries refer to the…

The presence of hierarchy in many real-world networks is not yet fully explained. Complex interaction networks are often coarse-grain models of vast modular networks, where tightly connected subgraphs are agglomerated into nodes for…

We propose a simple growing model for the evolution of small-world networks. It is introduced as a modified BA model in which all the edges connected to the new nodes are made locally to the creator and its nearest neighbors. It is found…

Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…

We present a deterministic model for on-line social networks (OSNs) based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at each time-step and for every existing node $x$, a new…