Related papers: Electrical networks on $n$-simplex fractals
Restoration of macroscopic isotropy has been investigated in (d+1)-simplex fractal conductor networks via exact real space renormalization group transformations. Using some theorems of fixed point theory, it has been shown very rigoroursly…
In this article we study the energy level spectrum of fractals which have block-hierarchical structures. We develop a method to study the spectral properties in terms of linearization of spectral decimation procedure and verify it…
Polymer's network is treated as an anisotropic fractal with fractional dimensionality D = 1 + \epsilon close to one. Percolation model on such a fractal is studied. Using the real space renormalization group approach of Migdal and Kadanoff…
The first part of this paper deals with electrical networks and symplectic reductions. We consider two operations on electrical networks (the "trace map" and the "gluing map") and show that they correspond to symplectic reductions. We also…
To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. This is a natural description of an array of inductances and…
The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the…
We find that scale-free random networks are excellently modeled by a deterministic graph. This graph has a discrete degree distribution (degree is the number of connections of a vertex) which is characterized by a power-law with exponent…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
This paper discusses the enumeration of two-terminal series-parallel networks, i.e. the number of electrical networks built with n identical elements connected in series or parallel with two-terminal nodes. They frequently occur in applied…
Analytic results for the asymptotic decay of the electron density matrix in insulators have been obtained in all three dimensions ($D=1 - 3$) for a tight-binding model defined on a simple cubic lattice. The anisotropic decay length is shown…
It was discovered a few years ago that many networks in the real world exhibit self-similarity. A lot of researches on the structures and processes on real and artificial fractal complex networks have been done, drawing an analogy to…
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…
We consider the optimal covering of fractal sets in a two-dimensional space using ellipses which become increasingly anisotropic as their size is reduced. If the semi-minor axis is \epsilon and the semi-major axis is \delta, we set…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
We consider the linear damped wave equation on finite metric graphs and analyse its spectral properties with an emphasis on the asymptotic behaviour of eigenvalues. In the case of equilateral graphs and standard coupling conditions we show…
The magnetic phase diagram at zero external field of an ensemble of dipoles with uniaxial anisotropy on a FCC lattice is investigated from tempered Monte Carlo simulations. The uniaxial anisotropy is characterized by a random distribution…
Three dimensional dendrites are studied with a coupled map lattice model. We study the fractal dimensions, the f(\alpha) spectrum, the size distribution of sidebranches, and the envelope formed by sidebranches.