Related papers: Electrical networks on $n$-simplex fractals
We introduce two exotic lattice models on a general spatial graph. The first one is a matter theory of a compact Lifshitz scalar field, while the second one is a certain rank-2 $U(1)$ gauge theory of fractons. Both lattice models are…
We study spectral behavior of sparsely connected random networks under the random matrix framework. Sub-networks without any connection among them form a network having perfect community structure. As connections among the sub-networks are…
On the optical absorption and the density of states of Frenkel exciton systems on square, rectangular, and triangular lattices with nearest-neighbor interactions and a Gaussian distribution of transition frequencies. The analysis is based…
A graph $F$ is called a fractalizer if for all $n$ the only graphs which maximize the number of induced copies of $F$ on $n$ vertices are the balanced iterated blow ups of $F$. While the net graph is not a fractalizer, we show that the net…
A model for the generation of fractal growth networks in Euclidean spaces of arbitrary dimension is presented. These networks are considered as the spatial support of reaction-diffusion and pattern formation processes. The local dynamics at…
Many real-world complex systems have small-world topology characterized by the high clustering of nodes and short path lengths.It is well-known that higher clustering drives localization while shorter path length supports delocalization of…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
It is common knowledge that a key dynamical characteristic of a network is its spectrum (the collection of all eigenvalues of the network's weighted adjacency matrix). In \cite{BW10} we demonstrated that it is possible to reduce a network,…
Flux-energy and angle-energy diagrams for an exact three-dimensional Hamiltonian of the Bloch electron in a uniform magnetic field are analyzed. The dependence of the structure of the diagrams on the direction of the field, the geometry of…
We investigate a periodic quantum graph in form of a square lattice with a general self-adjoint coupling at the vertices. We analyze the spectrum, in particular, its high-energy behaviour. Depending on the coupling type, bands and gaps have…
Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…
This study presents a novel algorithm based on graph theory for the precise segmentation and measurement of detonation cells from 3D pressure traces, termed detonation lattices, addressing the limitations of manual and primitive 2D edge…
Let A be a minor-closed class of labelled graphs, and let G_n be a random graph sampled uniformly from the set of n-vertex graphs of A. When n is large, what is the probability that G_n is connected? How many components does it have? How…
On a dense energy grid reaching up to 75 meV electron collision energy the fragmentation angle and the kinetic energy release of neutral dissociative recombination fragments have been studied in a twin merged beam experiment. The anisotropy…
We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there…
Two-dimensional random Lorentz gases with absorbing traps are considered in which a moving point particle undergoes elastic collisions on hard disks and annihilates when reaching a trap. In systems of finite spatial extension, the…
We study the spectra and eigenvectors of the adjacency matrices of scale-free networks when bi-directional interaction is allowed, so that the adjacency matrix is real and symmetric. The spectral density shows an exponential decay around…
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
A spectral problem is considered in a thin $3D$ graph-like junction that consists of three thin curvilinear cylinders that are joined through a domain (node) of the diameter $\mathcal{O}(\varepsilon),$ where $\varepsilon$ is a small…