Pages that link to "Item:Q3490034"
From MaRDI portal
The following pages link to A functional limit theorem for random graphs with applications to subgraph count statistics (Q3490034):
Displaying 21 items.
- Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence (Q659768) (← links)
- Asymptotic normality of the \(k\)-core in random graphs (Q930680) (← links)
- Small variance of subgraph counts in a random tournament (Q1579850) (← links)
- How unproportional must a graph be? (Q1663804) (← links)
- Rademacher chaos: tail estimates versus limit theorems (Q1880441) (← links)
- Detecting local network motifs (Q1950844) (← links)
- Weighted dependency graphs (Q1990226) (← links)
- A central limit theorem for incomplete U-statistics over triangular arrays (Q2244842) (← links)
- Monotonicity, asymptotic normality and vertex degrees in random graphs (Q2469660) (← links)
- Functional limit theorems for multitype branching processes and generalized Pólya urns. (Q2574638) (← links)
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝) (Q3298973) (← links)
- Susceptibility in subcritical random graphs (Q3624667) (← links)
- Proportional graphs (Q3974712) (← links)
- Asymptotic distributions in random graphs with applications to social networks (Q3989499) (← links)
- Probabilistic construction of proportional graphs (Q3990216) (← links)
- Multicyclic components in a random graph process (Q4034709) (← links)
- Random graphs with monochromatic triangles in every edge coloring (Q4286293) (← links)
- A graph Fourier transform and proportional graphs (Q4697824) (← links)
- Central limit theorem for statistics of subcritical configuration models (Q5131011) (← links)
- Fluctuations of subgraph counts in graphon based random graphs (Q6091052) (← links)
- On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm (Q6167703) (← links)
