Related papers: Electrical networks on $n$-simplex fractals
Gapped fracton phases constitute a new class of quantum states of matter which connects to topological orders but does not fit easily into existing paradigms. They host unconventional features such as sub-extensive and robust ground state…
Given an admissible map F for a homogeneous network N, it is known that the Jacobian DF(x) around a fully synchronous point x = (x0, ..., x0) is again an admissible map for N. Motivated by this, we study the spectra of linear admissible…
In \cite{LaLuRa13}, the authors completely classified the topological structure of so called {\it fractal square} $F$ defined by $F=(F+{\mathcal D})/n$, where ${\mathcal{D}}\subsetneq\{0,1,\dots,n-1\}^2, n\ge 2$. In this paper, we further…
Fractal scatterings in weak solitary wave interactions is analyzed for generalized nonlinear Schr\"odiger equations (GNLS). Using asymptotic methods, these weak interactions are reduced to a universal second-order map. This map gives the…
Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as…
We study the network dismantling problem, which consists in determining a minimal set of vertices whose removal leaves the network broken into connected components of sub-extensive size. For a large class of random graphs, this problem is…
We perform numerical simulations to study the optimal path problem on disordered hierarchical graphs with effective dimension d=2.32. Therein, edge energies are drawn from a disorder distribution that allows for positive and negative…
A perturbation decaying to 0 at infinity and not too irregular at 0 introduces at most a discrete set of eigenvalues into the spectral gaps of a one-dimensional Dirac operator on the half-line. We show that the number of these eigenvalues…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Let $G$ be a connected simple graph with $n$ vertices. The distance Laplacian matrix $D^{L}(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the diagonal matrix of vertex transmissions and $D(G)$ is the distance matrix of $G$.…
We investigate the issue of eigenfunction localization in random fractal lattices embedded in two dimensional Euclidean space. In the system of our interest, there is no diagonal disorder -- the disorder arises from random connectivity of…
We study solution sensitivity for nonlinear programs (NLPs) whose structures are induced by graphs. These NLPs arise in many applications such as dynamic optimization, stochastic optimization, optimization with partial differential…
The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph,…
The optical properties of YNi$_2$B$_2$C are studied by using the first-principles full-potential linearized augmented plane wave (FLAPW) method within the local density approximation. Anisotropic behavior is obtained in the optical…
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…
The \emph{simplicial rook graph} SR(d,n) is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove that…
Bifractal is a highly anisotropic structure where planar fractals are stacked to form a 3-dimensional lattice. The localization lengths along fractal structure for the Anderson model defined on a bifractal are calculated. The critical…
We consider the dynamics of noninteracting electrons on a square lattice in the presence of a magnetic flux {\alpha} and a dc electric field E oriented along the lattice diagonal. In general, the adiabatic dynamics of an electron will be…
We propose a mapping from fracture systems consisting of intersecting fracture sheets in three dimensions to an abstract network consisting of nodes and links. This makes it possible to analyze fracture systems with the methods developed…
A complex network is said to show topological isotropy if the topological structure around a particular node looks the same in all directions of the whole network. Topologically anisotropic networks are those where the local neighborhood…