Limits of dense graph sequences
From MaRDI portal
Publication:859618
DOI10.1016/j.jctb.2006.05.002zbMath1113.05092arXivmath/0408173OpenAlexW2082734581WikidataQ56503928 ScholiaQ56503928MaRDI QIDQ859618
Publication date: 16 January 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0408173
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
A problem of Erdős and Sós on 3-graphs, Finitely forcible graph limits are universal, A characterization of functions with vanishing averages over products of disjoint sets, Identification of the diffusion parameter in nonlocal steady diffusion problems, Compactness by Coarse-Graining in long-range lattice systems, Dynamic random networks and their graph limits, The mean field analysis of the Kuramoto model on graphs. I: The mean field equation and transition point formulas, Convergence and stability of generalized gradient systems by Łojasiewicz inequality with application in continuum Kuramoto model, The step Sidorenko property and non-norming edge-transitive graphs, The local limit of the uniform spanning tree on dense graphs, A detailed investigation into near degenerate exponential random graphs, The fractional Laplacian operator on bounded domains as a special case of the nonlocal diffusion operator, Structural limits and approximations of mappings, Uniform linear embeddings of spatial random graphs, First order convergence of matroids, Densities in large permutations and parameter testing, Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models, Consensus and voting on large graphs: an application of graph limit theory, Consistency under sampling of exponential random graph models, A continuous model for systems of complexity 2 on simple abelian groups, Maximum likelihood estimation in the \(\beta\)-model, Pentagons in triangle-free graphs, Testing properties of graphs and functions, Phase transitions in exponential random graphs, Parabolic theory of the discrete \(p\)-Laplace operator, Spectral classes of regular, random, and empirical graphs, Independence densities of hypergraphs, From quasirandom graphs to graph limits and graphlets, SVD, discrepancy, and regular structure of contingency tables, First steps in combinatorial optimization on graphons: matchings, Extremal graph theory and finite forcibility, Invariant measures via inverse limits of finite structures, Graph limits and hereditary properties, First-order limits, an analytical perspective, Compact orbit spaces in Hilbert spaces and limits of edge-colouring models, Asymptotic symmetries for fractional operators, Stability of twisted states in the Kuramoto model on Cayley and random graphs, Multigraph limits and exchangeability, Testability of minimum balanced multiway cut densities, Recurrence of planar graph limits, Interval graph limits, Random graphs with a given degree sequence, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, A new lower bound based on Gromov's method of selecting heavily covered points, Multigraph limit of the dense configuration model and the preferential attachment graph, A measure-theoretic approach to the theory of dense hypergraphs, Limits of randomly grown graph sequences, The large deviation principle for the Erdős-Rényi random graph, Quasi-random graphs and graph limits, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, Limits of kernel operators and the spectral regularity lemma, The inducibility of blow-up graphs, Limits of Boolean functions on \(\mathbb{F}_p^n\), On possible Turán densities, Right-convergence of sparse random graphs, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, The automorphism group of a graphon, Positivstellensätze for quantum multigraphs, Edge-reflection positivity and weighted graph homomorphisms, Finitely forcible graphons and permutons, An equation-free approach to coarse-graining the dynamics of networks, Analysis and approximation of a fractional Laplacian-based closure model for turbulent flows and its connection to Richardson pair dispersion, Bethe states of random factor graphs, On the maximum density of fixed strongly connected subtournaments, Asymptotic structure and singularities in constrained directed graphs, On trees invariant under edge contraction, On limits of finite graphs, Chromatic roots and limits of dense graphs, A large deviation principle for the Erdős-Rényi uniform random graph, Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, Ensemble equivalence for dense graphs, Combinatorial Lévy processes, Limits of \(k\)-dimensional poset sequences, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, Model-based clustering of multiple networks with a hierarchical algorithm, The role of topology in large deviations, Sparse maximum-entropy random graphs with a given power-law degree distribution, Dual graph homomorphism functions, Testing permutation properties through subpermutations, Limits of structures and the example of tree semi-lattices, An analytic approach to stability, The Kuramoto model on power law graphs: synchronization and contrast states, Generalizations of the removal lemma, Uniform linear embeddings of graphons, A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems, Convex graphon parameters and graph norms, Graph invariants in the spin model, Flows on measurable spaces, Mixed Membership Estimation for Social Networks, Characterizing partition functions of the spin model by rank growth, On the typical structure of graphs in a monotone property, Mean-field and graph limits for collective dynamics models with time-varying weights, Rate-optimal graphon estimation, Large deviations of empirical neighborhood distribution in sparse random graphs, Consistent nonparametric estimation for heavy-tailed sparse graphs, Multigraph limits, unbounded kernels, and Banach space decorated graphs, Limits of sparse configuration models and beyond: graphexes and multigraphexes, An infinite-dimensional metapopulation SIS model, Higher-order fluctuations in dense random graph models, Cycles of length three and four in tournaments, Perfect matchings, rank of connection tensors and graph homomorphisms, Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics, Sparse Monte Carlo Method for Nonlocal Diffusion Problems, A PROBABILISTIC FRIENDSHIP NETWORK MODEL, Graphons and renormalization of large Feynman diagrams, The phase transition in inhomogeneous random graphs, On replica symmetry of large deviations in random graphs, Hypergraph limits: A regularity approach, Edge Exchangeable Models for Interaction Networks, RELATIVELY EXCHANGEABLE STRUCTURES, Spectral properties for the Laplacian of a generalized Wigner matrix, Graphical Markov models for infinitely many variables, Limits of functions on groups, Modularity Maximization for Graphons, Locally common graphs, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, Maximum spread of graphs and bipartite graphs, Graph limits: An alternative approach to s‐graphons, Upper tail of the spectral radius of sparse Erdös-Rényi graphs, Upper Tails for Edge Eigenvalues of Random Graphs, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, A Rainbow Erdös--Rothschild Problem, Γ-limit of the cut functional on dense graph sequences, Continuum Limits of Nonlocal $p$-Laplacian Variational Problems on Graphs, Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs, Unnamed Item, Sparse Graphs Using Exchangeable Random Measures, Convergence of graphs with intermediate density, First-Order Convergence and Roots, Asymptotic Structure of Graphs with the Minimum Number of Triangles, On the Lower Tail Variational Problem for Random Graphs, Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research), Finitely forcible graphons with an almost arbitrary structure, An Optimization Parameter for Seriation of Noisy Data, Regularity lemmas in a Banach space setting, On the graph limit question of Vera T. Sós, Semantic limits of dense combinatorial objects, Identifiability for Graphexes and the Weak Kernel Metric, Undecidability of linear inequalities in graph homomorphism densities, On the graph limit question of Vera T. Sós, Sparse random graphs with clustering, Positive graphs, Determination of the reaction coefficient in a time dependent nonlocal diffusion process, Non-Deterministic Graph Property Testing, Nonlocal $p$-Laplacian Evolution Problems on Graphs, Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices, The Mean Field Equation for the Kuramoto Model on Graph Sequences with Non-Lipschitz Limit, An analytic approach to sparse hypergraphs: hypergraph removal, Unnamed Item, Unnamed Item, Sparse exchangeable graphs and their limits via graphon processes, Community Detection and Stochastic Block Models, Random Walks on Dense Graphs and Graphons, The Inducibility of Graphs on Four Vertices, Counting flags in triangle-free digraphs, A New Bound for the 2/3 Conjecture, The number of graphs and a random graph with a given degree sequence, A note on permutation regularity, On the variational problem for upper tails in sparse random graphs, INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES, Maximum likelihood estimation for discrete exponential families and random graphs, Edge coloring models and reflection positivity, Continuum limits for classical sequential growth models, Parameter testing in bounded degree graphs of subexponential growth, Resolvent of large random graphs, Bifurcations in the Kuramoto model on graphs, Testability and repair of hereditary hypergraph properties, On the asymptotics of constrained exponential random graphs, Contractors and connectors of graph algebras, A note on permutation regularity, Sparse graphs: Metrics and random models, A hypergraph regularity method for generalized Turán problems, The cut metric, random graphs, and branching processes, Graph norms and Sidorenko's conjecture, Quasi-random words and limits of word sequences, Popular differences for corners in Abelian groups, Relational exchangeability, Asymptotic Structure for the Clique Density Theorem, Dynamics and control for multi-agent networked systems: A finite-difference approach, EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES, Minimizing the number of 5-cycles in graphs with given edge-density, Goodness of Fit of Logistic Regression Models for Random Graphs, First order limits of sparse graphs: Plane trees and path-width, Local-global convergence, an analytic and structural approach, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Generating Infinite Random Graphs, Power Network Dynamics on Graphons, Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs, Weak regularity and finitely forcible graph limits, The Cut Metric for Probability Distributions, Poset limits can be totally ordered, Using the bootstrap for statistical inference on random graphs, Harmonic analysis of symmetric random graphs, Graphon Mean Field Games and Their Equations, Limiting Crossing Numbers for Geodesic Drawings on the Sphere, Ground states for exponential random graphs, Graphop Mean-Field Limits for Kuramoto-Type Models, Why Are Big Data Matrices Approximately Low Rank?, Action convergence of operators and graphs, Cut distance identifying graphon parameters over weak* limits, A note on Fokker-Planck equations and graphons, Finite reflection groups and graph norms, Exchangeable graph-valued Feller processes, Books Versus triangles, Random graphons and a weak Positivstellensatz for graphs, Motif-based tests for bipartite networks, Reconstruction of line-embeddings of graphons, Modeling limits in hereditary classes: reduction and application to trees, Quasirandom permutations are characterized by 4-point densities, Moments of two-variable functions and the uniqueness of graph limits, Non-bipartite \(k\)-common graphs, Cut norm discontinuity of triangular truncation of graphons, Asymptotic behavior of common connections in sparse random networks, Generating hierarchial scale-free graphs from fractals, Connectivity of inhomogeneous random graphs, A noncommutative approach to the graphon Fourier transform, Multivariate Hawkes processes on inhomogeneous random graphs, Limits of mappings, Upper tails and independence polynomials in random graphs, A graphon counter example, Decomposition of tournament limits, Multipodal structure and phase transitions in large constrained graphs, Asymptotic dynamics of non-autonomous fractional reaction-diffusion equations on bounded domains, Uniqueness of Banach space valued graphons, Local 2-separators, Concentration function for pyramid and quantum metric measure space, σ-algebras for quasirandom hypergraphs, Transferability of graph neural networks: an extended graphon approach, On a question of Vera T. Sós about size forcing of graphons, Convergence and limits of finite trees, Independent sets, cliques, and colorings in graphons, Poisson approximation of subgraph counts in stochastic block models and a graphon model, Thresholds for virus spread on networks, Poset limits and exchangeable random posets, Singular value distribution of dense random matrices with block Markovian dependence, Phase transitions in finite random networks, Graph theory. Abstracts from the workshop held January 2--8, 2022, Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022, Posterior contraction rates for stochastic block models, Asymptotic behavior and distributional limits of preferential attachment graphs, Estimating and understanding exponential random graph models, Critical phenomena in exponential random graphs, On String Graph Limits and the Structure of a Typical String Graph, Limit of a nonpreferential attachment multitype network model, A survey of discrete methods in (algebraic) statistics for networks, A general framework for Bayes structured linear models, Extremal results in sparse pseudorandom graphs, Small-world networks of Kuramoto oscillators, Simple graph density inequalities with no sum of squares proofs, Relating the cut distance and the weak* topology for graphons, Limits of locally-globally convergent graph sequences, The nonlinear heat equation on \(W\)-random graphs, Tilings in graphons, Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph, Quenched asymptotics for interacting diffusions on inhomogeneous random graphs, Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality, Generalized quasirandom graphs, Graphon-valued stochastic processes from population genetics, More on quasi-random graphs, subgraph counts and graph limits, Percolation on dense graph sequences, Finitely forcible graphons, Matching polytons, Cliques in rank-1 random graphs: the role of inhomogeneity, Sampling perspectives on sparse exchangeable graphs, Bayesian modeling of the structural connectome for studying Alzheimer's disease, On the number of \(B\)-flows of a graph, On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem, Time-varying network models, A discrete districting plan, An introduction to large deviations for random graphs, Reduced basis methods for nonlocal diffusion problems with random input data, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Measures on the square as sparse graph limits, Optimal graphon estimation in cut distance, Dynamic network models and graphon estimation, Contractors for flows, A note on random k-dimensional posets, The Entropy of Random-Free Graphons and Properties, Remarks on power-law random graphs, Compactness and finite forcibility of graphons, On the length of the shortest path in a sparse Barak-Erdős graph, Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations, Vlasov equations on digraph measures, Berry-Esseen bounds for generalized \(U\)-statistics, On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs, Emergent Structures in Large Networks, Limit theorems for distributions invariant under groups of transformations, Random graph asymptotics for treatment effect estimation under network interference, A conversation with David J. Aldous, Fractional isomorphism of graphons, Matrix estimation by universal singular value thresholding, Limits of random trees. II, Singularities in the entropy of asymptotically large simple graphs, Linear embeddings of graphs and graph limits, Differential calculus on graphon space, The large deviation principle for interacting dynamical systems on random graphs, A relative Szemerédi theorem, Complete positivity and distance-avoiding sets, Two remarks on graph norms, Graphon convergence of random cographs, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, Natural quasirandomness properties, Toward characterizing locally common graphs, A limit theorem for small cliques in inhomogeneous random graphs, Fluctuations of subgraph counts in graphon based random graphs, Stability from graph symmetrisation arguments with applications to inducibility, Limits of multi-relational graphs, Pattern Formation in Random Networks Using Graphons, Approximating fractionally isomorphic graphons, Monotone subsequences in locally uniform random permutations, Weisfeiler-Leman indistinguishability of graphons, Optimal investment in a large population of competitive and heterogeneous agents, On graph norms for complex‐valued functions, Long-term stability of interacting Hawkes processes on random graphs, Graph sequences sampled from Robinson graphons, Consensus formation in first-order graphon models with time-varying topologies, Typical large graphs with given edge and triangle densities, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, A sample-path large deviation principle for dynamic Erdős-Rényi random graphs, Propagation of chaos of forward-backward stochastic differential equations with graphon interactions, Existence of a symmetric bipodal phase in the edge-triangle model, On sparsity, power-law, and clustering properties of graphex processes, Restricted problems in extremal combinatorics, Prominent examples of flip processes
Cites Work
