Geographical threshold graphs with small-world and scale-free properties.

  title={Geographical threshold graphs with small-world and scale-free properties.},
  author={Naoki Masuda and Hiroyoshi Miwa and Norio Konno},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={71 3 Pt 2A},
  • N. Masuda, H. Miwa, N. Konno
  • Published 15 September 2004
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Many real networks are equipped with short diameters, high clustering, and power-law degree distributions. With preferential attachment and network growth, the model by Barabási and Albert simultaneously reproduces these properties, and geographical versions of growing networks have also been analyzed. However, nongrowing networks with intrinsic vertex weights often explain these features more plausibly, since not all networks are really growing. We propose a geographical nongrowing network… 

Figures from this paper

Structural properties of scale‐free networks
The structural properties of scale-free networks are studied and it is shown that in the regime 2 < < 3 the networks are resilient to random breakdown and the percolation transition occurs only in the limit of extreme dilution.
The Structure of Geographical Threshold Graphs
The structure of random graphs generated by the geographical threshold model, a generalization of random geometric graphs, is analyzed, finding that its scaling is very close to 1/l when the node weights are exponentially distributed.
On the mixing time of geographical threshold graphs
Solvable metric growing networks
A model for a growing network that takes into account the geographical distance between vertices is proposed, which shows that the probability that they are connected is higher if they are located nearer to each other than if they were further apart.
Contact graphs of disk packings as a model of spatial planar networks
This paper proposes a minimal model for spatial maximal planar networks, similar to but different from the model for Apollonian networks, and shows that topological properties of the two networks are encoded in the way of disk packing.
Factorization threshold models for scale-free networks generation
This article suggests a new approach for generating scale-free networks with an alternative source of the power-law degree distribution that derives from matrix factorization methods and geographical threshold models and proposes an extension of the model that allows us to generate directed networks with tunable power-laws exponents.
Algorithms and Models for the Web Graph
  • P. Prałat
  • Mathematics, Computer Science
    Lecture Notes in Computer Science
  • 2017
This paper discusses the estimation of moment estimators based on observed degrees and frequencies of 2-stars and triangles for transitivity of Binomial random intersection graphs, and confirms that the empirical transitivity coefficient of the graph is with high probability close to the theoretical clustering coefficient.
Geometric Graph Properties of the Spatial Preferred Attachment model
Generalized Erdős numbers for network analysis
The concept of topological proximity (or ‘closeness’) between nodes in a weighted network using the generalized Erdős numbers (GENs) is considered, which satisfies a number of desirable properties for networks with nodes that share a finite resource.


Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights.
This work analyzes the network model based on thresholding of the summed vertex weights, which belongs to the class of networks proposed by Phys.
Clustering properties of a generalized critical Euclidean network.
  • P. Sen, S. S. Manna
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
This work studies the properties of a growing network, which has all these features, in which an incoming node is connected to its ith predecessor of degree k(i) with a link of length l using a probability proportional to k(beta)(i)l(alpha).
The architecture of complex weighted networks.
This work studies the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively, and defines appropriate metrics combining weighted and topological observables that enable it to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices.
Evolving networks with disadvantaged long-range connections.
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the
The average distances in random graphs with given expected degrees
  • F. Chung, Linyuan Lu
  • Mathematics, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
It is shown that for certain families of random graphs with given expected degrees the average distance is almost surely of order log n/log d́, where d̃ is the weighted average of the sum of squares of the expected degrees.
Evolution of networks
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Scale-free networks on lattices.
It is found that all networks with lambda>2 can be successfully embedded up to a (Euclidean) distance xi which can be made as large as desired upon the changing of an external parameter.
Scale-free networks from varying vertex intrinsic fitness.
A new mechanism leading to scale-free networks is proposed, which is called a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected).
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.