First-Order Convergence and Roots
From MaRDI portal
Publication:5366887
Abstract: Nesetril and Ossona de Mendez introduced the notion of first order convergence, which unifies the notions of convergence for sparse and dense graphs. They asked whether if G_i is a sequence of graphs with M being their first order limit and v is a vertex of M, then there exists a sequence v_i of vertices such that the graphs G_i rooted at v_i converge to M rooted at v. We show that this holds for almost all vertices v of M and we give an example showing that the statement need not hold for all vertices.
Recommendations
- Convergence results for solutions of a first-order differential equation
- The radius of convergence function for first order differential equations
- Continuity of iteration and approximation of iterative roots
- scientific article; zbMATH DE number 1076421
- scientific article; zbMATH DE number 4048987
- scientific article; zbMATH DE number 724721
- Convergence of first-order methods via the convex conjugate
- scientific article; zbMATH DE number 16661
- scientific article; zbMATH DE number 1179336
- Convergence of solutions of a second order Cauchy problem
Cites work
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- A model theory approach to structural limits.
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Graph limits and parameter testing
- Large networks and graph limits
- Limits of dense graph sequences
- Limits of locally-globally convergent graph sequences
- On limits of finite graphs
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Testing properties of graphs and functions
Cited in
(3)
This page was built for publication: First-Order Convergence and Roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366887)