Multigraph limits, unbounded kernels, and Banach space decorated graphs
From MaRDI portal
Publication:2056409
Abstract: We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional analytic framework provides a universal language for various combinatorial limit notions. In particular it makes it possible to assign limit objects to multigraph sequences that are convergent in the sense of node-and-edge homomorphism numbers, and it generalizes the limit theory for graph sequences with compact decorations.
Recommendations
Cites work
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Graphons, cut norm and distance, couplings and rearrangements
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 47995 (Why is no real title available?)
- scientific article; zbMATH DE number 1857848 (Why is no real title available?)
- Limits of dense graph sequences
- Multigraph limits and exchangeability
- Quick approximation to matrices and applications
- Uniqueness of Banach space valued graphons
Cited in
(12)- Relating the cut distance and the weak* topology for graphons
- Uniqueness of Banach space valued graphons
- Action convergence of operators and graphs
- Preferential attachment processes approaching the Rado multigraph
- On the dense preferential attachment graph models and their graphon induced counterpart
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Subgraph densities in Markov spaces
- Multigraph limits and exchangeability
- Operator-valued Gaussian processes and their covariance kernels
- Central limit theorem for -independent products and higher-order tensors
- Probability-graphons: limits of large dense weighted graphs
- Graph limit for interacting particle systems on weighted random graphs
This page was built for publication: Multigraph limits, unbounded kernels, and Banach space decorated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056409)