Results 31 to 40 of about 90,608 (299)
Bipartite Subgraphs and Quasi-Randomness [PDF]
Graphs and Combinatorics, 2004 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
Approximate Flow Friction Factor: Estimation of the Accuracy Using Sobol’s Quasi-Random Sampling
Axioms, 2022 The unknown friction factor from the implicit Colebrook equation cannot be expressed explicitly in an analytical way, and therefore to simplify the calculation, many explicit approximations can be used instead.
Pavel Praks, Dejan Brkić
doaj +1 more source
QUASI-RANDOM PROFINITE GROUPS [PDF]
Glasgow Mathematical Journal, 2014 AbstractInspired by Gowers' seminal paper (W. T. Gowers,Comb. Probab. Comput.17(3) (2008), 363–387, we will investigate quasi-randomness for profinite groups. We will obtain bounds for the minimal degree of non-trivial representations of SLk(ℤ/(pnℤ)) and Sp2k(ℤ/(pnℤ)).
Bardestani, Mohammad +1 more
openaire +3 more sources
Journal of Chemical Theory and Computation, 2020 We describe the implementation of a Monte Carlo basin hopping (BH) global optimization procedure for the prediction of molecular crystal structures. The BH method is combined with quasi-random (QR) structure generation in a hybrid method for crystal ...
Shiyue Yang, G. Day
semanticscholar +1 more source
Quasi-random numbers in some statistical systems
Lietuvos Matematikos Rinkinys, 2000 There are many ways to get random numbers. Some methods include making hardware devices that generate noise, observing cosmic ray flux and etc. Pseudo-random numbers come from mathematical functions and algorithms that provides such numbers called ...
Vitalija Rudzkienė
doaj +3 more sources
Statistical Analysis of Single-Order Diffraction Grating with Quasi-Random Structures
Photonics, 2023 Single-order diffraction gratings with quasi-random structures are effective optical elements in suppressing harmonics contamination. However, background intensity fluctuations introduced by quasi-random structures may affect the measurement of the ...
Huaping Zang +8 more
doaj +1 more source
Quasi-Random Sampling for Multivariate Distributions via Generative Neural Networks [PDF]
Journal of Computational And Graphical Statistics, 2018 Generative moment matching networks (GMMNs) are introduced for generating approximate quasi-random samples from multivariate models with any underlying copula to compute estimates with variance reduction.
M. Hofert, Avinash Prasad, Mu Zhu
semanticscholar +1 more source
Performance Evaluation in Single or Multi-Cluster C-RAN Supporting Quasi-Random Traffic [PDF]
Journal of Communications Software and Systems, 2020 In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units (BBUs). The RRHs in the C-RAN are grouped in different clusters according to their capacity while the BBUs form a ...
Iskanter-Alexandros Chousainov +3 more
doaj
E-Jurnal Matematika, 2022 Estimating the value at risk (VaR) is an important aspect of investment. VaR is a standard method of measuring risk defined as the maximum loss over a certain period of time at a certain level of confidence.
PUTU SAVITRI DEVI +2 more
doaj +1 more source
The effect of induced subgraphs on quasi‐randomness [PDF]
Random Structures & Algorithms, 2009 AbstractOne of the main questions that arise when studying random and quasi‐random structures is which properties $ \cal P$ are such that any object that satisfies $ \cal P$ “behaves” like a truly random one. In the context of graphs, Chung, Graham, and Wilson (Combinatorica 9 (1989), 345–362) call a graph p‐quasi‐random if it satisfies a long list of ...
Asaf Shapira, Raphael Yuster
openaire +4 more sources