Large deviations for subgraphs in inhomogeneous random graphs
From MaRDI portal
Cites work
- A large-deviations principle for all the components in a sparse inhomogeneous random graph
- Average nearest neighbor degrees in scale-free networks
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- Degree correlations in scale-free random graph models
- Divide and conquer martingales and the number of triangles in a random graph
- Generating simple random graphs with prescribed degree distribution
- Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations
- Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
- Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
- Limit theorems for assortativity and clustering in null models for scale-free networks
- Loops of any size and Hamilton cycles in random scale-free networks
- Number of cliques in random scale-free network ensembles
- On the distances within cliques in a soft random geometric graph
- Optimal subgraph structures in scale-free configuration models
- PageRank's behavior under degree correlations
- Parameterized clique on inhomogeneous random graphs
- Scale-free graphs with many edges
- The average distances in random graphs with given expected degrees
- The deletion method for upper tail estimates
- The fewest-big-jumps principle and an application to random graphs
- The large deviation principle for inhomogeneous Erdős-Rényi random graphs
- The missing log in large deviations for triangle counts
- Upper tails for subgraph counts in random graphs
- Upper tails for triangles
This page was built for publication: Large deviations for subgraphs in inhomogeneous random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293120)
