相关论文: Integer Networks

Graphical models are frequently used to represent topological structures of various complex networks. Current criteria to assess different models of a network mainly rely on how close a model matches the network in terms of topological…

We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…

Inspired by the structure of technological networks, we discuss network evolution mechanisms which give rise to topological properties found in real spatial networks. Thus, the peculiar structure of transport and distribution networks is…

We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and…

Over the last decade, random hyperbolic graphs have proved successful in providing geometric explanations for many key properties of real-world networks, including strong clustering, high navigability, and heterogeneous degree…

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…

The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…

In Network Science node neighbourhoods, also called ego-centered networks have attracted large attention. In particular the clustering coefficient has been extensively used to measure their local cohesiveness. In this paper, we show how,…

Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great…

We introduce a minimal model of small-world growing network generated by attaching to edges. The produced network is a plane graph which exists in real-life world. We obtain the analytic results of degree distribution decaying exponentially…

The line graphs are clustered and assortative. They share these topological features with some social networks. We argue that this similarity reveals the cliquey character of the social networks. In the model proposed here, a social network…

Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…

Understanding the origins of complexity is a fundamental challenge with implications for biological and technological systems. Network theory emerges as a powerful tool to model complex systems. Networks are an intuitive framework to…

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied.…

We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the…

Physical networks are made of nodes and links that are physical objects embedded in a geometric space. Understanding how the mutual volume exclusion between these elements affects the structure and function of physical networks calls for a…

Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This…

We study the problem of identifying different behaviors occurring in different parts of a large heterogenous network. We zoom in to the network using lenses of different sizes to capture the local structure of the network. These network…

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…

Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy.…