相关论文: Singular Continuous Spectrum for the Laplacian on …

For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…

In this paper, we consider a ${\rm U}(1)$-connection graph, that is, a graph where each oriented edge is endowed with a unit modulus complex number that is conjugated under orientation flip. A natural replacement for the combinatorial…

We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured real tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural…

In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…

In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…

We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…

Using the method of spectral decimation and a modified version of Kirchhoff's 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…

Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randi\'c indices for matching, whose values depend on the structure of the tree.…

This paper introduces the notion of local spectral expansion of a simplicial complex as a possible analogue of spectral expansion defined for graphs. We then show that the condition of local spectral expansion for a complex yields various…

We consider multifractal random wavelet series built from Gibbs measures, and study the singularity spectra associated with the graph and range of these functions restricted to their iso-H\"older sets. To obtain these singularity spectra,…

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

We obtain bounds for the spectrum and for the total width of the spectral gaps for Jacobi matrices on $\ell^2(\Z)$ of the form $(H\psi)_n= a_{n-1}\psi_{n-1}+b_n\psi_n+a_n\psi_{n+1}$, where $a_n=a_{n+q}$ and $b_n=b_{n+q}$ are periodic…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

The secular manifold $\Sigma_G$ and its singularities are intimately related to the spectra of metric graphs $(G,\ell)$. In this paper, we present a complete description of the singular locus for tree graphs, and confirm that it agrees with…

We develop a unified spectral framework for finite ultrametric phylogenetic trees, grounding the analysis of phylogenetic structure in operator theory and stochastic dynamics in the finite setting. For a given finite ultrametric measure…

This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…

Iterated conformal mappings are used to obtain exact multifractal spectra of the harmonic measure for arbitrary Laplacian random walks in two dimensions. Separate spectra are found to describe scaling of the growth measure in time, of the…

Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…