Related papers: The graph, range and level set singularity spectra…
In a previous paper we introduced a new `dimension spectrum', motivated by the Assouad dimension, designed to give precise information about the scaling structure and homogeneity of a metric space. In this paper we compute the spectrum…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. We show for instance that all the connected graphs in a self-similar sequence have not only the…
Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal $O(n \log n)$ sampling algorithms on bounded-degree graphs…
We study cascading failures in a system comprising interdependent networks/systems, in which nodes rely on other nodes both in the same system and in other systems to perform their function. The (inter-)dependence among nodes is modeled…
We propose a simple method for resolution of co-spectrality of Schr\"odinger operators on metric graphs. Our approach consists of attaching a lead to them and comparing the $S$-functions of the corresponding scattering problems on these…
We analyse the spatial diversity of a multipath fading process for a finite region or curve in the plane. By means of the Karhunen-Lo\`eve (KL) expansion, this diversity can be characterised by the eigenvalue spectrum of the spatial…
Multifractal analysis studies level sets of asymptotically defined quantities in a topological dynamical system. We consider the topological pressure function on such level sets, relating it both to the pressure on the entire phase space…
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
We establish spectral estimates at a critical energy level for $h$-pseudors . Via a trace formula, we compute the contribution of isolated (non-extremum) critical points under a condition of "real principal type". The main result holds for…
The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…
A hypergraph generalizes the concept of an ordinary graph. In an ordinary graph, edges connect pairs of vertices, whereas in a hypergraph, hyperedges can connect multiple vertices at a time. In this paper, we obtain a relationship between…
Let $G_1$ and $G_2$ be two simple connected graphs. The invariant \textit{coronal} of graph is used in order to determine the $\alpha$-eigenvalues of four different types of graph equations that are $G_1 \circ G_2, G_1\lozenge G_1$ and the…
We consider topological dynamical systems over $\ZZ$ and, more generally, locally compact, $\sigma$-compact abelian groups. We relate spectral theory and diffraction theory. We first use a a recently developed general framework of…
We applied tensor network contraction algorithms to compute the hard-core lattice gas model, i.e., the enumeration of independent sets on grid graphs. We observed the influence of surface effect and parity effect on the enumeration (and…
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
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…
This article establishes several remarkably simple identities relating certain metric invariants of level curves of real and complex functions. In particular, we relate lengths of level curves to their curvature and to the gradient field of…
We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…