Results 21 to 30 of about 2,481,598 (245)
QUASI-RANDOM PROFINITE GROUPS [PDF]
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
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
Statistical Analysis of Single-Order Diffraction Grating with Quasi-Random Structures
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
Performance Evaluation in Single or Multi-Cluster C-RAN Supporting Quasi-Random Traffic [PDF]
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
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
Random walks and quasi-isometries [PDF]
This thesis deals with the study of random walks up to quasi-isometry. We first show that some of the basic properties of random walks are not preserved by applying a quasi-isometry of the group to a random walk.
Goldsborough, Antoine
core +5 more sources
The effect of induced subgraphs on quasi‐randomness [PDF]
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 +5 more sources
Quasi Random Resampling Designs for Multiple Frame Surveys
In this paper, we present two new algorithms that use the shuffled Sobol sequence to generate the bootstrap resampling designs in multiple frame surveys.
Cherif Ahmat Tidiane Aidara
doaj +1 more source
The quasi‐randomness of hypergraph cut properties [PDF]
AbstractLet $\alpha_1,\ldots,\alpha_k$ satisfy $\sum_i\alpha_i=1$ and suppose a k‐uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets $A_1,\ldots,A_k$ of sizes $\alpha_1n,\ldots,\alpha_kn$, the number of edges intersecting $A_1,\ldots,A_k$ is (asymptotically) the number one would expect to ...
Asaf Shapira, Raphael Yuster
openaire +2 more sources
Quasi-Random Sampling for Condensation [PDF]
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implementation. However, the conventional Condensation tracker is known to have difficulty with high-dimensional state spaces and unknown motion models.
Vasanth Philomin +2 more
openaire +1 more source

