Search arXivSearch

arXiv · 2210.10720

Limits of action convergent graph sequences with unbounded $(p,q)$-norms

Abstract

The recently developed notion of action convergence by Backhausz and Szegedy unifies and generalises the dense (graphon) and local-global (graphing) convergences of graph sequences. This is done through viewing graphs as operators and examining their dynamical properties. Suppose $(A_n)_n^\infty$ is a sequence of operators representing graphs, Cauchy with respect to the action metric. If $(A_n)_n^\infty$ has uniformly bounded $(p,q)$-norms where $(p,q)$ is any pair in $[1,\infty)\times(1,\infty)$, then Backhausz and Szegedy prove that $(A_n)_n^\infty$ has a limit operator which, moreover, must be self-adjoint and positivity-preserving. In the present work, we construct a large class of graph sequences whose only uniformly bounded $(p,q)$-norm is the $(\infty,1)$-norm, but which converge nonetheless. We show that the limit operators in this case are not unique, not self-adjoint, and need not be positivity-preserving. In particular, in the action convergence language, this means that the space of graphops is not compact. By identifying these multiple limits, we also demonstrate that $c$-regularity is not invariant under weak equivalence, where $c$ is the eigenvalue of the identity function, when the identity function is an eigenfunction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aranka Hrušková. 2022-10-19. Limits of action convergent graph sequences with unbounded $(p,q)$-norms. https://arxiv.org/abs/2210.10720

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO