Related papers: Electrical networks on $n$-simplex fractals

We present a comprehensive structural characterization of two different highly pure nuclear graphites that compasses all relevant length scales from nanometers to sub-mm. This has been achieved by combining several experiments and neutron…

We study a model of strongly interacting spinless fermions on an anisotropic triangular lattice. At half-filling and the limit of strong repulsive nearest-neighbor interactions, the fermions align in stripes and form an insulating state.…

We extend Feynman's analysis of an infinite ladder circuit to fractal circuits, providing examples in which fractal circuits constructed with purely imaginary impedances can have characteristic impedances with positive real part. Using…

We solve the O(n) model, defined in terms of self- and mutually avoiding loops coexisting with voids, on a 3-simplex fractal lattice, using an exact real space renormalization group technique. As the density of voids is decreased, the model…

Analysis on fractals is a growing field, with hints of potential for widespread applicability across all of STEM. One of the most heavily researched type of fractals are the nested fractals, fractal shapes defined by virtue of being made of…

In this article we investigate normalized adjacency eigenvalues (simply normalized eigenvalues) and normalized adjacency energy of connected threshold graphs. A threshold graph can always be represented as a unique binary string. Certain…

In this work we introduce an energy function in order to study finite scale free graphs generated with different models. The energy distribution has a fractal pattern and presents log periodic oscillations for high energies. This…

We consider the canonical ensemble of $N$-vertex Erd\H{o}s-R\'enyi (ER) random topological graphs with quenched vertex degree, and with fugacity $\mu$ for each closed triple of bonds. We claim complete defragmentation of large-$N$ graphs…

We analyze the fragmentation behavior of random clusters on the lattice under a process where bonds between neighboring sites are successively broken. Modeling such structures by configurations of a generalized Potts or random-cluster model…

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…

The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties. We study the transition matrix of a family of fractal scale-free networks and analytically determine…

Eigenvalue spectrum of the Laplacian on a metric graph with arbitrary but fixed vertex conditions is investigated in the limit as the lengths of all edges decrease to zero at the same rate. It is proved that there are exactly four possible…

We study the asymptotic behaviour of the eigenvalues of the Laplace-Beltrami operator on a compact hypersurface in \mathds{R}^{n+1} as it is flattened into a singular double-sided flat hypersurface. We show that the limit spectral problem…

We study the distribution of interior faces in uniformly random reduced $\mathfrak s \mathfrak l_3$ webs. Using Tymoczko's bijection between $3\times n$ standard Young tableaux and reduced webs, this problem can be reformulated in terms of…

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random,…

The entropy of entanglement between a three-dimensional slab of thickness l and its complement is studied numerically for four-dimensional SU(2) lattice gauge theory. We find a signature of a nonanalytic behavior of the entanglement…

Let $G$ be a connected graph on $n$ vertices, and let $D(G)$ be the distance matrix of $G$. Let $\partial_1(G)\ge\partial_2(G)\ge\cdots\ge\partial_n(G)$ denote the eigenvalues of $D(G)$. In this paper, we characterize all connected graphs…

We present a general and flexible procedure which allows for the reduction (or expansion) of any dynamical network while preserving the spectrum of the network's adjacency matrix. Computationally, this process is simple and easily…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…