Action convergence of operators and graphs

DOI10.4153/S0008414X2000070XMaRDI QIDQ5029489zbMATH OpenOpenAlexFDO

Authors Balázs Szegedy, Ágnes Backhausz

Publication date 14 February 2022

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1811.00626

zbMATH Keywords

graph limitsoperatorrandom matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52)

Abstract: We present a new approach to graph limit theory which unifies and generalizes the two most well developed directions, namely dense graph limits (even the more general $L^p$ limits) and Benjamini--Schramm limits (even in the stronger local-global setting). We illustrate by examples that this new framework provides a rich limit theory with natural limit objects for graphs of intermediate density. Moreover, it provides a limit theory for bounded operators (called $P$-operators) of the form $L^{i}nfty(Omega)o{L}^1(Omega)$ for probability spaces $Omega$. We introduce a metric to compare $P$-operators (for example finite matrices) even if they act on different spaces. We prove a compactness result which implies that in appropriate norms, limits of uniformly bounded $P$-operators can again be represented by $P$-operators. We show that limits of operators representing graphs are self-adjoint, positivity-preserving $P$-operators called graphops. Graphons, $L^p$ graphons and graphings (known from graph limit theory) are special examples for graphops. We describe a new point of view on random matrix theory using our operator limit framework.

Recommendations

• An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
• First-order limits, an analytical perspective
• Convergence of graphs with intermediate density
• A model theory approach to structural limits.
• Interval graph limits

Cites work

• A graphon approach to limiting spectral distributions of Wigner-type matrices
• A limit theorem for the norm of random matrices
• An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Convergence of graphs with intermediate density
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Ergodic theory on stationary random graphs
• scientific article; zbMATH DE number 5501718 (Why is no real title available?)
• scientific article; zbMATH DE number 45813 (Why is no real title available?)
• scientific article; zbMATH DE number 1064477 (Why is no real title available?)
• Large networks and graph limits
• Limits of dense graph sequences
• Limits of locally-globally convergent graph sequences
• Local-global convergence, an analytic and structural approach
• Measures on the square as sparse graph limits
• Moments of two-variable functions and the uniqueness of graph limits
• Multigraph limits, unbounded kernels, and Banach space decorated graphs
• On large‐girth regular graphs and random processes on trees
• On the almost eigenvectors of random regular graphs
• On the limit of large girth graph sequences
• Probability on trees and networks
• Random trees and general branching processes
• Recurrence of distributional limits of finite planar graphs
• Sofic groups and direct finiteness.
• Sparse exchangeable graphs and their limits via graphon processes
• Sparse graphs: metrics and random models
• Sparsity. Graphs, structures, and algorithms
• Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
• Szemerédi's lemma for the analyst

Cited in

(22)

• A random graph of moderate density
• Vlasov equations on digraph measures
• Multi-population phase oscillator networks with higher-order interactions
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• A free boundary problem-in time-for the spread of Covid-19
• Convergence theorems for graph sequences
• Adaptive dynamical networks
• Subgraph densities in Markov spaces
• Limits of kernel operators and the spectral regularity lemma
• First-order like phase transition induced by quenched coupling disorder
• Graphop mean-field limits and synchronization for the stochastic Kuramoto model
• Propagation reversal on trees in the large diffusion regime
• Evolution equations on co-evolving graphs: long-time behaviour and the graph-continuity equation
• Mean-field limits for stochastic interacting particles via digraph measures
• The ineffectiveness of the regularity lemma for bounded degree graphs
• Generalization bounds for message passing networks on mixture of graphons
• Dynamical systems on graph limits and their symmetries
• A compactification of the set of sequences of positive real numbers with applications to limits of graphs (extended abstract)
• Vlasov equations on directed hypergraph measures
• Mean field limits of co-evolutionary signed heterogeneous networks
• Global stability for McKean-Vlasov equations on large networks
• The shortest-path distance on graphons

This page was built for publication: Action convergence of operators and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5029489)