Motif estimation via subgraph sampling: the fourth-moment phenomenon (Q2131263): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q824221
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sayan Kumar Das / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2011.03026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear-time algorithms for counting star subgraphs via edge sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Stein's Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical Processes in Survey Sampling with (Conditional) Poisson Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangle estimation using tripartite independent set queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal limit theorems in graph coloring problems with connections to extremal combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of moments and degree distributions for network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. II. Multiway cuts and statistical physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating and understanding exponential random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal approximation under local dependence. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite exchangeable sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately Counting Triangles in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating average parameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Testing Expansion in Bounded-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Stars and Other Small Subgraphs in Sublinear-Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snowball Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for random sampling without replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling social networks from sampled data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Sampling Without Replacement From a Finite Universe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subgraphs of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the number of connected components in a graph via subgraph sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical analysis of network data. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics at the Frontier of Statistics and Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random regular graphs of high degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Fields on the Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stein's method on Wiener chaos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal Approximations with Malliavin Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance principles for homogeneous sums: universality of Gaussian Wiener chaos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central limit theorems for sequences of multiple stochastic integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost of algorithms for random selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally consistent vertex classification for latent positions graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks / rank
 
Normal rank

Latest revision as of 19:53, 28 July 2024

scientific article
Language Label Description Also known as
English
Motif estimation via subgraph sampling: the fourth-moment phenomenon
scientific article

    Statements

    Motif estimation via subgraph sampling: the fourth-moment phenomenon (English)
    0 references
    0 references
    0 references
    25 April 2022
    0 references
    asymptotic inference
    0 references
    fourth moment phenomenon
    0 references
    motif counting
    0 references
    network analysis
    0 references
    random graphs
    0 references
    Stein's method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references