Related papers: Diffusion-annihilation processes in complex networ…
When the network is reconstructed, two types of errors can occur: false positive and false negative errors about the presence or absence of links. In this paper, the influence of these two errors on the vertex degree distribution is…
The spread of disease on complex networks has attracted widely attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In…
The growth of an interface formed by the hierarchical deposition of particles of unequal size is studied in the framework of a dynamical network generated by a horizontal visibility algorithm. For a deterministic model of the deposition…
The degree heterogeneity and homophily are two typical features in network data. In this paper, we formulate a general model for undirected networks with these two features and present the moment estimation for inferring the degree and…
We consider a general heterogeneous network in which, besides general propagation effects (shadowing and/or fading), individual base stations can have different emitting powers and be subject to different parameters of Hata-like path-loss…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
After a failure or attack the structure of a complex network changes due to node removal. Here, we show that the degree distribution of the distorted network, under any node disturbances, can be easily computed through a simple formula.…
This work develops a mean-field analysis for the asymptotic behavior of deep BitNet-like architectures as smooth quantization parameters approach zero. We establish that empirical measures of latent weights converge weakly to solutions of…
In this paper, we provide a general method to obtain the exact solutions of the degree distributions for RBDN with network size decline. First by stochastic process rules, the steady state transformation equations and steady state degree…
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…
The edges in networks are not only binary, either present or absent, but also take weighted values in many scenarios (e.g., the number of emails between two users). The covariate-$p_0$ model has been proposed to model binary directed…
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a…
We derive a mean-field approximation for the macroscopic dynamics of large networks of pulse-coupled theta neurons in order to study the effects of different network degree distributions, as well as degree correlations (assortativity).…
We introduce a general deterministic model for Apollonian Networks in an iterative fashion. The networks have small-world effect and scale-free topology. We calculate the exact results for the degree exponent, the clustering coefficient and…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
By analysing the diffusive dynamics of epidemics and of distress in complex networks, we study the effect of the assortativity on the robustness of the networks. We first determine by spectral analysis the thresholds above which…
For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
It is commonly believed that real networks are scale-free and fraction of nodes $P(k)$ with degree $k$ satisfies the power law $P(k) \propto k^{-\gamma} \text{ for } k > k_{min} > 0$. Preferential attachment is the mechanism that has been…
We investigate the totally asymmetric simple exclusion process on closed and directed random regular networks, which is a simple model of active transport in the one-dimensional segments coupled by junctions. By a pair mean-field theory and…