Solvable Metric Growing Networks

Abstract

Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen to be embedded in a metric arrangement, where the geographic distance between vertices plays a crucial role. The present work proposes a model for growing network that takes into account the geographic distance between vertices: the probability that they are connected is higher if they are located nearer than farther. In this framework, the mean degree of vertices, degree distribution and shortest path length between two randomly chosen vertices are analysed.

References in corpus (16)

• Emergence of scaling in random networks
• Evolution of networks
• Scaling and percolation in the small-world network model
• Modeling the Internet's Large-Scale Topology
• Evolution of reference networks with aging
• Scaling properties of scale-free evolving networks: Continuous approach
• Crossover from Scale-Free to Spatial Networks
• The number of matchings in random graphs
• Modulated Scale-free Network in the Euclidean Space
• The effects of spatial constraints on the evolution of weighted complex networks
• Evolving networks with disadvantaged long-range connections
• Geographical threshold graphs with small-world and scale-free properties
• Kleinberg Navigation in Fractal Small World Networks
• Circuits in random graphs: from local trees to global loops
• Clustering properties of a generalised critical Euclidean network
• Diluted antiferromagnet in a ferromagnetic enviroment