Related papers: The graph, range and level set singularity spectra…
We achieve the multifractal analysis of a class of complex valued statistically self-similar continuous functions. For we use multifractal formalisms associated with pointwise oscillation exponents of all orders. Our study exhibits new…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…
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 completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
This paper gives the pointwise H\"older (or multifractal) spectrum of continuous functions on the interval $[0,1]$ whose graph is the attractor of an iterated function system consisting of $r\geq 2$ affine maps on $\mathbb{R}^2$. These…
By an appropriate definition, we divide the irregular set into level sets. Then we characterize the multifractal spectrum of these new pieces by calculating their entropies. We also compute the entropies of various intersections of the…
We introduce multifractal zeta-functions providing precise information of a very general class of multifractal spectra, including, for example, the multifractal spectra of self-conformal measures and the multifractal spectra of ergodic…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…
Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two…
This paper investigates new properties concerning the multifractal structure of a class of statistically self-similar measures. These measures include the well-known Mandelbrot multiplicative cascades, sometimes called independent random…
In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…
We introduce multifractal pressure and dynamical multifractal zeta-functions providing precise information of a very general class of multifractal spectra, including, for example, the fine multifractal spectra of graph-directed…
Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
The self-similar functions of zero spectral degree are defined. The singular points of these functions are investigated and full classification of points is given. The connection with spectral problems (Stieltjes string) is pointed out.
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
Here, we define a subdivision operation for a hypergraph and compute all the eigenvalues of the subdivision of regular and certain non-regular hypergraphs. In non-regular hypergraphs, we investigate the power of regular graphs, various…
Whenever we have a group acting on a class of functions by translation, the bispectrum offers a principled and lossless way of representing such functions invariant to the action. Unfortunately, computing the bispectrum is often costly and…