Results 31 to 40 of about 884,278 (306)
On Simulation of the Young Measures – Comparison of Random-Number Generators
Journal of Information and Organizational Sciences, 2017 "Young measure" is an abstract notion from mathematical measure theory. Originally, the notion appeared in the context of some variational problems related to the analysis of sequences of “fast” oscillating of functions.
Andrzej Z. Grzybowski, Piotr Puchała
doaj +1 more source
Certified Quantum Random Numbers from Untrusted Light
Physical Review X, 2020 A remarkable aspect of quantum theory is that certain measurement outcomes are entirely unpredictable to all possible observers. Such quantum events can be harnessed to generate numbers whose randomness is asserted based upon the underlying physical ...
David Drahi +10 more
doaj +1 more source
Non-homogeneous random walks with non-integrable increments and heavy-tailed random walks on strips
, 2012 We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non existence of moments for first-passage and last-exit times.
MacPhee, Iain M. +9 more
core +1 more source
The Lovász Number of Random Graphs [PDF]
Combinatorics, Probability and Computing, 2003 We study the Lovász number $\vartheta$ along with two related SDP relaxations $\vartheta_{1/2}$, $\vartheta_2$ of the independence number and the corresponding relaxations $\bar\vartheta$, $\bar\vartheta_{1/2}$, $\bar\vartheta_2$ of the chromatic number on random graphs $G_{n,p}$.
openaire +5 more sources
On the Domination Number of a Random Graph [PDF]
The Electronic Journal of Combinatorics, 2001 In this paper, we show that the domination number $D$ of a random graph enjoys as sharp a concentration as does its chromatic number $\chi$. We first prove this fact for the sequence of graphs $\{G(n,p_n\},\; n\to\infty$, where a two point concentration is obtained with high probability for $p_n=p$ (fixed) or for a sequence $p_n$ that approaches ...
Wieland, Ben, Godbole, Anant P.
openaire +3 more sources
Generation of Truly Random Numbers on a Quantum Annealer
IEEE Access, 2022 This study investigates how qubits of modern quantum annealers (QA) such as D-Wave can be applied for generating truly random numbers. We show how a QA can be initialised and how the annealing schedule can be set so that after the annealing, thousands of
Harshil Bhatia +3 more
doaj +1 more source
The Bondage Number of Random Graphs [PDF]
The Electronic Journal of Combinatorics, 2016 A dominating set of a graph is a subset $D$ of its vertices such that every vertex not in $D$ is adjacent to at least one member of $D$. The domination number of a graph $G$ is the number of vertices in a smallest dominating set of $G$. The bondage number of a nonempty graph $G$ is the size of a smallest set of edges whose removal from $G$ results in a
Dieter Mitsche +2 more
openaire +3 more sources
Estimating the privacy of quantum-random numbers
New Journal of Physics, 2020 We analyze the information an attacker can obtain on the numbers generated by a user by measurements on a subsystem of a system consisting of two entangled two-level systems.
Johannes Seiler +2 more
doaj +1 more source
Scheme for Generating True Random Numbers using Electro-mechanical Switches
Journal of Engineering, 2022 This paper proposes a novel method for generating True Random Numbers (TRNs) using electromechanical switches. The proposed generator is implemented using an FPGA board.
Oday Ridha, Ghassan Jawad
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background 131I‐metaiodobenzylguanidine (131I‐MIBG) radiotherapy is a key treatment for relapsed and refractory (R/R) neuroblastoma (NB). Patients with R/R disease treated in the modern era are increasingly exposed to anti‐GD2 immunotherapy, which exerts selective pressure and may modify both tumor cell state and microenvironment.
Benjamin J. Lerman +7 more
wiley +1 more source