Related papers: The spectrum of the averaging operator on a networ…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…
Consider a two-dimensional domain shaped like a wire, not necessarily of uniform cross section. Let $V$ denote an electric potential driven by a voltage drop between the conducting surfaces of the wire. We consider the operator ${\mathcal…
Substituting each edge of a simple connected graph $G$ by a path of length 1 and $k$ paths of length 5 generates the $k$-hexagonal graph $H^k(G)$. Iterative graph $H^k_n(G)$ is produced when the preceding constructions are repeated $n$…
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the…
The zigzag process is a variant of the telegraph process with position dependent switching intensities. A characterization of the $L^2$-spectrum for the generator of the one-dimensional zigzag process is obtained in the case where the…
A bounded operator $u$ on $X$ is called rigid when there is an increasing sequence of positive integers $(n_k)_{k\geq 1}$, such that for every $x$ in $X$ we have $\lim_{k \rightarrow +\infty} u^{n_k} x = x$. For any $r$ in $[0,1]$, we…
We establish an algorithm for a criterion of the diagonalisability of a matrix over a local field by a unitary matrix. For this sake, we define the notion of normality of a $p$-adic operator, and give several criteria for the normality. We…
Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…
The distance of an operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Associative spectra were introduced in a publication by B. Cs\'ak\'any and T. Waldhauser in…
We study the discreteness of the spectrum of Schrodinger operators which are defined on N-dimensional rooted trees of a finite or infinite volume, and are subject to a certain mixed boundary condition. We present a method to estimate their…
Let $A$ be a normal operator in a Hilbert space $\mathcal{H}$, and let $\mathcal{G} \subset \mathcal{H}$ be a countable set of vectors. We investigate the relations between $A$, $\mathcal{G}$ , and $L$ that makes the system of iterations…
I will show that operator of analytic (harmonic) continuation on a lattice graph has a positive spectrum. I use a theorem about positivity of eigenvalues of totally positive matrices. I conjecture that by approximation the similar result…
We derive a sharp criterion on the spectra of periodic discrete Schr\"odinger operators acting on connected periodic lattices: the measure of the spectrum goes to zero as the coupling constant goes to infinity if and only if there is no…
In this paper, we define a ternary graph operation which generalizes the construction of subdivision graph, $R-$graph, central graph. Also, it generalizes the construction of overlay graph (Marius Somodi \emph{et al.}, 2017), and…
Diffusion processes are instrumental to describe the movement of a continuous quantity in a generic network of interacting agents. Here, we present a probabilistic framework for diffusion in networks and propose to classify agent…
We consider a first order operator with a periodic 3x3 matrix potential on the real line. This operator appears in the problem of the periodic vector NLS equation. The spectrum of the operator covers the real line, it is union of the…
For 2D periodic Jacobi operators we obtain the estimate of the Lebesgue measure of the spectrum and estimates of edges of spectral bands.
Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…
Let $H_n$ be the linear heptagonal networks with $2n$ heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of $H_n$, we utilize the decomposition theorem.…
The cut-rank of a set $X$ of vertices in a graph $G$ is defined as the rank of the $ X \times (V(G)\setminus X)$ matrix over the binary field whose $(i,j)$-entry is $1$ if the vertex $i$ in $X$ is adjacent to the vertex $j$ in…