Related papers: Hierarchical deposition and scale-free networks: a…
We propose a novel paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter…
Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)] analyzed a model for network observability transitions in which a sensor placed on a node makes the node and the adjacent nodes observable. The size of the connected components…
A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node,…
We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for…
We investigate analytically and numerically the dynamical properties of critical Boolean networks with power-law in-degree distributions. When the exponent of the in-degree distribution is larger than 3, we obtain results equivalent to…
We study the influence of elements diffusing in and out of a network to the topological changes of the network and characterize it by investigating the behavior of probability of degree distribution ($\Gamma(k)$) with degree $k$. The local…
Probabilistic networks display a wide range of high average clustering coefficients independent of the number of nodes in the network. In particular, the local clustering coefficient decreases with the degree of the subtending node in a…
Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks.…
We explore the possibility to interpret as a 'gas' the dynamical self-organized scale-free network recently introduced by Kim et al (2005). The role of 'momentum' of individual nodes is played by the degree of the node, the 'configuration…
Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…
This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity.…
A general random graph evolution mechanism is defined. The evolution is a combination of the preferential attachment model and the interaction of N vertices (N>=3). A vertex in the graph is characterized by its degree and its weight. The…
Network embedding aims to learn the low-dimensional representations of vertexes in a network, while structure and inherent properties of the network is preserved. Existing network embedding works primarily focus on preserving the…
We introduce two practical properties of hierarchical clustering methods for (possibly asymmetric) network data: excisiveness and linear scale preservation. The latter enforces imperviousness to change in units of measure whereas the former…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…
We show that the collapsed globular phase of a polymer accommodates a scale-free incompatibility graph of its contacts. The degree distribution of this network is found to decay with the exponent $\gamma = 1/(2-c)$ up to a cut-off degree…
We consider a system hierarchically modular, if besides its hierarchical structure it shows a sequence of scale separations from the point of view of some functionality or property. Starting from regular, deterministic objects like the…
Unlike the well-studied models of growing networks, where the dominant dynamics consist of insertions of new nodes and connections, and rewiring of existing links, we study {\em ad hoc} networks, where one also has to contend with rapid and…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…