Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.05494

Mass generation in graphs

Ioannis Kleftogiannis·Ilias Amanatidis
View original source ↗Read source document ↗Export metadata ↓

Abstract

We demonstrate a mechanism for the production of massive excitations in graphs. We treat the number of neighbors at each vertex in the graph (degree) as a scalar field. Then we introduce a mechanism inspired by the Higgs mechanism in quantum field theory(QFT), that couples the degree field to a vector-like field, introduced via the graph edges, represented mathematically by the incident matrices of the graph. The coupling between the two fields produces a massless ground state and massive excitations, separated by a mass gap. The excitations can be treated as emergent massive particles, propagating inside the graph. We study how the size of the graph and its density, represented by the ratio of edges over vertices, affects the mass gap and the localization properties of the massive excitations. We show that the most massive excitations, corresponding to the heaviest emergent particles, localize on regions of the graph with high density, consisting of vertices with a large degree. On the other hand, the least massive excitations, corresponding to the lightest emergent particles localize on a few vertices but with a smaller degree. Excitations with intermediate masses are less localized, spreading on more vertices instead. Our study shows that emergence of matter-like structures with various mass properties, is possible in discrete physical models, relying only on a few fundamental properties like the connectivity of the models.

Explore related subjects

cond-mat.dis-nngr-qchep-lathep-thquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioannis Kleftogiannis, Ilias Amanatidis. 2026-04-07. Mass generation in graphs. https://arxiv.org/abs/2604.05494

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

R-transforms for non-Hermitian matrices: a spherical integral approach

In this paper, we establish a connection between the formalism of $\mathcal{R}$-transforms for non-Hermitian random matrices and the framework of spherical integrals, using the replica method. This connection was previously proved in the Hermitian setting and in the case of bi-invariant random matrices. We show that the $\mathcal{R}$-transforms used in the non-Hermitian context in fact originate from a single scalar function of two variables. This provides a new and transparent way to compute $\mathcal{R}$-transforms, which until now had been known only in restricted cases such as bi-invariant, Hermitian, or elliptic ensembles.

cond-mat.dis-nn↗
arXiv2026

Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic solutions. In this paper, we illustrate this phenomenon in the context of spectral boundaries (or spectral edges) for deformed random matrices. Specifically, we consider matrices of the form $\mathbf{A} + \mathbf{B}$, where $\mathbf{A}$ is a deterministic $N\times N$ matrix (not necessarily Hermitian) and $\mathbf{B}$ is a rotationally invariant random matrix. In the large-$N$ limit, we show that the complex eigenvalue distribution of $\mathbf{A} + \mathbf{B}$ satisfies remarkably simple boundary equations that depend on the $\mathcal{R}_1$ and $\mathcal{R}_2$ transforms of $\mathbf{B}$. We illustrate our results on several explicit random matrix ensembles and support them with numerical simulations.

cond-mat.dis-nn↗
arXiv2026

Electrical conductivity of crack-template-based transparent conducting films: mean-field approximation, effective-medium theory, and simulation

In this work, crack-template-based transparent conducting films were modeled as networks corresponding to the edges of a two-dimensional Poisson--Voronoi diagram. Two types of networks were considered: the original one, in which the conductance of each edge was inversely proportional to its length, and the effective one, in which all edges had the same conductance obtained from the effective-medium theory. The mean-field approximation was used for analytical evaluation of the electrical conductivity. Direct numerical calculations for the Poisson--Voronoi diagram showed that the mean-field approximation overestimated the effective conductivity of the original network by approximately 13\%, and of the effective network by 79\%. In addition, a honeycomb network with an edge conductance distribution corresponding to the Poisson--Voronoi diagram was studied: for it, the predictions of the effective-medium theory turned out to be more accurate than for the Poisson--Voronoi diagram, which was explained by the greater structural homogeneity of the periodic honeycomb lattice. The results indicate that, when modeling crack-template-based transparent conducting films, the application of the mean-field approximation may lead to significant errors if the resistance of individual conductors is not simply proportional to their length. This possibility is discussed as a motivation for future studies of hierarchical cracks with variable width, which are not directly investigated here.

cond-mat.dis-nn↗