相关论文: Recursive graphs with small-world scale-free prope…

A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…

A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential…

We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…

Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others are random. Compared with deterministic networks, random…

We report on parallel observations in two seemingly unrelated areas of dynamical network research. The one is the so-called small world phenomenon and/or the observation of scale freeness in certain types of large (empirical) networks and…

Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…

We propose a general geometric growth model for pseudofractal scale-free web, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree…

Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…

The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This…

We define a statistical ensemble of non-degenerate graphs, i.e. graphs without multiple- and self-connections between nodes. The node degree distribution is arbitrary, but the nodes are assumed to be uncorrelated. This completes our earlier…

We formulate a simple edge generation rule based on an inverse like mass action principle for random graphs over a structured vertex set. We show that under very weak assumptions on the structure generating distribution we obtain a scale…

In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…

Leaves, i.e., vertices of degree one, can play a significant role in graph structure, especially in sparsely connected settings in which leaves often constitute the largest fraction of vertices. We consider a leaf-based counterpart of the…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the…

Discoveries of the scale-free and small-world features are reported on a network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the…

Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidences for hierarchical organization in many real networks have also been reported. Here, we present a new hierarchical model…

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…