% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@article{faucris.110335764,
abstract = {Random unimodular lattice triangulations have been recently used as an embedded random graph model, which exhibit a crossover behavior between an ordered, large-world and a disordered, small-world behavior. Using the ergodic Pachner flips that transform such triangulations into another and an energy functional that corresponds to the degree distribution variance, Markov chain Monte Carlo simulations can be applied to study these graphs. Here, we consider the spectra of the adjacency and the Laplacian matrix as well as the algebraic connectivity and the spectral radius. Power law dependencies on the system size can clearly be identified and compared to analytical solutions for periodic ground states. For random triangulations we find a qualitative agreement of the spectral properties with well-known random graph models. In the microcanonical ensemble analytical approximations agree with numerical simulations. In the canonical ensemble a crossover behavior can be found for the algebraic connectivity and the spectral radius, thus combining large-world and small-world behavior in one model. The considered spectral properties can be applied to transport problems on triangulation graphs and the crossover behavior allows a tuning of important transport quantities.},
author = {Krüger, Benedikt and Schmidt, Ella and Mecke, Klaus},
doi = {10.1007/s10955-016-1493-0},
faupublication = {yes},
journal = {Journal of Statistical Physics},
keywords = {Triangulations;Random graphs;Networks;Spectral graph theory},
pages = {514-543},
peerreviewed = {Yes},
title = {{Spectral} {Properties} of {Unimodular} {Lattice} {Triangulations}},
volume = {163},
year = {2016}
}
@article{faucris.110314644,
abstract = {Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where their entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number of possible triangulations is unknown for large systems. We present a novel algorithm for an approximate enumeration which is based on calculations of the density of states using the Wang-Landau flat histogram sampling. For triangulations on two-dimensional integer lattices we achieve excellent agreement with known exact numbers of small triangulations as well as an improvement of analytical calculated asymptotics. The entropy density is C = 2.196(3) consistent with rigorous upper and lower bounds. The presented numerical scheme can easily be applied to other counting and optimization problems. Copyright (C) EPLA, 2015},
author = {Mecke, Klaus and Krüger, Benedikt and Reinhard, Johannes},
doi = {10.1209/0295-5075/109/40011},
faupublication = {yes},
journal = {EPL - Europhysics Letters},
peerreviewed = {Yes},
title = {{Entropy} of unimodular lattice triangulations},
volume = {109},
year = {2015}
}
@article{faucris.110344124,
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 k >= 5. 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.},
author = {Mecke, Klaus and Krüger, Benedikt and Schmidt, Ella},
doi = {10.1088/1367-2630/17/2/023013},
faupublication = {yes},
journal = {New Journal of Physics},
keywords = {unimodular lattice triangulations;networks;maximal planar graphs},
peerreviewed = {Yes},
title = {{Unimodular} lattice triangulations as small-world and scale-free random graphs},
volume = {17},
year = {2015}
}
@article{faucris.110318164,
abstract = {which might guide a mathematician's proof for the exact asymptotics.},
author = {Krüger, Benedikt and Mecke, Klaus},
doi = {10.1103/PhysRevD.93.085018},
faupublication = {yes},
journal = {Physical Review D},
peerreviewed = {Yes},
title = {{Genus} dependence of the number of (non-)orientable surface triangulations},
volume = {93},
year = {2016}
}