The following pages link to Limits of dense graph sequences (Q859618):
Displayed 50 items.
- Dynamics and control for multi-agent networked systems: A finite-difference approach (Q4972953) (← links)
- First order limits of sparse graphs: Plane trees and path-width (Q4978432) (← links)
- The Cut Metric for Probability Distributions (Q4992835) (← links)
- (Q5002626) (← links)
- Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices (Q5009509) (← links)
- Graphon Mean Field Games and Their Equations (Q5013560) (← links)
- Limiting Crossing Numbers for Geodesic Drawings on the Sphere (Q5014128) (← links)
- Graphop Mean-Field Limits for Kuramoto-Type Models (Q5024520) (← links)
- Why Are Big Data Matrices Approximately Low Rank? (Q5025778) (← links)
- Action convergence of operators and graphs (Q5029489) (← links)
- Sparse Monte Carlo Method for Nonlocal Diffusion Problems (Q5048296) (← links)
- A PROBABILISTIC FRIENDSHIP NETWORK MODEL (Q5051152) (← links)
- (Q5053171) (← links)
- (Q5053307) (← links)
- Spectral properties for the Laplacian of a generalized Wigner matrix (Q5092960) (← links)
- Maximum likelihood estimation for discrete exponential families and random graphs (Q5101306) (← links)
- Upper Tails for Edge Eigenvalues of Random Graphs (Q5107095) (← 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)
- Continuum Limits of Nonlocal $p$-Laplacian Variational Problems on Graphs (Q5109272) (← links)
- Continuum limit of the nonlocal <i>p</i>-Laplacian evolution problem on random inhomogeneous graphs (Q5110273) (← links)
- Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) (Q5118665) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- Semantic limits of dense combinatorial objects (Q5138464) (← links)
- Asymptotic Structure for the Clique Density Theorem (Q5144435) (← links)
- Determination of the reaction coefficient in a time dependent nonlocal diffusion process (Q5148431) (← links)
- Random Walks on Dense Graphs and Graphons (Q5164714) (← links)
- Sparse graphs: Metrics and random models (Q5198669) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- Minimizing the number of 5-cycles in graphs with given edge-density (Q5222570) (← links)
- Local-global convergence, an analytic and structural approach (Q5227148) (← links)
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (Q5227976) (← links)
- Generating Infinite Random Graphs (Q5228177) (← links)
- Power Network Dynamics on Graphons (Q5231218) (← links)
- Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs (Q5234663) (← links)
- Poset limits can be totally ordered (Q5247001) (← links)
- The phase transition in inhomogeneous random graphs (Q5310264) (← links)
- First-Order Convergence and Roots (Q5366887) (← links)
- Asymptotic Structure of Graphs with the Minimum Number of Triangles (Q5366929) (← links)
- On the Lower Tail Variational Problem for Random Graphs (Q5366946) (← links)
- An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
- Undecidability of linear inequalities in graph homomorphism densities (Q5390541) (← links)
- Non-Deterministic Graph Property Testing (Q5397730) (← links)
- The Inducibility of Graphs on Four Vertices (Q5417819) (← links)
- Using the bootstrap for statistical inference on random graphs (Q5507344) (← links)
- On the variational problem for upper tails in sparse random graphs (Q5739097) (← links)
- INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES (Q5739903) (← links)
- Harmonic analysis of symmetric random graphs (Q5858551) (← links)
- Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)
- Regularity lemmas in a Banach space setting (Q5890899) (← links)