Pages that link to "Item:Q5301146"
From MaRDI portal
The following pages link to Graphons, cut norm and distance, couplings and rearrangements (Q5301146):
Displaying 48 items.
- A classification of orbits admitting a unique invariant measure (Q331039) (← links)
- Asymptotic structure and singularities in constrained directed graphs (Q491183) (← links)
- Invariant measures via inverse limits of finite structures (Q896078) (← links)
- Graph limits and hereditary properties (Q896080) (← links)
- On edge exchangeable random graphs (Q1633959) (← links)
- Bethe states of random factor graphs (Q1733816) (← links)
- Sparse maximum-entropy random graphs with a given power-law degree distribution (Q1756545) (← links)
- Interval graph limits (Q1950423) (← links)
- Spin systems on Bethe lattices (Q2008960) (← links)
- The analytic evolution of Dyson-Schwinger equations via homomorphism densities (Q2046710) (← links)
- Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
- Multigraph limits, unbounded kernels, and Banach space decorated graphs (Q2056409) (← links)
- Uniform estimation in stochastic block models is slow (Q2137819) (← links)
- On convergence for graphexes (Q2143415) (← links)
- Multivariate Hawkes processes on inhomogeneous random graphs (Q2169066) (← links)
- Non-perturbative graph languages, halting problem and complexity (Q2171907) (← links)
- A graphon counter example (Q2174580) (← links)
- The dynamics of non-perturbative phases via Banach bundles (Q2233776) (← links)
- The complexities of nonperturbative computations (Q2239363) (← links)
- Optimal graphon estimation in cut distance (Q2312687) (← links)
- Limits of discrete distributions and Gibbs measures on random graphs (Q2403690) (← links)
- A measure theoretic perspective on the space of Feynman diagrams (Q2419433) (← links)
- Transferability of graph neural networks: an extended graphon approach (Q2677834) (← links)
- Identifiability for Graphexes and the Weak Kernel Metric (Q3295264) (← links)
- Graphons and renormalization of large Feynman diagrams (Q4554824) (← links)
- Sparse exchangeable graphs and their limits via graphon processes (Q4558542) (← links)
- The Cut Metric for Probability Distributions (Q4992835) (← links)
- Graphop Mean-Field Limits for Kuramoto-Type Models (Q5024520) (← links)
- Symmetric Measures, Continuous Networks, and Dynamics (Q5048618) (← links)
- Random Simplicial Complexes: Models and Phenomena (Q5053660) (← links)
- Stochastic Graphon Games: I. The Static Case (Q5076723) (← links)
- Asymptotic Analysis of a Matrix Latent Decomposition Model (Q5079514) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Γ-limit of the cut functional on dense graph sequences (Q5109198) (← links)
- Random Walks on Dense Graphs and Graphons (Q5164714) (← links)
- Influence in product spaces (Q5197400) (← links)
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (Q5227976) (← links)
- Complexity of distances: Theory of generalized analytic equivalence relations (Q5888304) (← links)
- Regularity lemmas in a Banach space setting (Q5890899) (← links)
- Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers (Q6047968) (← links)
- Generalizing Körner's graph entropy to graphons (Q6080368) (← links)
- New Hilbert space tools for analysis of graph Laplacians and Markov processes (Q6081653) (← links)
- Pattern Formation in Random Networks Using Graphons (Q6106290) (← links)
- Weisfeiler-Leman indistinguishability of graphons (Q6117254) (← links)
- Graph polynomials associated with Dyson-Schwinger equations (Q6153405) (← links)
- A sample-path large deviation principle for dynamic Erdős-Rényi random graphs (Q6165256) (← links)
- Kontsevich Graphons (Q6166503) (← links)
- From Dyson-Schwinger equations to quantum entanglement (Q6188010) (← links)