Related papers: The Graph and Range Singularity Spectra of Random …
We show the relevance of a multifractal-type analysis for pointwise convergence and divergence properties of wavelet series: Depending on the sequence space which the wavelet coefficients sequence belongs to, we obtain deterministic upper…
The goal of multifractal analysis is to characterize the variations in local regularity of functions or signals by computing the Hausdorff dimension of the sets of points that share the same regularity. While classical approaches rely on…
With the "iso-H\"older" sets of a function we naturally associate subsets of the graph, range and level set of the function. We compute the associated singularity spectra for a class of statistically self-similar multifractal functions,…
We describe the multifractal nature of random weak Gibbs measures on some class of attractors associated with $C^1$ random dynamics semi-conjugate to a random subshift of finite type. This includes the validity of the multifractal…
We study the global and local regularity properties of random wavelet series whose coefficients exhibit correlations given by a tree-indexed Markov chain. We determine the law of the spectrum of singularities of these series, thereby…
Random-scan Gibbs samplers possess a natural hierarchical structure. The structure connects Gibbs samplers targeting higher dimensional distributions to those targeting lower dimensional ones. This leads to a quasi-telescoping property of…
The wavelet transform and related techniques are used to analyze singular and fractal signals. The normalized wavelet scalogram is introduced to detect singularities including jumps, cusps and other sharply changing points. The wavelet…
In this two-paper series, we prove the invariance of the Gibbs measure for a three-dimensional wave equation with a Hartree nonlinearity. The main novelty is the singularity of the Gibbs measure with respect to the Gaussian free field. The…
The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
The eccentricity matrix $\epsilon(G)$, of a connected graph $G$ is obtained by retaining the maximum distance from each row and column of the distance matrix of $G$ and the other entries are assigned with 0. In this paper, we discuss the…
Gibbs random fields corresponding to systems of real-valued spins (e.g. systems of interacting anharmonic oscillators) indexed by the vertices of unbounded degree graphs with a certain summability property are constructed. It is proven that…
In this work, we study the properties of sampling sets on families of large graphs by leveraging the theory of graphons and graph limits. To this end, we extend to graphon signals the notion of removable and uniqueness sets, which was…
The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…
In this paper, we introduce a notion of weak pointwise Holder regularity, starting from the de nition of the pointwise anti-Holder irregularity. Using this concept, a weak spectrum of singularities can be de ned as for the usual pointwise…
Let $(G_\epsilon)_{\epsilon>0}$ be a family of '$\epsilon$-thin' Riemannian manifolds modeled on a finite metric graph $G$, for example, the $\epsilon$-neighborhood of an embedding of $G$ in some Euclidean space with straight edges. We…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
For a graph $G=(V,E)$, and a symplectic vector space $(W, \left<\cdot,\cdot\right>)$, we define a variety $X(G,W)$ consisting of all functions $w:V\to W$ satisfying $\left<w(u), w(v)\right> = 0$ for any edge $\{u,v\}$ in $G$. We study the…
We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…