On local weak limit and subgraph counts for sparse random graphs

DOI10.1017/jpr.2021.84OpenAlexW2272624986MaRDI QIDQ5868527

Valentas Kurauskas

Publication date: 21 September 2022

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.08103

zbMATH Keywords

clique treerandom intersection graphsubgraph countlocal weak limit

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (3)

Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Estimating global subgraph counts by sampling ⋮ Large cliques in sparse random intersection graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits of random graphs from subcritical classes
• Assortativity and clustering of sparse random intersection graphs
• Degree distribution of an inhomogeneous random intersection graph
• Graph homomorphisms between trees
• Large cliques in sparse random intersection graphs
• Degree distribution of a typical vertex in a general random intersection graph
• Gibbs measures and phase transitions on sparse random graphs
• The largest component in an inhomogeneous random intersection graph with clustering
• Number of walks and degree powers in a graph
• Limit theorems for a random graph epidemic model
• A partially ordered set of functionals corresponding to graphs
• Size bias for one and all
• Recurrence of distributional limits of finite planar graphs
• Degree and clustering coefficient in sparse random intersection graphs
• An old approach to the giant component problem
• Data science, learning by latent structures, and knowledge discovery.
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Processes on unimodular random networks
• Asymptotic properties of random unlabelled block-weighted graphs
• Sparse random graphs with clustering
• Resolvent of large random graphs
• Clustering Coefficients of Random Intersection Graphs
• Degree-degree distribution in a power law random intersection graph with clustering
• Giant Component in Random Multipartite Graphs with Given Degree Sequences
• Modern Coding Theory
• A new approach to the giant component problem
• On Random Intersection Graphs: The Subgraph Problem
• Sparse graphs: Metrics and random models
• Unimodular random trees
• The phase transition in inhomogeneous random graphs
• Asymptotic Enumeration of Spanning Trees
• Probability

This page was built for publication: On local weak limit and subgraph counts for sparse random graphs