Add to ORKGVarious types of graph statistics for graphs and digraphs are presented as numerators of incomplete U-statistics, with symmetric and asymmetric kernels, respectively. Thus, asymptotic Poisson limits of these statistics are provided by using limit theorems for the sums of dissociated random variables. Several applications to statistical analysis of graphs are give
Abstract. This paper proves limit theorems for the number of monochromatic edges in uniform random c...
To capture the heterozygosity of vertex degrees of networks and understand their distributions, a cl...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
We study the normal approximation of functionals of Poisson measures having the form of a finite sum...
An interesting class of results in random graph theory concerns the problem of counting the number ...
An interesting class of results in random graph theory concerns the problem of counting the number ...
AbstractWe give a new sufficient condition for convergence to a Poisson distribution of a sequence o...
AbstractWe give a new sufficient condition for convergence to a Poisson distribution of a sequence o...
When a discrete random variable in a discrete space is asymptotically Poisson, there is often a powe...
AbstractWe derive an asymptotic formula for the number of graphs with n vertices all of degree at le...
Small subgraph counts can be used as summary statistics for large random graphs. We use the Stein-Ch...
Small subgraph counts can be used as summary statistics for large random graphs. We use th...
Suppose that t 2 is an integer, and randomly label t graphs with the integers 1:::n. We give suffici...
Abstract. The sizes of the cycles and unicyclic components in the random graph G(n, n/2 ± s), where ...
Abstract. This paper proves limit theorems for the number of monochromatic edges in uniform random c...
To capture the heterozygosity of vertex degrees of networks and understand their distributions, a cl...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
We study the normal approximation of functionals of Poisson measures having the form of a finite sum...
An interesting class of results in random graph theory concerns the problem of counting the number ...
An interesting class of results in random graph theory concerns the problem of counting the number ...
AbstractWe give a new sufficient condition for convergence to a Poisson distribution of a sequence o...
AbstractWe give a new sufficient condition for convergence to a Poisson distribution of a sequence o...
When a discrete random variable in a discrete space is asymptotically Poisson, there is often a powe...
AbstractWe derive an asymptotic formula for the number of graphs with n vertices all of degree at le...
Small subgraph counts can be used as summary statistics for large random graphs. We use the Stein-Ch...
Small subgraph counts can be used as summary statistics for large random graphs. We use th...
Suppose that t 2 is an integer, and randomly label t graphs with the integers 1:::n. We give suffici...
Abstract. The sizes of the cycles and unicyclic components in the random graph G(n, n/2 ± s), where ...
Abstract. This paper proves limit theorems for the number of monochromatic edges in uniform random c...
To capture the heterozygosity of vertex degrees of networks and understand their distributions, a cl...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...