Related papers: Towards Modelling The Internet Topology - The Inte…
From biosystem to complex system,the study of life is always an important area. Inspired by hyper-cycle theory about the evolution of non-life system, we study the metabolism, self-replication and mutation behavior in the Internet based on…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…
This work examines the problem of topology inference over discrete-time nonlinear stochastic networked dynamical systems. The goal is to recover the underlying digraph linking the network agents, from observations of their state-evolution.…
We propose a new paradigm to design a network-based self-adaptive epidemic model that relies on the interplay between the network and its line graph. We implement this proposal on a Susceptible-Infected-Susceptible model in which both nodes…
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…
We present a statistical analysis of different metrics characterizing the topological properties of Internet maps, collected at two different resolution scales: the router and the autonomous system level. The metrics we consider allow us to…
A great variety of systems in nature, society and technology -- from the web of sexual contacts to the Internet, from the nervous system to power grids -- can be modeled as graphs of vertices coupled by edges. The network structure,…
We focus on the problem of how wealth is distributed among the units of a networked economic system. We first review the empirical results documenting that in many economies the wealth distribution is described by a combination of…
We study collaboration networks in terms of evolving, self-organizing bipartite graph models. We propose a model of a growing network, which combines preferential edge attachment with the bipartite structure, generic for collaboration…
We model the Internet as a network of interconnected Autonomous Systems which self-organize under an absolute lack of centralized control. Our aim is to capture how the Internet evolves by reproducing the assembly that has led to its actual…
Dynamical processes taking place on real networks define on them evolving subnetworks whose topology is not necessarily the same of the underlying one. We investigate the problem of determining the emerging degree distribution, focusing on…
The analysis in this paper helps to explain the formation of growing networks with degree distributions that follow extended exponential or power-law tails. We present a generic model in which edge dynamics are driven by a continuous…
In real life, networks are dynamic in nature; they grow over time and often exhibit power-law degree sequences. To model the evolving structure of the internet, Barab\'{a}si and Albert introduced a simple dynamic model with a power-law…
We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…
In this paper we theoretically and empirically study the degree and connectivity of the Internet's scale-free topology at the autonomous system (AS) level. The basic features of the scale-free network have influence on the normalization…
Networks grow and evolve by local events, such as the addition of new nodes and links, or rewiring of links from one node to another. We show that depending on the frequency of these processes two topologically different networks can…
We present a stochastic model for a social network, where new actors may join the network, existing actors may become inactive and, at a later stage, reactivate themselves. Our model captures the evolution of the network, assuming that…
Three models of growing random networks with fitness dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes…
We introduce a growing network evolution model with nodal attributes. The model describes the interactions between potentially violent V and non-violent N agents who have different affinities in establishing connections within their own…