The G-degree of colored graphs is a key concept in the approach to Quantum Gravity via tensor models. The present paper studies the properties of the G-degree for the large class of graphs representing singular manifolds (including closed PL manifolds). In particular, the complete topological classification up to G-deg…
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it G-degree} of the involved graphs, which drives the {\it expansion} in the tensor …
(d+1)-colored graphs, i.e. edge-colored graphs that are (d+1)-regular, have already been proved to be a useful representation tool for compact PL d-manifolds, thus extending the theory (known as crystallization theory) originally developed for the closed case. In this context, combinatorially defined PL invariants play…
The aim of this paper is twofold. On the one hand, it provides a review of the links between random tensor models, seen as quantum gravity theories, and the PL-manifolds representation by means of edge-colored graphs (crystallization theory). On the other hand, the core of the paper is to establish results about the to…
New PL-invariants defined for 4-manifolds with boundary.
We introduce a representation via (n+1)-colored graphs of compact n-manifolds with (possibly empty) boundary, which appears to be very convenient for computer aided study and tabulation. Our construction is ageneralization to arbitrary dimension of the one recently given by Cristofori and Mulazzani in dimension three, …
Study compact PL 4-manifolds with special handle decompositions.
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. By utilizing fast matrix block-approximation techniques, we propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions, w…
In the aftermath of the financial crisis, the growing literature on financial networks has widely documented the predictive power of topological characteristics (e.g. degree centrality measures) to explain the systemic impact or systemic vulnerability of financial institutions. In this work, we show that considering al…