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 (An)n∞ is a sequence of operators representing graphs, Cauchy with respect to the action metric. If (An)n∞ has uniformly bounded (p,q)-norms where (p,q) is any pair in [1,∞)×(1,∞), then Backhausz and Szegedy prove that (An)n∞ 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 (∞,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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…