scientific article; zbMATH DE number 6122804

Publication date: 8 January 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

networks random graphs graph homomorphism infinite graphs sparse graphs graph sequences graph limits dense graphs large graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63) Density (toughness, etc.) (05C42)

Related Items

The skew Brownian permuton: A new universality class for random constrained permutations, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Gap sets for the spectra of cubic graphs, Natural quasirandomness properties, Toward characterizing locally common graphs, Monotone arithmetic complexity of graph homomorphism polynomials, Generalizing Körner's graph entropy to graphons, A limit theorem for small cliques in inhomogeneous random graphs, New Hilbert space tools for analysis of graph Laplacians and Markov processes, Distance distributions and inverse problems for metric measure spaces, Fluctuations of subgraph counts in graphon based random graphs, Stability from graph symmetrisation arguments with applications to inducibility, Limits of multi-relational graphs, The number of \(n\)-queens configurations, Fluctuations in mean-field Ising models, Pattern Formation in Random Networks Using Graphons, Hypothesis testing for populations of networks, Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits, On the chromatic number in the stochastic block model, Approximating fractionally isomorphic graphons, Faster Property Testers in a Variation of the Bounded Degree Model, Weisfeiler-Leman indistinguishability of graphons, A full characterization of invariant embeddability of unimodular planar graphs, Optimal investment in a large population of competitive and heterogeneous agents, Undecidability of polynomial inequalities in weighted graph homomorphism densities, On graph norms for complex‐valued functions, The Khinchin-Kahane and Lévy inequalities for abelian metric groups, and transfer from normed (abelian semi)groups to Banach spaces, Graphon mean-field control for cooperative multi-agent reinforcement learning, Inference in Ising models on dense regular graphs, Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime, Functions tiling simultaneously with two arithmetic progressions, A Property on Monochromatic Copies of Graphs Containing a Triangle, Large population limits of Markov processes on random networks, A Spectral-Based Framework for Hypothesis Testing in Populations of Networks, Graph sequences sampled from Robinson graphons, Entropic Optimal Transport on Random Graphs, Random geometric graph: some recent developments and perspectives, Graph polynomials associated with Dyson-Schwinger equations, Consensus formation in first-order graphon models with time-varying topologies, Parameterized Counting and Cayley Graph Expanders, Typical large graphs with given edge and triangle densities, The large deviation principle for inhomogeneous Erdős-Rényi random graphs, 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, Kontsevich Graphons, Localization in 1D non-parametric latent space models from pairwise affinities, Common graphs with arbitrary connectivity and chromatic number, Continuum limits of coupled oscillator networks depending on multiple sparse graphs, Contagion in graphons, Distances and isomorphism between networks: stability and convergence of network invariants, Subgraph densities in Markov spaces, Graphon mean field systems, The regularity of almost all edge ideals, Graph Limits and Spectral Extremal Problems for Graphs, Existence of a symmetric bipodal phase in the edge-triangle model, Extended commonality of paths and cycles via Schur convexity, Restricted problems in extremal combinatorics, Local-vs-global combinatorics, Non-representative sampled networks: estimation of network structural properties by weighting, Kernel density estimation for undirected dyadic data, Prominent examples of flip processes, Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons, Cut distance identifying graphon parameters over weak* limits, A note on Fokker-Planck equations and graphons, eGHWT: the extended generalized Haar-Walsh transform, Finite state graphon games with applications to epidemics, Motif estimation via subgraph sampling: the fourth-moment phenomenon, An extremal problem motivated by triangle-free strongly regular graphs, Local-density dependent Markov processes on graphons with epidemiological applications, Rare event asymptotics for exploration processes for random graphs, Approximate Schreier decorations and approximate Kőnig's line coloring theorem, Reconstruction of line-embeddings of graphons, Markov random geometric graph, MRGG: a growth model for temporal dynamic networks, Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator, Dimension reduction in vertex-weighted exponential random graphs, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, On convergence for graphexes, Stationarity and uniform in time convergence for the graphon particle system, Non-bipartite \(k\)-common graphs, Cut norm discontinuity of triangular truncation of graphons, A noncommutative approach to the graphon Fourier transform, Multivariate Hawkes processes on inhomogeneous random graphs, Large deviation for uniform graphs with given degrees, On the minimal sum of edges in a signed edge-dominated graph, A graphon counter example, Estimating the number of connected components in a graph via subgraph sampling, Averages of unlabeled networks: geometric characterization and asymptotic behavior, Complexity of correspondence \(H\)-colourings, Independent sets, cliques, and colorings in graphons, Joint estimation of parameters in Ising model, Normal approximations for discrete-time occupancy processes, Large deviations of subgraph counts for sparse Erdős-Rényi graphs, Phase transitions in finite random networks, A general framework for Bayes structured linear models, Differential calculus on the space of countable labelled graphs, Hyperfinite graphings and combinatorial optimization, Simple graph density inequalities with no sum of squares proofs, Relating the cut distance and the weak* topology for graphons, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Tilings in graphons, Weakly norming graphs are edge-transitive, Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph, Inequalities for doubly nonnegative functions, The dynamics of non-perturbative phases via Banach bundles, Local WL invariance and hidden shades of regularity, The complexities of nonperturbative computations, Asymptotic distribution of Bernoulli quadratic forms, Graphon-valued stochastic processes from population genetics, Maximum likelihood estimation of sparse networks with missing observations, More on quasi-random graphs, subgraph counts and graph limits, A fixed-parameter perspective on \#BIS, Matching polytons, Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces, One-ended spanning trees in amenable unimodular graphs, Sampling perspectives on sparse exchangeable graphs, Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\), The geometry of continuous latent space models for network data, The analytic evolution of Dyson-Schwinger equations via homomorphism densities, A discrete districting plan, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Optimal graphon estimation in cut distance, Dynamic network models and graphon estimation, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Estimation of dense stochastic block models visited by random walks, An infinite-dimensional metapopulation SIS model, Counting edge-injective homomorphisms and matchings on restricted graph classes, The complexity of counting \(\mathrm{CSP}^d\), Monochromatic subgraphs in randomly colored graphons, Higher-order fluctuations in dense random graph models, Invariant Schreier decorations of unimodular random networks, A random graph of moderate density, 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, Typicality and entropy of processes on infinite trees, Power domination throttling, Vlasov equations on digraph measures, Berry-Esseen bounds for generalized \(U\)-statistics, Approximating the rectilinear crossing number, On the Hilbert evolution algebras of a graph, Families of nested graphs with compatible symmetric-group actions, Ramsey numbers of books and quasirandomness, Fractional isomorphism of graphons, Matrix estimation by universal singular value thresholding, Central measures of continuous graded graphs: the case of distinct frequencies, Cycles of a given length in tournaments, Singularities in the entropy of asymptotically large simple graphs, Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs, Sharp local minimax rates for goodness-of-fit testing in multivariate binomial and Poisson families and in multinomials, Discrete density comonads and graph parameters, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Linear embeddings of graphs and graph limits, Differential calculus on graphon space, Characteristic power series of graph limits, No additional tournaments are quasirandom-forcing, Continuity of some non-local functionals with respect to a convergence of the underlying measures, Spectral zeta function on discrete tori and Epstein-Riemann hypothesis, The large deviation principle for interacting dynamical systems on random graphs, Spectral distances on graphs, Ample simplicial complexes, Chimeras unfolded, Two remarks on graph norms, Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures, A counterexample to the Bollobás–Riordan conjectures on sparse graph limits, Tree limits and limits of random trees, Perfect matchings, rank of connection tensors and graph homomorphisms, On the edit distance function of the random graph, Subgraph densities in a surface, On tripartite common graphs, Complexity of distances: Theory of generalized analytic equivalence relations, Counting Subgraphs in Degenerate Graphs, Linear-sized independent sets in random cographs and increasing subsequences in separable permutations, Random Simplicial Complexes: Models and Phenomena, Interview with Yufei Zhao, Robust mean field social control problems with applications in analysis of opinion dynamics, Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming, Iterative Collaborative Filtering for Sparse Matrix Estimation, Harmonic analysis on graphs via Bratteli diagrams and path-space measures, Testing for Equivalence of Network Distribution Using Subgraph Counts, Exchangeable and sampling-consistent distributions on rooted binary trees, Counting Small Induced Subgraphs Satisfying Monotone Properties, Stochastic Graphon Games: I. The Static Case, Asymptotic Analysis of a Matrix Latent Decomposition Model, A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes, Graphons arising from graphs definable over finite fields, Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle, Spectral properties for the Laplacian of a generalized Wigner matrix, Tropicalization of graph profiles, Modularity Maximization for Graphons, A statistical mechanical model for non-perturbative regimes, Locally common graphs, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], Continuum limit of p-Laplacian evolution problems on graphs: L^q graphons and sparse graphs, Testing linear inequalities of subgraph statistics, Adaptive dynamical networks, Counting Homomorphic Cycles in Degenerate Graphs, Factor-of-iid balanced orientation of non-amenable graphs, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, Concentration estimates for functions of finite high‐dimensional random arrays, From art and circuit design to geometry and combinatorics, Upper tail of the spectral radius of sparse Erdös-Rényi graphs, Quasirandom-Forcing Orientations of Cycles, Graphon convergence of random cographs, Random cographs: Brownian graphon limit and asymptotic degree distribution, A unified view of graph regularity via matrix decompositions, Upper Tails for Edge Eigenvalues of Random Graphs, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Γ-limit of the cut functional on dense graph sequences, Local Convergence and Stability of Tight Bridge-addable Classes, Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs, Subgaussianity is hereditarily determined, First-Order Convergence and Roots, Asymptotic Structure of Graphs with the Minimum Number of Triangles, On the Lower Tail Variational Problem for Random Graphs, On the Number of 4-Edge Paths in Graphs With Given Edge Density, On Regularity Lemmas and their Algorithmic Applications, Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research), Correcting continuous hypergraphs, Finitely forcible graphons with an almost arbitrary structure, Non-perturbative β-functions via Feynman graphons, Hidden Hamiltonian Cycle Recovery via Linear Programming, Regularity lemmas in a Banach space setting, On the graph limit question of Vera T. Sós, Positive graphs, Semantic limits of dense combinatorial objects, On the graph limit question of Vera T. Sós, Positive graphs, Fixed point limits of self-similar network sequences, Unnamed Item, Auxin transport model for leaf venation, Random Walks on Dense Graphs and Graphons, On the Weisfeiler-Leman dimension of fractional packing, The Semilinear Heat Equation on Sparse Random Graphs, On the variational problem for upper tails in sparse random graphs, Tight bounds on the coefficients of partition functions via stability, Unnamed Item, Unnamed Item, Unnamed Item, On Weisfeiler-Leman invariance: subgraph counts and related graph properties, How to Calculate the Barycenter of a Weighted Graph, Asymptotic Structure for the Clique Density Theorem, The Second-Moment Phenomenon for Monochromatic Subgraphs, EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES, Minimizing the number of 5-cycles in graphs with given edge-density, On the dense preferential attachment graph models and their graphon induced counterpart, The Complexity of Homomorphism Indistinguishability, Counting Answers to Existential Questions, Lower bounds for integral functionals generated by bipartite graphs, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Power Network Dynamics on Graphons, The Complexity of Counting Surjective Homomorphisms and Compactions, Unnamed Item, Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs, On a Conjecture of Nagy on Extremal Densities, Unnamed Item, Harmonic analysis of symmetric random graphs, On the Graphon Mean Field Game equations: Individual agent affine dynamics and mean field dependent performance functions, An explicit construction of graphs of bounded degree that are far from being Hamiltonian, On local weak limit and subgraph counts for sparse random graphs, The regularity method for graphs with few 4‐cycles, The birth of geometry in exponential random graphs, Networks beyond pairwise interactions: structure and dynamics, Reciprocity in directed networks, In praise of homomorphisms, Finitely forcible graph limits are universal, Inverse expander mixing for hypergraphs, Compound Poisson models for weighted networks with applications in finance, Compactness by Coarse-Graining in long-range lattice systems, Counting induced subgraphs: an algebraic approach to \(\#\)W[1-hardness], 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, The step Sidorenko property and non-norming edge-transitive graphs, On edge exchangeable random graphs, The local limit of the uniform spanning tree on dense graphs, Weighted exponential random graph models: scope and large network limits, Exponential random graphs behave like mixtures of stochastic block models, Szemerédi's regularity lemma via martingales, Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs, A detailed investigation into near degenerate exponential random graphs, Symmetric graph properties have independent edges, Weak regularity and finitely forcible graph limits, First order convergence of matroids, Limits of schema mappings, Extremal \(H\)-colorings of trees and 2-connected graphs, Graph parameters from symplectic group invariants, Consensus and voting on large graphs: an application of graph limit theory, How unproportional must a graph be?, Pentagons in triangle-free graphs, Spectral classes of regular, random, and empirical graphs, Subsampling bootstrap of count features of networks, From quasirandom graphs to graph limits and graphlets, On the local approach to Sidorenko's conjecture, 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, Stability of twisted states in the Kuramoto model on Cayley and random graphs, Connection matrices and Lie algebra weight systems for multiloop chord diagrams, Convergence and limits of linear representations of finite groups, Symmetric sums of squares over \(k\)-subset hypercubes, Spectral zeta functions of graphs and the Riemann zeta function in the critical strip, Strong forms of stability from flag algebra calculations, On possible Turán densities, Right-convergence of sparse random graphs, The automorphism group of a graphon, Positivstellensätze for quantum multigraphs, Edge-reflection positivity and weighted graph homomorphisms, Finitely forcible graphons and permutons, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, A note on the inducibility of 4-vertex graphs, Graph summarization with quality guarantees, Computing the number of induced copies of a fixed graph in a bounded degree graph, Group ring elements with large spectral density, On derivatives of graphon parameters, On limits of sparse random graphs, Chromatic roots and limits of dense graphs, A large deviation principle for the Erdős-Rényi uniform random graph, Computing the partition function for graph homomorphisms, Counting proper colourings in 4-regular graphs via the Potts model, Visualizing network communities with a semi-definite programming method, Non-Hermitian random matrices with a variance profile. I: Deterministic equivalents and limiting esds, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, The feasible region of hypergraphs, Sparse maximum-entropy random graphs with a given power-law degree distribution, A framework for imperfectly observed networks, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, Adjustable network reconstruction with applications to CDS exposures, Recovering nonuniform planted partitions via iterated projection, Compact graphings, Estimation in exponential families on permutations, Measurable versions of Vizing's theorem, Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform, Spin systems on Bethe lattices, Limits of structures and the example of tree semi-lattices, Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras, Zero-free regions of partition functions with applications to algorithms and graph limits, Mixed partition functions and exponentially bounded edge-connection rank, Parameterized counting of partially injective homomorphisms, Two-sample Hypothesis Testing for Inhomogeneous Random Graphs, Uniform linear embeddings of graphons, Adaptive estimation of nonparametric geometric graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems, Network representation using graph root distributions, Convex graphon parameters and graph norms, Flows on measurable spaces, Invariant embeddings of unimodular random planar graphs, On the location of roots of graph polynomials, Recurrence relations for graph polynomials on bi-iterative families of graphs, 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, The iterated local model for social networks, Maximum number of colourings: 4-chromatic graphs, Cycles of length three and four in tournaments, Probability inequalities and tail estimates for metric semigroups, Exchangeable interval hypergraphs and limits of ordered discrete structures, A reverse Sidorenko inequality, Counting induced subgraphs: a topological approach to \#W[1-hardness], Matroid invariants and counting graph homomorphisms, Finite reflection groups and graph norms, Universality of the mean-field for the Potts model, Exchangeable graph-valued Feller processes, Iterated Global Models for Complex Networks, Preferential attachment processes approaching the Rado multigraph, Sparse Monte Carlo Method for Nonlocal Diffusion Problems, Symmetric Measures, Continuous Networks, and Dynamics, Lower Bounds for the Graph Homomorphism Problem, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Symmetric Graph Properties Have Independent Edges, Benchmarking Optimal Control for Network Dynamic Systems with Plausible Epidemic Models, Nonlinear large deviations, Modeling limits in hereditary classes: reduction and application to trees, Quasi-random multilinear polynomials, Fast Property Testing and Metrics for Permutations, Graphons and renormalization of large Feynman diagrams, Vertex Order in Some Large Constrained Random Graphs, Hypergraph limits: A regularity approach, Unnamed Item, Limits of discrete distributions and Gibbs measures on random graphs, Limits of mappings, Upper tails and independence polynomials in random graphs, Infinite dimensional representations of finite dimensional algebras and amenability, Hereditary quasirandomness without regularity, Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling, Lov\'asz Meets Weisfeiler and Leman, Impartial digraphs, Decomposition of tournament limits, Asymptotic structure of constrained exponential random graph models, Multipodal structure and phase transitions in large constrained graphs, Spectral classes of strongly-regular and distance-regular graphs, Correspondence homomorphisms to reflexive graphs, Asymptotic analysis of a ferromagnetic Ising system with ``diffuse interfacial energy, Logics of Finite Hankel Rank, Uniqueness of Banach space valued graphons, Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence, Limits of functions on groups, Local 2-separators, Continuum limit of the lattice quantum graph Hamiltonian, Stochastic graphon games. II: The linear-quadratic case, On positive hypergraphs, A measure theoretic perspective on the space of Feynman diagrams, Transferability of graph neural networks: an extended graphon approach, On a question of Vera T. Sós about size forcing of graphons, Optimal vaccination: various (counter) intuitive examples, Harnessing the Bethe free energy, Graphon particle system: uniform-in-time concentration bounds, The phases of large networks with edge and triangle constraints, Large deviations for the interchange process on the interval and incompressible flows, Stability of Twisted States in the Continuum Kuramoto Model, A combinatorial proof of the Burdzy-Pitman conjecture, Replica symmetry breaking without replicas, Approximating the Rectilinear Crossing Number, Unnamed Item, Singular value distribution of dense random matrices with block Markovian dependence, Convergence of graphs with intermediate density, Isomorphisms between random graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Lattice gas models with long range interactions, Unnamed Item, Unnamed Item, Cryptographic hash functions from sequences of lifted Paley graphs, On String Graph Limits and the Structure of a Typical String Graph, Limit of a nonpreferential attachment multitype network model, Small-world networks of Kuramoto oscillators, Random perfect graphs, Efficient Testing without Efficient Regularity, Limits of locally-globally convergent graph sequences, The nonlinear heat equation on \(W\)-random graphs, Continuous Matroids Revisited, Statistical Matching Theory, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, FORCING QUASIRANDOMNESS WITH TRIANGLES, The Ihara zeta function for infinite graphs, Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices, Community Detection and Stochastic Block Models, Bifurcations in the Kuramoto model on graphs, On the asymptotics of constrained exponential random graphs, Time-varying network models, Dynamics and control for multi-agent networked systems: A finite-difference approach, Bayesian consensus clustering in multiplex networks, An introduction to large deviations for random graphs, Density dichotomy in random words, Weak regularity and finitely forcible graph limits, Spaces of algebraic measure trees and triangulations of the circle, The Cut Metric for Probability Distributions, On the Query Complexity of Estimating the Distance to Hereditary Graph Properties, The minimum perfect matching in pseudo-dimension 0 < q < 1, Quasirandom Graphs and the Pantograph Equation, Routed planar networks, Emergence of Balance from a Model of Social Dynamics, Graphon Mean Field Games and Their Equations, Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics, Limiting Crossing Numbers for Geodesic Drawings on the Sphere, Ground states for exponential random graphs, Graphop Mean-Field Limits for Kuramoto-Type Models, Blind Identification of Stochastic Block Models from Dynamical Observations, Global aspects of measure preserving equivalence relations and graphs, Action convergence of operators and graphs