Related papers: The Assouad spectrum and dimension of typical grap…

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…

Metric mean dimension is a geometric invariant of dynamical systems with infinite topological entropy. We relate this concept with the fractal structure of the phase space and the H\"older regularity of the map. Afterwards we improve our…

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…

This paper is concerned with the characterization of $\alpha$-modulation spaces by Banach frames, i.e., stable and redundant non-orthogonal expansions, constituted of functions obtained by a suitable combination of translation, modulation…

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…

We prove that the spectrum of the linear delay differential equation $x'(t)=A_{0}x(t)+A_{1}x(t-\tau_{1})+\ldots+A_{n}x(t-\tau_{n})$ with multiple hierarchical large delays $1\ll\tau_{1}\ll\tau_{2}\ll\ldots\ll\tau_{n}$ splits into two…

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

We give quadratic upper bounds for the asymptotic dimensions of the arc graphs and disk graphs.

Unimodular networks are a generalization of finite graphs in a stochastic sense. We prove a lower bound to the spectral radius of the adjacency operator and of the Markov operator of an unimodular network in terms of its average degree.…

We study quantum versions of the Shannon capacity of graphs and non-commutative graphs. We introduce the asymptotic spectrum of graphs with respect to quantum and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum…

One can define the notion of primitive length spectrum for a simple regular periodic graph via counting the orbits of closed reduced primitive cycles under an action of a discrete group of automorphisms. We prove that this primitive length…

Erd\H{o}s, Harary, and Tutte defined the dimension of a graph $G$ as the smallest natural number $n$ such that $G$ can be embedded in $\mathbb{R}^n$ with each edge a straight line segment of length 1. Since the proposal of this definition,…

In the first part of the paper we study the structure of Banach spaces with a conditional spreading basis. The geometry of such spaces exhibit a striking resemblance to the geometry of James' space. Further, we show that the averaging…

Given a collection $\mathcal{G}=(G_1,\dots, G_h)$ of graphs on the same vertex set $V$ of size $n$, an $h$-edge graph $H$ on the vertex set $V$ is a $\mathcal{G}$-transversal if there exists a bijection $\lambda : E(H) \rightarrow [h]$ such…

In this note, we provide equivalent definitions for fractal geometric dimensions through dyadic cube constructions. Given a metric space $X$ with finite Assouad dimension, i.e., satisfying the doubling property, we show that the…

The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as $v_1, v_2, \ldots, v_n$, so that for each $2 \le i \le n$, vertex $v_i$ is either adjacent…

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…

A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…

Let $\mathcal{A}_1$ and $\mathcal{A}_2$ be standard operator algebras on complex Banach spaces $X_1$ and $X_2$, respectively. For $k\geq2$, let $(i_1,...,i_m)$ be a sequence with terms chosen from $\{1,\ldots,k\}$, and assume that at least…