Graphons, cut norm and distance, couplings and rearrangements
From MaRDI portal
Publication:5301146
zbMath1268.05001arXiv1009.2376MaRDI QIDQ5301146
Publication date: 2 July 2013
Full work available at URL: https://arxiv.org/abs/1009.2376
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
28A20: Measurable and nonmeasurable functions, sequences of measurable functions, modes of convergence
05C99: Graph theory
Related Items
Graphons and renormalization of large Feynman diagrams, Sparse exchangeable graphs and their limits via graphon processes, The Cut Metric for Probability Distributions, Graphop Mean-Field Limits for Kuramoto-Type Models, Symmetric Measures, Continuous Networks, and Dynamics, Random Simplicial Complexes: Models and Phenomena, Stochastic Graphon Games: I. The Static Case, Asymptotic Analysis of a Matrix Latent Decomposition Model, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Γ-limit of the cut functional on dense graph sequences, Random Walks on Dense Graphs and Graphons, Influence in product spaces, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Regularity lemmas in a Banach space setting, Complexity of distances: Theory of generalized analytic equivalence relations, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], Generalizing Körner's graph entropy to graphons, New Hilbert space tools for analysis of graph Laplacians and Markov processes, Pattern Formation in Random Networks Using Graphons, Weisfeiler-Leman indistinguishability of graphons, Graph polynomials associated with Dyson-Schwinger equations, A sample-path large deviation principle for dynamic Erdős-Rényi random graphs, Kontsevich Graphons, From Dyson-Schwinger equations to quantum entanglement, A classification of orbits admitting a unique invariant measure, Asymptotic structure and singularities in constrained directed graphs, Invariant measures via inverse limits of finite structures, Graph limits and hereditary properties, On edge exchangeable random graphs, Bethe states of random factor graphs, Sparse maximum-entropy random graphs with a given power-law degree distribution, Interval graph limits, Spin systems on Bethe lattices, The analytic evolution of Dyson-Schwinger equations via homomorphism densities, Consistent nonparametric estimation for heavy-tailed sparse graphs, Multigraph limits, unbounded kernels, and Banach space decorated graphs, Uniform estimation in stochastic block models is slow, On convergence for graphexes, Multivariate Hawkes processes on inhomogeneous random graphs, Non-perturbative graph languages, halting problem and complexity, A graphon counter example, The dynamics of non-perturbative phases via Banach bundles, The complexities of nonperturbative computations, Optimal graphon estimation in cut distance, Limits of discrete distributions and Gibbs measures on random graphs, A measure theoretic perspective on the space of Feynman diagrams, Transferability of graph neural networks: an extended graphon approach, Identifiability for Graphexes and the Weak Kernel Metric
