Related papers: Fractional revival between twin vertices
We survey the use of continued fraction expansions in the algebraical and topological study of complex analytic singularities. We also prove new results, firstly concerning a geometric duality with respect to a lattice between plane…
This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex…
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining…
Let $G$ be a simple undirected connected graph with the Harary matrix $RD(G)$, which is also called the reciprocal distance matrix of $G$. The reciprocal distance signless Laplacian matrix of $G$ is $RQ(G)=RT(G)+RD(G)$, where $RT(G)$…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…
In a paired threshold graph, each vertex has a weight, and two vertices are adjacent if their weight sum is large enough and their weight difference is small enough. It generalizes threshold graphs and unit interval graphs, both very well…
In this article, we generate large families of non-isomorphic and signless Lalacian cospectral graphs using partial transpose on graphs. Our constructions are significantly powerful. More than $70\%$ of non-isomorphic signless-Laplacian…
This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
Can a graph specifying the pattern of connections of a dynamical network be reconstructed from statistical properties of a signal generated by such a system? In this model study, we present an evolutionary algorithm for reconstruction of…
We introduce a generalization of conventional lattice gauge theory to describe fracton topological phases, which are characterized by immobile, point-like topological excitations, and sub-extensive topological degeneracy. We demonstrate a…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
For two unlabeled graphs $G_1,G_2$ independently sub-sampled from an Erd\H{o}s-R\'enyi graph $\mathbf G(n,p)$ by keeping each edge with probability $s$, we aim to recover \emph{as many as possible} of the corresponding vertex pairs. We…
We consider the reconstruction of the vertex weight in the discrete Gel'fand's inverse boundary spectral problem for the graph Laplacian. Given the boundary vertex weight and the edge weight of the graph, we develop reconstruction…
We introduce a graph renormalization procedure based on the coarse-grained Laplacian, which generates reduced-complexity representations for characteristic scales identified through the spectral gap. This method retains both diffusion…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
Piecewise fractional linear maps wzth three or more branches have been studied in several papers. For many Moebius maps the shape of the density of their invariant measurs can be written down exactly. However, if just two branches are…