Results 11 to 20 of about 2,481,598 (245)
Weak quasi-randomness for uniform hypergraphs
We study quasi-random properties of k-uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will find several equivalent characterisations of this property and our work can be viewed as an extension of
Schacht, Mathias +3 more
core +3 more sources
When does quasi-random work [PDF]
International audienceWe experiment the efficiency of quasi-random mutations in evolution strategies in continuous domains from various points of views: (i) non-convexity (ii) convergence rate (iii) non-asymptotic behavior (iv) noise.
Olivier Teytaud, Teytaud, Olivier
core +4 more sources
Quasi-random Boolean Functions [PDF]
We examine a hierarchy of equivalence classes of local quasi-random properties of Boolean Functions. In particular, we prove an equivalence between a number of properties including balanced influences, spectral discrepancy, local strong regularity ...
Sieger, Nicholas
core +4 more sources
Remarks on randomization of quasi-random numbers
In this paper we discuss estimation of the quasi-Monte Carlo methods error in the case of calculation of high-order integrals. Quasi-random Halton sequences are considered as a special case.
Sergej M. Ermakov, Svetlana N. Leora
core +4 more sources
QUASI-RANDOM TESTING OF COMPUTER SYSTEMS
Various modified random testing approaches have been proposed for computer system testing in the black box environment. Their effectiveness has been evaluated on the typical failure patterns by employing three measures, namely, P-measure, E-measure and F-
S. V. Yarmolik, V. N. Yarmolik
doaj +1 more source
Quasi-Monte Carlo Method for Infinitely Divisible Random Vectors via Series Representations [PDF]
An infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been investigated as a device for Monte Carlo simulation.
Junichi Imai (7595063) +1 more
core +6 more sources
Quasi‐random hypergraphs [PDF]
Abstract We introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi‐random.
Fan R. K. Chung, Ronald L. Graham
openaire +4 more sources
We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.
Chung, F. R. K. +2 more
openaire +4 more sources
Bipartite Subgraphs and Quasi-Randomness [PDF]
The concept of a pseudo-random graph is now firmly established as a useful one in combinatorics and theoretical computer science. The essential idea is that such a graph should have the properties of a typical random graph \(G(n,p)\) with the same density of edges. Various attempts have been made to formalise this notion: one of these was in \textit{F.
Jozef Skokan, Lubos Thoma
openaire +3 more sources
Tensor quasi-random groups [PDF]
Gowers [Combin. Probab. Comput. 17 (2008), pp. 363–387] elegantly characterized the finite groups G G in which
openaire +3 more sources

