Sparse graphs: Metrics and random models
From MaRDI portal
Publication:5198669
DOI10.1002/rsa.20334zbMath1223.05271arXiv0812.2656OpenAlexW2046560739MaRDI QIDQ5198669
Publication date: 9 August 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2656
Related Items
First order convergence of matroids, New results relating independence and matchings, A novel approach to subgraph selection with multiple weights on arcs, Graph limits: An alternative approach to s‐graphons, From quasirandom graphs to graph limits and graphlets, On the almost eigenvectors of random regular graphs, On a curious problem and what it lead to, Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs, A short proof of the equivalence of left and right convergence for sparse graphs, Unnamed Item, The Interpolation Method for Random Graphs with Prescribed Degrees, KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS, Asymptotic behavior and distributional limits of preferential attachment graphs, PROPERTY GRAPHS – A STATISTICAL MODEL FOR FIRE AND EXPLOSION LOSSES BASED ON GRAPH THEORY, On the limit of large girth graph sequences, Right-convergence of sparse random graphs, Finitely forcible graphons and permutons, Semantic limits of dense combinatorial objects, Limits of locally-globally convergent graph sequences, Optimal couplings between sparse block models, Left and right convergence of graphs with bounded degree, Finite graphs and amenability, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, The cut metric, random graphs, and branching processes, Uniform rank gradient, cost, and local-global convergence, Large deviations of empirical neighborhood distribution in sparse random graphs, First order limits of sparse graphs: Plane trees and path-width, Local-global convergence, an analytic and structural approach, Measures on the square as sparse graph limits, On the expected number of perfect matchings in cubic planar graphs, Weak regularity and finitely forcible graph limits, Unimodular random trees, On the significance of edges for connectivity in uncertain random graphs, Almost unimodal and real-rooted graph polynomials, On local weak limit and subgraph counts for sparse random graphs, Action convergence of operators and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Rounding of continuous random variables and oscillatory asymptotics
- Limits of dense graph sequences
- Percolation on nonunimodular transitive graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Automorphism groups of graphs as topological groups
- The isoperimetric number of random regular graphs
- Quick approximation to matrices and applications
- Group-invariant percolation on graphs
- Endomorphisms of symbolic algebraic varieties
- Sofic groups and direct finiteness.
- Recurrence of distributional limits of finite planar graphs
- Bounds on the bisection width for random \(d\)-regular graphs
- Processes on unimodular random networks
- Generalized quasirandom graphs
- Graph limits and parameter testing
- Improved approximation of Max-Cut on graphs of bounded degree
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- A spectral heuristic for bisecting random graphs
- On the editing distance of graphs
- Max Cut for Random Graphs with a Planted Partition
- Random MAX SAT, random MAX CUT, and their phase transitions
- Bisecting sparse random graphs
- The phase transition in inhomogeneous random graphs
- Hyperlinear and Sofic Groups: A Brief Guide
- Asymptotic Enumeration of Spanning Trees
- A conjecture concerning a limit of non-Cayley graphs
- The cut metric, random graphs, and branching processes
