相关论文: A Mean-Field Approach to Evolving Spatial Networks…

In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected…

Networks in nature are often formed within a spatial domain in a dynamical manner, gaining links and nodes as they develop over time. We propose a class of spatially-based growing network models and investigate the relationship between the…

The formation of new bone involves both the deposition of bone matrix, and the formation of a network of cells embedded within the bone matrix, called osteocytes. Osteocytes derive from bone-synthesising cells (osteoblasts) that become…

We consider an evolving network of a fixed number of nodes. The allocation of edges is a dynamical stochastic process inspired by biological reproduction dynamics, namely by deleting and duplicating existing nodes and their edges. The…

Owing to the influence of real-world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements…

The description of large temporal graphs requires effective methods giving an appropriate mesoscopic partition. Many approaches exist today to detect communities in static graphs. However, many networks are intrinsically dynamical, and need…

We study the evolution of networks when the creation and decay of links are based on the position of nodes in the network measured by their centrality. We show that the same network dynamics arises under various centrality measures, and…

In this paper, we study a certain class of nonlocal partial differential equations (PDEs). The equations arise from a key problem in network science, i.e., network generation from local interaction rules, which result in a change of the…

We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…

This article studies the dynamics of the mean-field approximation of continuous random networks. These networks are stochastic integrodifferential equations driven by Gaussian noise. The kernels in the integral operators are realizations of…

Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…

Evolving network models under a dynamic growth rule which comprises the addition and deletion of nodes are investigated. By adding a node with a probability $P_a$ or deleting a node with the probability $P_d=1-P_a$ at each time step, where…

The in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree. The network is built by (i) creation of new nodes which each…

In this paper we present a network model to study the impact of spatial distribution of constituents, coupling between them and diffusive processes in the context of biological situations. The model is in terms of network of mobile elements…

Most social, technological and biological networks are embedded in a finite dimensional space, and the distance between two nodes influences the likelihood that they link to each other. Indeed, in social systems, the chance that two…

Dynamic multilayer networks frequently represent the structure of multiple co-evolving relations; however, statistical models are not well-developed for this prevalent network type. Here, we propose a new latent space model for dynamic…

The Watts-Strogatz algorithm of transferring the square lattice to a small world network is modified by introducing preferential rewiring constrained by connectivity demand. The evolution of the network is two-step: sequential preferential…

Growing synthetic networks that follow power law distributions of a node's degree often involves adding one node at a time. Each node is added to the network with a fixed amount of edges and those edges are frozen for all future time steps.…

In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the…

Real world complex networks are scale free and possess meso-scale properties like core-periphery and community structure. We study evolution of the core over time in real world networks. This paper proposes evolving models for both…