In this paper, we present a novel local-world model of wireless sensor networks (WSN) with two kinds of nodes: sensor nodes and sink nodes, which is different from other models with identical nodes and links. The model balances energy consumption by limiting the connectivity of sink nodes to...

Statistical properties of position-dependent ball-passing networks in real football games are examined. We find that the networks have the small-world property, and their degree distributions are fitted well by a truncated gamma distribution function. In order to reproduce these properties of...

The paper develops an evolutionary framework of regional resilience with a primary focus on the structural properties of local knowledge networks. After a presentation of the network-based rationales of growth and structuring of clusters, we analyze under which structural conditions a regional...

What explains the large variation in the number of contacts (degree) that different participants of social networks have: age, randomness, or some unobservable fitness measure? To answer this question, I extend the model presented in Jackson and Rogers (2007) to allow individuals to vary in...

We propose several connectedness measures built from pieces of variance decompositions, and we argue that they provide natural and insightful measures of connectedness. We also show that variance decompositions define weighted, directed networks, so that our connectedness measures are intimately...

In many real-world networks, the number of links increases non-linearly with the number of nodes. Models of such accelerated growth have been considered earlier with deterministic and stochastic number of links. Here we consider stochastic accelerated growth in a network where links are...

In order to explore further the mechanism responsible for scale-free networks, we introduce two extended models of the BA model. The model A, where the system incorporates the addition of new links between existing nodes, a new node with new links and the rewiring of some links at every time...

In this paper, a new topological approach for studying a sufficiently long random number sequence is proposed. By segmenting the sequence into groups of digits which represent the node identities while the undirected edges symbolize the adjacency between them, a network is constructed for...

This paper proposes a network model to understand the scale-free property of directed networks. The proposed model assigns two intrinsic variables (incoming and outgoing weights) to every node. A directed link is established from node i to node j if the sum of the outgoing weight of node i and...

We propose a model of time evolving networks in which a kind of transport between vertices generates new edges in the graph. We call the model “Network formed by traces of random walks”, because the transports are represented abstractly by random walks. Our numerical calculations yield...