Results 251 to 260 of about 90,608 (299)

Weak quasi‐randomness for uniform hypergraphs

Random Structures & Algorithms, 2011
AbstractWe 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 the well known Chung‐Graham‐Wilson theorem for quasi‐random graphs.Moreover, let Kk be the ...
David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht   +3 more
openaire   +2 more sources

Localization in Interacting Fermionic Chains with Quasi-Random Disorder

, 2016
We consider a system of fermions with a quasi-random almost-Mathieu disorder interacting through a many-body short range potential. We establish exponential decay of the zero temperature correlations, indicating localization of the interacting ground ...
V. Mastropietro
semanticscholar   +1 more source

Quasi-kilowatt random fiber laser

Optics Letters, 2019
The random distributed-feedback Raman fiber laser (RRFL) is a new approach to obtain a high-power laser. In this Letter, we report a RRFL with quasi-kilowatt output power for the first time based on a half-open cavity.
Hanwei Zhang, Long Huang, Jiaxin Song, Han Wu, P. Zhou, Xiao-lin Wang, Jian Wu, Jiangming Xu, Zinan Wang, Xiaojun Xu, Y. Rao   +10 more
semanticscholar   +1 more source

Quasi-random points keep their distance

Mathematics and Computers in Simulation, 2007
For a given net, composed of \(N\) quasi-random points \(Q_{0}, Q_{1}, \dots , Q_{N-1}\) in the \(n\)-dimensional hypercube \(I^{n}\), the measure \(d_{N} = \min_{0 \leq i < j < N} \rho(Q_{i}, Q_{j}), \) where \(\rho\) is the Euclidean distance between the points \(Q_{i}\) and \(Q_{j},\) called minimum distance, is considered. In section 2 the behavior
Ilya M. Sobol, Boris Shukhman
openaire   +2 more sources

Self-Organization of Quasi-Random Copolymers

Doklady Physical Chemistry, 2002
The theory of integral RISM-equations is applied to describe the equilibrium structure of a quasi random protein-like polymer. Interaction of collective correlation functions is given by the Ornstein-Zernike nonlinear integral equation.
Zherenkova, L. V., Talitskikh, S. K., Khalatur, P. G., Khokhlov, A. R.   +3 more
openaire   +2 more sources

Energy efficient random access for the quasi-static fading MAC

International Symposium on Information Theory, 2019
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes.
S. Kowshik, K. Andreev, A. Frolov, Yury Polyanskiy   +3 more
semanticscholar   +1 more source

Book Ramsey Numbers and Quasi-Randomness

Combinatorics, Probability and Computing, 2005
A book \(B_p\) with \(p\) pages is a graph consisting of \(p\) triangles sharing a common edge. It was shown by \textit{C. C. Rousseau} and \textit{J. Sheehan} in [J. Graph Theory 2, 77--87 (1978; Zbl 0377.05033)] that the Ramsey number \(r(B_n, B_n) = (4 + o(1))n\).
Nikiforov, V., Rousseau, C. C., Schelp, R. H.   +2 more
openaire   +2 more sources

Regularity lemmas for hypergraphs and quasi‐randomness

Random Structures & Algorithms, 1991
AbstractWe give a simple proof for Szemerédi's Regularity Lemma and its generalization for k‐uniform hypergraphs. For fixed k, there are altogether k ‐1 different versions of the regularity lemma for k‐uniform hypergraphs. The connection between regularity lemmas for hypergraphs and quasi‐random classes of hypergraphs is also investigated.
openaire   +2 more sources

Remarks on randomization of quasi-random numbers

Monte Carlo Methods and Applications, 2018
Abstract 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. Randomization of these sequences by the random shift method turns out to lead to well-known random quadrature formulas with one free node ...
Sergej M. Ermakov, Svetlana N. Leora
openaire   +2 more sources

Quasi-random nonlinear scale space

Pattern Recognition Letters, 2010
A novel nonlinear scale space framework is proposed for the purpose of multi-scale image representation. The scale space decomposition problem is formulated as a general Bayesian least-squares estimation problem. A quasi-random density estimation approach is introduced for estimating the posterior distribution between consecutive scale space ...
Akshaya Kumar Mishra, Alexander Wong, David A. Clausi, Paul W. Fieguth   +3 more
openaire   +1 more source