Farey graphs as models for complex networks
From MaRDI portal
Abstract: Farey sequences of irreducible fractions between 0 and 1 can be related to graph constructions known as Farey graphs. These graphs were first introduced by Matula and Kornerup in 1979 and further studied by Colbourn in 1982 and they have many interesting properties: they are minimally 3-colorable, uniquely Hamiltonian, maximally outerplanar and perfect. In this paper we introduce a simple generation method for a Farey graph family, and we study analytically relevant topological properties: order, size, degree distribution and correlation, clustering, transitivity, diameter and average distance. We show that the graphs are a good model for networks associated with some complex systems.
Recommendations
Cites work
- A geometric growth model interpolating between regular and small-world networks
- Collective dynamics of `small-world' networks
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- Evolving small-world networks with geographical attachment preference
- Farey Series and Maximal Outerplanar Graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3650472 (Why is no real title available?)
- scientific article; zbMATH DE number 4059444 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- Models of the small world.
- Random graph models of social networks
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
Cited in
(30)- Deterministic self-similar models of complex networks based on very symmetric graphs
- Ubiquity and the Farey graph
- Period adding with symmetry breaking/recovering in a power inverter with hysteresis control
- Counting spanning trees of a type of generalized Farey graphs
- The relations between network-operation and topological-property in a scale-free and small-world network with community structure
- A family of small-world network models built by complete graph and iteration-function
- Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
- Enumeration of subtrees of planar two-tree networks
- Farey recursive functions
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
- Combinatorial properties of Farey graphs
- Complexity of multi-architecture type of deterministic weighted generalized Farey organized network pyramids
- A deterministic pseudo-fractal networks with time-delay
- Tutte polynomial of the Apollonian network
- Corona graphs as a model of small-world networks
- Renormalization-group theory of the abnormal singularities at the critical-order transition in bond percolation on pointed hierarchical graphs
- Graphical models for complex networks: an application to Italian museums
- Rainbow vertex-connection number on a small-world Farey graph
- Farey-subgraphs and continued fractions
- The Hosoya index of graphs formed by a fractal graph
- Farey lines defining Farey diagrams and application to some discrete structures
- Maximum matchings in scale-free networks with identical degree distribution
- Haros graphs: an exotic representation of real numbers
- The Farey graph
- Modeling spatial networks by contact graphs of disk packings
- From unweighted to weighted generalized Farey organized tree and the pyramid networks
- Consensus dynamics and coherence in hierarchical small-world networks
- Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution
- Spectral analysis and its applications for a class of scale-free network based on the weighted m-clique annex operation
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
This page was built for publication: Farey graphs as models for complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627190)
