Orthogonal decompositions and functional limit theorems for random graph statistics
From MaRDI portal
Recommendations
- A central limit theorem for decomposable random variables with applications to random graphs
- Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations
- Symmetric functionals on random matrices and random matchings problems
- scientific article; zbMATH DE number 2127720
- A functional limit theorem for random graphs with applications to subgraph count statistics
Cited in
(39)- A central limit theorem for decomposable random variables with applications to random graphs
- Small variance of subgraph counts in a random tournament
- How unproportional must a graph be?
- Rademacher chaos: tail estimates versus limit theorems
- Weighted dependency graphs
- On a complete and sufficient statistic for the correlated Bernoulli random graph model
- Likelihood theory for the graph Ornstein-Uhlenbeck process
- Central limit theorems for patterns in multiset permutations and set partitions
- On the number of isolated vertices in a growing random graph
- A functional limit theorem for the profile of search trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Distribution of the number of spanning regular subgraphs in random graphs
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles
- Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations
- A graph Fourier transform and proportional graphs
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Preferential attachment when stable
- Component structure of the configuration model: barely supercritical case
- A local central limit theorem for triangles in a random graph
- The distance profile of rooted and unrooted simply generated trees
- Tightness and weak convergence for jump processes
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Moderate deviations in cycle count
- Fluctuations of subgraph counts in graphon based random graphs
- Subgraph distributions in dense random regular graphs
- Depth-first search performance in a random digraph with geometric outdegree distribution
- Local limit theorems for subgraph counts
- Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
- Local central limit theorem for triangle counts in sparse random graphs
- Bootstrap percolation on the random graph \(G_{n,p}\)
- The process of fluctuations of the giant component of an Erdős-Rényi graph
- Moderate deviations of triangle counts in the Erdős-Rényi random graph G (n, m): the lower tail
- Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs G(n, m) and G(n, p)
- Moderate deviations of triangle counts -- the lower tail (extended abstract)
- Uncovering a graph
- A short proof of a central limit theorem for the order of the giant component and k-core
- Higher-order graphon theory: fluctuations, degeneracies and inference
- Asymptotic normality of the \(k\)-core in random graphs
This page was built for publication: Orthogonal decompositions and functional limit theorems for random graph statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4309695)
