Unimodular lattice triangulations as small-world and scale-free random graphs

DOI10.1088/1367-2630/17/2/023013MaRDI QIDQ3387629zbMATH OpenOpenAlexFDO

Authors Benedikt Krüger, Ella M. Schmidt, Klaus Mecke

Publication date 13 January 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1501.02148

zbMATH Keywords

networksmaximal planar graphsunimodular lattice triangulations

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Abstract: Real-world networks, e.g. the social relations or world-wide-web graphs, exhibit both small-world and scale-free behaviour. We interpret lattice triangulations as planar graphs by identifying triangulation vertices with graph nodes and one-dimensional simplices with edges. Since these triangulations are ergodic with respect to a certain Pachner flip, applying different Monte-Carlo simulations enables us to calculate average properties of random triangulations, as well as canonical ensemble averages using an energy functional that is approximately the variance of the degree distribution. All considered triangulations have clustering coefficients comparable with real world graphs, for the canonical ensemble there are inverse temperatures with small shortest path length independent of system size. Tuning the inverse temperature to a quasi-critical value leads to an indication of scale-free behaviour for degrees $kgeq5$. Using triangulations as a random graph model can improve the understanding of real-world networks, especially if the actual distance of the embedded nodes becomes important.

Recommendations

• Relations between scaling exponents in unimodular random graphs
• On percolation critical probabilities and unimodular random graphs
• Random lattice triangulations: structure and algorithms
• Random lattice triangulations: structure and algorithms
• Universality of random graphs
• A new class of scale free random graphs
• Counterexamples for percolation on unimodular random graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 5015286 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• Equation of state calculations by fast computing machines
• Geographical embedding of scale-free networks
• Glass transition in self-organizing cellular patterns
• Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
• Konstruktionsmethoden und das kombinatorische Homöomorphieproblem für Triangulationen kompakter semilinearer Mannigfaltigkeiten. (Methods of constructions and the combinatorical homeomorphism problem for triangulations of compact semilinear manifolds)
• Long-range geometrical correlations in two-dimensional foams
• Networks. An introduction.
• On the strength of connectedness of a random graph
• Quantum Gravity
• Random cellular froths in spaces of any dimension and curvature
• Random lattice triangulations: structure and algorithms
• Renormalization group analysis of the small-world network model
• Statistical mechanics of complex networks
• Transforming triangulations
• Triangulations. Structures for algorithms and applications

Cited in

(3)

• Tuning the clustering coefficient of generalized circulant networks
• Spectral properties of unimodular lattice triangulations
• A Lyapunov function for Glauber dynamics on lattice triangulations

Describes a project that uses

Uses Software

• NetworkX

This page was built for publication: Unimodular lattice triangulations as small-world and scale-free random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387629)