English
Related papers

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

200 papers

Given any continuous self-map f of a Banach space E over K (where K is R or C) and given any point p of E, we define a subset sigma(f,p) of K, called spectrum of f at p, which coincides with the usual spectrum sigma(f) of f in the linear…

Spectral Theory · Mathematics 2010-05-12 Alessandro Calamai , Massimo Furi , Alfonso Vignoli

We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we…

Mathematical Physics · Physics 2018-07-13 Federico Zerbini

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

Combinatorics · Mathematics 2025-09-16 Natalie Behague , Natasha Morrison , Jonathan A. Noel

The associative spectrum of a groupoid (i.e., a set with a binary operation) measures its nonassociativity while the associative-commutative spectrum measures both nonassociativity and noncommutativity of the groupoid. The two spectra are…

Combinatorics · Mathematics 2024-12-02 Jia Huang , Erkko Lehtonen

In this paper we give a detailed description of the random wavelet series representation of real-valued linear fractional stable sheet introduced in Ayache, Roueff and Xiao (2007). By using this representation, in the case where the sample…

Statistics Theory · Mathematics 2008-12-18 Antoine Ayache , François Roueff , Yimin Xiao

The structural parameter twin-width was introduced by Bonnet et al. in [FOCS 2020], and already this first paper included an asymptotic argument bounding the twin-width of planar graphs by a non-explicit constant. Quite recently, we have…

Combinatorics · Mathematics 2022-08-31 Petr Hliněný

Let $d\in\mathbb{N}$ and $\varphi\colon(0,1)\to[0,d]$. We prove there exists a set $F\subset\mathbb{R}^d$ whose lower spectrum $\operatorname{dim}^{\theta}_{\mathrm{L}} F$ satisfies $(1-\theta)\operatorname{dim}^{\theta}_{\mathrm{L}} F =…

Classical Analysis and ODEs · Mathematics 2026-03-04 Amlan Banaji , Haipeng Chen , Alex Rutar , Wen Wang

In this paper we study typical distances in the configuration model, when the degrees have asymptotically infinite variance. We assume that the empirical degree distribution follows a power law with exponent $\tau\in (2,3)$, up to value…

Probability · Mathematics 2017-09-20 Remco van der Hofstad , Julia Komjathy

In the paper we fully describe Taylor spectrum of pairs of isometries given by diagrams. In most cases both isometries in such pairs have non-trivial shift part and its Taylor spectrum is a proper subset (of Lebesgue measure in $(0,\pi^2)$)…

Spectral Theory · Mathematics 2024-11-01 Zbigniew Burdak , Patryk Pagacz

We prove almost Lipshitz continuity of spectra of singular quasiperiodic Jacobi matrices and obtain a representation of the critical almost Mathieu family that has a singularity. This allows us to prove that the Hausdorff dimension of its…

Spectral Theory · Mathematics 2019-09-11 Svetlana Jitomirskaya , Igor Krasovsky

We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected…

Combinatorics · Mathematics 2018-01-25 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

Combinatorics · Mathematics 2020-01-28 Lucas Mol , Matthew J. H. Murphy , Ortrud R. Oellermann

We apply thermodynamic formalism to a generalized horseshoe map. We prove that a tailored anisotropic Banach space with weighted norms yields a spectral gap for the transfer operator, implying the existence of a unique physical measure.…

Dynamical Systems · Mathematics 2026-01-06 Abbas Fakhari , Mohammad Soufi

We consider the Banach space consisting of real-valued continuous functions on an arbitrary compact metric space. It is known that for a prevalent (in the sense of Hunt, Sauer and Yorke) set of functions the Hausdorff dimension of the image…

Metric Geometry · Mathematics 2014-10-06 Jonathan M. Fraser , James T. Hyde

In this paper it is proved that there are constants 0< c_2< c_1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever n tends to infinity and 2 < d < n - c_1 (log n). A typical…

Combinatorics · Mathematics 2012-04-23 Zoltan Furedi , Younjin Kim

Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…

Combinatorics · Mathematics 2022-08-03 Briana Foster-Greenwood , Christine Uhl

A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y) < c d(x,z) for all x<y<z in X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It…

Classical Analysis and ODEs · Mathematics 2012-10-09 Ondřej Zindulka , Michael Hrušák , Tamás Mátrai , Aleš Nekvinda , Václav Vlasák

In this paper, we establish the asymptotic expansion at infinity of gradient graph in dimension 2 with vanishing mean curvature at infinity. This corresponds to our previous results in higher dimensions and generalizes the results for…

Analysis of PDEs · Mathematics 2022-02-14 Zixiao Liu , Jiguang Bao

We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…

Combinatorics · Mathematics 2024-03-11 Alain Hertz , Hadrien Mélot , Sébastien Bonte , Gauvain Devillez

Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…

Combinatorics · Mathematics 2022-11-23 Rameez Raja , Samir Ahmad Wagay