Tootfinder

Energy minima and ordering in ferromagnets with quenched randomness
D. A. Garanin
https://arxiv.org/abs/2506.02292 https://arxiv.org/…

Energy minima and ordering in ferromagnets with quenched randomness
Energy minimization at T=0 and Monte Carlo simulations at T>0 have been performed for 2D and 3D random-field and random-anisotropy systems of up to 100 million classical spins. The main finding is that 3D random-anisotropy systems magnetically order on lowering temperature, contrary to the theoretical predictions based on the Imry-Ma argument. If random-anisotropy is stronger than the exchange, which can be the case in sintered materials, the system still orders but the magnetization is strongl…

Maximal intrinsic randomness of noisy quantum measurements
Fionnuala Curran, Morteza Moradi, Gabriel Senno, Magdalena Stobinska, Antonio Ac\'in
https://arxiv.org/abs/2506.22294

Maximal intrinsic randomness of noisy quantum measurements
Quantum physics exhibits an intrinsic and private form of randomness with no classical counterpart. Any setup for quantum randomness generation involves measurements acting on quantum states. In this work, we consider the following question: Given a quantum measurement, how much randomness can be generated from it? In real life, measurements are noisy and thus contain an additional, extrinsic form of randomness due to ignorance. This extrinsic randomness is not private since, in an adversarial …

This https://arxiv.org/abs/2502.13978 has been replaced.
initial toot: https://mastoxiv.page/@ar…

On the dynamical evolution of randomness Part A: Random experiments as dynamical systems
In this work, Bernoulli's Law of Large Numbers, also known as the Golden theorem, has been extended to study the relations between empirical probability and empirical randomness of an otherwise random experiment. Using the example of a coin toss and a dice role, some interesting results are drawn. Analytically and using numerical computations, empirical randomness of each outcome has been shown to increase by \textit{ chance}, which itself depends on the growth rate of empirical probabilities. …

This https://arxiv.org/abs/2505.01874 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Towards Trustworthy Federated Learning with Untrusted Participants
Resilience against malicious participants and data privacy are essential for trustworthy federated learning, yet achieving both with good utility typically requires the strong assumption of a trusted central server. This paper shows that a significantly weaker assumption suffices: each pair of participants shares a randomness seed unknown to others. In a setting where malicious participants may collude with an untrusted server, we propose CafCor, an algorithm that integrates robust gradient agg…

This https://arxiv.org/abs/2308.08478 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Episodic Bayesian Optimal Control with Unknown Randomness Distributions
Stochastic optimal control with unknown randomness distributions has been studied for a long time, encompassing robust control, distributionally robust control, and adaptive control. We propose a new episodic Bayesian approach that incorporates Bayesian learning with optimal control. In each episode, the approach learns the randomness distribution with a Bayesian posterior and subsequently solves the corresponding Bayesian average estimate of the true problem. The resulting policy is exercised …

New Tests of Randomness for Circular Data
Shriya Gehlot, Arnab Kumar Laha
https://arxiv.org/abs/2506.23522 https://arxiv.org/pdf/2506…

New Tests of Randomness for Circular Data
Randomness or mutual independence is an important underlying assumption for most widely used statistical methods for circular data. Verifying this assumption is essential to ensure the validity and reliability of the resulting inferences. In this paper, we introduce two tests for assessing the randomness assumption in circular statistics, based on random circular arc graphs (RCAGs). We define and analyze RCAGs in detail, showing that their key properties depend solely on the i.i.d. nature of th…

What Makes Treatment Effects Identifiable? Characterizations and Estimators Beyond Unconfoundedness
Yang Cai, Alkis Kalavasis, Katerina Mamali, Anay Mehrotra, Manolis Zampetakis
https://arxiv.org/abs/2506.04194

What Makes Treatment Effects Identifiable? Characterizations and Estimators Beyond Unconfoundedness
Most of the widely used estimators of the average treatment effect (ATE) in causal inference rely on the assumptions of unconfoundedness and overlap. Unconfoundedness requires that the observed covariates account for all correlations between the outcome and treatment. Overlap requires the existence of randomness in treatment decisions for all individuals. Nevertheless, many types of studies frequently violate unconfoundedness or overlap, for instance, observational studies with deterministic tr…

This https://arxiv.org/abs/2310.00407 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On the limit theory of mean field optimal stopping with non-Markov dynamics and common noise
This paper focuses on a mean-field optimal stopping problem with non-Markov dynamics and common noise, inspired by Talbi, Touzi, and Zhang \cite{TalbiTouziZhang1,TalbiTouziZhang3}. The goal is to establish the limit theory and demonstrate the equivalence of the value functions between weak and strong formulations. The difference between the strong and weak formulations lies in the source of randomness determining the stopping time on a canonical space. In the strong formulation, the randomness …

This https://arxiv.org/abs/2505.24603 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches
Gaussian sketching, which consists of pre-multiplying the data with a random Gaussian matrix, is a widely used technique for multiple problems in data science and machine learning, with applications spanning computationally efficient optimization, coded computing, and federated learning. This operation also provides differential privacy guarantees due to its inherent randomness. In this work, we revisit this operation through the lens of Renyi Differential Privacy (RDP), providing a refined pri…

Soliton Synchronization with Randomness: Rogue Waves and Universality
Manuela Girotti, Tamara Grava, Robert Jenkins, Guido Mazzuca, Ken McLaughlin, Maxim Yattselev
https://arxiv.org/abs/2507.01253

Soliton Synchronization with Randomness: Rogue Waves and Universality
We consider an $N$-soliton solution of the focusing nonlinear Schrödinger equations. We give conditions for the synchronous collision of these $N$ solitons. When the solitons velocities are well separated and the solitons have equal amplitude, we show that the local wave profile at the collision point scales as the $\operatorname{sinc}(x)$ function. We show that this behaviour persists when the amplitudes of the solitons are i.i.d. sub-exponential random variables. Namely the central collision…

Win Probabilities, Hand Sizes, and Game Duration Analysis in the Bhikar-Sawkar Card Game
Mihir Durve
https://arxiv.org/abs/2506.03680 https://

Win Probabilities, Hand Sizes, and Game Duration Analysis in the Bhikar-Sawkar Card Game
We present a Monte Carlo simulation study of the Bhikar-Sawkar card game, a non-deterministic game structurally similar to the classic Beggar-My-Neighbour, which is fully deterministic. Although both games share a common setup, key differences in their rules, particularly the reshuffling of cards after each won hand in Bhikar-Sawkar, introduce stochasticity and significantly increase the space of possible game evolutions. This inherent randomness raises a range of interesting statistical questi…

Evaluating Randomness Assumption: A Novel Graph Theoretic Approach
Shriya Gehlot, Arnab Kumar Laha
https://arxiv.org/abs/2506.21157 https://

Evaluating Randomness Assumption: A Novel Graph Theoretic Approach
Randomness or mutual independence is a fundamental assumption forming the basis of statistical inference across disciplines such as economics, finance, and management. Consequently, validating this assumption is essential for the reliable application of statistical methods. However, verifying randomness remains a challenge, as existing tests in the literature are often restricted to detecting specific types of data dependencies. In this paper, we propose a novel graph-theoretic approach to test…

An efficient construction of Raz's two-source randomness extractor with improved parameters
Cameron Foreman, Lewis Wooltorton, Kevin Milner, Florian J. Curchod
https://arxiv.org/abs/2506.15547

An efficient construction of Raz's two-source randomness extractor with improved parameters
Randomness extractors are algorithms that distill weak random sources into near-perfect random numbers. Two-source extractors enable this distillation process by combining two independent weak random sources. Raz's extractor (STOC '05) was the first to achieve this in a setting where one source has linear min-entropy (i.e., proportional to its length), while the other has only logarithmic min-entropy in its length. However, Raz's original construction is impractical due to a polynomial computat…

Folks using PHP don't relize how good we have it for things like "a nice datetime built-in" and "reasonably secure defaults on password generation and randomness."
And the three things I mentioned above have been around since 2006, 2013, and 2015, respectively.

Integration of quantum random number generators with post-quantum cryptography algorithms
Paula Alonso Blanco, Luis Trigo Vidarte, Marc Romeu Casas, Jos\'e Ram\'on Mart\'inez Saavedra, Fernando de la Iglesia, Jordi Mur-Petit, Valerio Pruneri
https://arxiv.org/abs/2507.00658

Integration of quantum random number generators with post-quantum cryptography algorithms
As quantum technologies advance, the security of popular cryptographic protocols becomes more threatened by the capabilities of Cryptographically Relevant Quantum Computers (CRQCs). In this scenario, Post-Quantum Cryptography (PQC) has become a potential solution to prolong the life of existing Public Key Infrastructure (PKI) systems. However, PQC protocols depend on high-quality randomness for key generation and encapsulation procedures, with the quality of the entropy source potentially havin…

You can't fix Monaco, not without adding more randomness into pitstops such as bringing back refuelling which they won't.
And even if they did that there would still be a train in the middle of the field.
It would have to be more drastic and they won't do that for one GP.
Though, personally, I think the cars should be narrower and tyres reduced in width and height. Make it a sport about racing again.

Relationship between spin-glass three-dimensional (3D) Ising model and traveling salesman problems
Zhidong Zhang
https://arxiv.org/abs/2507.01914 https://

Relationship between spin-glass three-dimensional (3D) Ising model and traveling salesman problems
In this work, the relationship between a spin-glass three-dimensional (3D) Ising model with the lattice size N = mnl and the traveling salesman problem (TSP) in a 3D lattice is studied. In particular, the mathematical structures of the two systems are investigated in details. In both the hard problems, the nontrivial topological structures, the non-planarity graphs, the nonlocalities and/or the long-range spin entanglements exist, while randomness presents, which make the computation very compl…

»Forscher entwickeln ersten fälschungssicheren Zufallszahlengenerator:
[…] In einem 40-tägigen Test generierte das Forscherteam 7454 Mal #Zufallszahlen und stellte fest, dass in 7434 Fällen eine wirklich zufällige Zahl erzeugt wurde - eine Erfolgsrate von 99,7 Prozent. […]«
Pures #Random i…

Forscher entwickeln ersten fälschungssicheren Zufallszahlengenerator
Forscher haben ein System zur Erzeugung wirklich zufälliger Zahlen entwickelt. Das "Colorado University Randomness Beacon" nutzt Quantenmechanik und Blockchain-Technologie, um vollständig manipulationssichere Zufallszahlen zu erzeugen.

Heavy-tailed open quantum systems reveal long-lived and ultrasensitive coherence
Sunkyu Yu, Xianji Piao, Namkyoo Park
https://arxiv.org/abs/2506.22717 http…

Heavy-tailed open quantum systems reveal long-lived and ultrasensitive coherence
Understanding random open quantum systems is critical for characterizing the performance of large-scale quantum devices and exploring macroscopic quantum phenomena. Various features in these systems, including spectral distributions, gap scaling, and decoherence, have been examined by modelling randomness under the central limit theorem. Here, we investigate random open quantum systems beyond the central limit theorem, focusing on heavy-tailed system-environment interactions. By extending the G…

Oblivious Deletion Codes
Roni Con, Ray Li
https://arxiv.org/abs/2506.18878 https://arxiv.org/pdf/2506.18878

Oblivious Deletion Codes
We construct deletion error-correcting codes in the oblivious model, where errors are adversarial but oblivious to the encoder's randomness. Oblivious errors bridge the gap between the adversarial and random error models, and are motivated by applications like DNA storage, where the noise is caused by hard-to-model physical phenomena, but not by an adversary. (1) (Explicit oblivious) We construct $t$ oblivious deletion codes, with redundancy $\sim 2t\log n$, matching the existential bound for…

Replaced article(s) found for gr-qc. https://arxiv.org/list/gr-qc/new
[1/2]:
- Assumptions of Randomness in Cosmology Models
Leonid A. Levin

Ising versus infinite randomness criticality in arrays of Rydberg atoms trapped with non-perfect tweezers
Jose Soto-Garcia, Natalia Chepiga
https://arxiv.org/abs/2506.11985

Ising versus infinite randomness criticality in arrays of Rydberg atoms trapped with non-perfect tweezers
Chains of Rydberg atoms have emerged as an amazing platform for simulating quantum physics in low dimensions. This remarkable success is due to the versatility of lattice geometries achieved by trapping neutral atoms with optical tweezers. On a given lattice, the competition between the repulsive van der Waals potential and the detuning of the laser frequency brings the atoms to highly excited Rydberg states, leading to a variety of exotic phases and quantum phase transitions. Experiments on th…

Mxplainer: Explain and Learn Insights by Imitating Mahjong Agents
Lingfeng Li, Yunlong Lu, Yongyi Wang, Qifan Zheng, Wenxin Li
https://arxiv.org/abs/2506.14246

Mxplainer: Explain and Learn Insights by Imitating Mahjong Agents
People need to internalize the skills of AI agents to improve their own capabilities. Our paper focuses on Mahjong, a multiplayer game involving imperfect information and requiring effective long-term decision-making amidst randomness and hidden information. Through the efforts of AI researchers, several impressive Mahjong AI agents have already achieved performance levels comparable to those of professional human players; however, these agents are often treated as black boxes from which few in…

ALEA IACTA EST: A Declarative Domain-Specific Language for Manually Performable Random Experiments
Baltasar Tranc\'on y Widemann, Markus Lepper
https://arxiv.org/abs/2506.11794

ALEA IACTA EST: A Declarative Domain-Specific Language for Manually Performable Random Experiments
Random experiments that are simple and clear enough to be performed by human agents feature prominently in the teaching of elementary stochastics as well as in games. We present Alea, a domain-specific language for the specification of random experiments. Alea code can either be analyzed statically to obtain and inspect probability distributions of outcomes, or be executed with a source pseudo-randomness for simulation or as a game assistant. The language is intended for ease of use by non-expe…

Certified randomness from quantum speed limits
Caroline L. Jones, Albert Aloy, Gerard Higgins, Markus P. Mueller
https://arxiv.org/abs/2506.14526 https://

Certified randomness from quantum speed limits
Quantum speed limits are usually regarded as fundamental restrictions, constraining the amount of computation that can be achieved within some given time and energy. Complementary to this intuition, here we show that these limitations are also of operational value: they enable the secure generation of certified randomness. We consider a prepare-and-measure scenario with some (experimentally determined or promised) upper bound on the energy uncertainty of the average prepared quantum state, but …

Leakage-Resilient Extractors against Number-on-Forehead Protocols
Eshan Chattopadhyay, Jesse Goodman
https://arxiv.org/abs/2506.12595 https://

Leakage-Resilient Extractors against Number-on-Forehead Protocols
Given a sequence of $N$ independent sources $\mathbf{X}_1,\mathbf{X}_2,\dots,\mathbf{X}_N\sim\{0,1\}^n$, how many of them must be good (i.e., contain some min-entropy) in order to extract a uniformly random string? This question was first raised by Chattopadhyay, Goodman, Goyal and Li (STOC '20), motivated by applications in cryptography, distributed computing, and the unreliable nature of real-world sources of randomness. In their paper, they showed how to construct explicit low-error extracto…

Topology induced modifications in the critical behavior of the Yaldram Khan catalytic reaction model
Paulo F. Gomes, Henrique A. Fernandes, Roberto da Silva
https://arxiv.org/abs/2506.04485

Topology induced modifications in the critical behavior of the Yaldram Khan catalytic reaction model
In this work, we investigated how the use of complex networks as catalytic surfaces can affect the phase diagram of the Yaldram-Khan model, as well as how the order of the phase transitions present in the seminal work behaves when the randomness is added to the model. The study was conducted by taking into consideration two well-known random networks, the Erdos-Renyi network (ERN), with its long-range randomness, and the random geometric graph (RGG), with its spatially constrained randomness. W…

Mathematical proof of errors in Capasso's excess noise factor formula for an n-step staircase multiplier
Ankitha E Bangera
https://arxiv.org/abs/2506.09649

Mathematical proof of errors in Capasso's excess noise factor formula for an n-step staircase multiplier
Solid-state devices such as multistep staircase avalanche photodiodes (APDs) are analogues to the photomultiplier tubes and are considered as a cascade-amplifier. The major source of internal noise in these APDs is due to the randomness in their stepwise impact ionization. Recent literature on staircase APDs by research groups such as Campbell and co-workers have reported the theoretical estimates of total excess noise factors using Capasso's excess noise factor formula. This formula is based o…

On the dynamical evolution of randomness Part B: Geometrisation and the origin of convergence in LLN
Allen Lobo
https://arxiv.org/abs/2506.14804 https://…

On the dynamical evolution of randomness Part B: Geometrisation and the origin of convergence in LLN
In classical probability theory, the convergence of empirical frequencies to theoretical probabilities: as captured by the Law of Large Numbers (LLN): is treated as axiomatic and emergent from statistical assumptions such as independence and identical distribution. In this work, a novel dynamical framework is constructed in which convergence arises as a consequence of structured evolution in outcome space, rather than a statistical postulate. Through this formalism, statistical convergence is d…

This https://arxiv.org/abs/2412.08693 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Random Circuits in the Black Hole Interior
In this paper, we present a quantitative holographic relation between a microscopic measure of randomness and the geometric length of the wormhole in the black hole interior. To this end, we perturb an AdS black hole with Brownian semiclassical sources, implementing the continuous version of a random quantum circuit for the black hole. We use the random circuit to prepare ensembles of states of the black hole whose semiclassical duals contain Einstein-Rosen (ER) caterpillars: long cylindrical w…

On Differential Privacy for Adaptively Solving Search Problems via Sketching
Shiyuan Feng, Ying Feng, George Z. Li, Zhao Song, David P. Woodruff, Lichen Zhang
https://arxiv.org/abs/2506.05503

On Differential Privacy for Adaptively Solving Search Problems via Sketching
Recently differential privacy has been used for a number of streaming, data structure, and dynamic graph problems as a means of hiding the internal randomness of the data structure, so that multiple possibly adaptive queries can be made without sacrificing the correctness of the responses. Although these works use differential privacy to show that for some problems it is possible to tolerate $T$ queries using $\widetilde{O}(\sqrt{T})$ copies of a data structure, such results only apply to numer…

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
Zhidong Zhang
https://arxiv.org/abs/2505.18460 https://

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness. For instance, the Boolean satisfiability (K-SAT) problems are nontrivial, due to the existence of non-planarity graphs, nonlocalities, and the randomness. In this work, the relation between a spin-glass three-dimensional (3D) Ising model with the lattice size N = mnl and the K-SAT problems…

A stochastic model for the diffusion of competing opinions with trend-following, opposition, and indifference
Manuel Gonz\'alez-Navarrete
https://arxiv.org/abs/2506.18313

A stochastic model for the diffusion of competing opinions with trend-following, opposition, and indifference
We study a stochastic model for the diffusion of competing opinions in a population composed of three types of agents: trend-followers, opposers, and indifferent individuals. The decision dynamics are driven by reinforcement mechanisms, modulated by a latent trend process, allowing us to capture realistic features such as amplification, resistance, and randomness in opinion formation. We derive explicit formulas for the finite-time moments of the opinion count vector and establish a set of stro…

Finite-size security analysis for quantum protocols: A Python framework using the Entropy Accumulation Theorem with graphical interface
Piotr Mironowicz, Mohamed Bourennane
https://arxiv.org/abs/2506.18888

Finite-size security analysis for quantum protocols: A Python framework using the Entropy Accumulation Theorem with graphical interface
We present a comprehensive software framework for the finite-size security analysis of quantum random number generation (QRNG) and quantum key distribution (QKD) protocols, based on the Entropy Accumulation Theorem (EAT). Our framework includes both a Python API and an intuitive graphical user interface (GUI), designed to support protocol designers and experimentalists in certifying randomness and key rates under realistic, finite-resource conditions. At its core, the framework automates the co…

This https://arxiv.org/abs/2410.07984 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Large Deviation Analysis for the Reverse Shannon Theorem
Channel simulation is to simulate a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem to Shannon's noisy coding theorem. In contrast to previous works, our approach employs Rényi divergence (with the parameter $α\in(0,\infty)$) to measure the level of approximation. Specifically, we obtain the reverse Shannon theorem under the Rényi divergence, which characterizes the Rényi simulation rate, the minimum communication cost …

The effects of initial conditions on the accuracy of mean-field approximations of Markov processes on large random graphs
Pierfrancesco Dionigi, D\'aniel Keliger
https://arxiv.org/abs/2506.12872

The effects of initial conditions on the accuracy of mean-field approximations of Markov processes on large random graphs
We study the evolution of a general class of stochastic processes (containing, e.g. SIS and SIR models) on large random networks, focusing on a particular general class of random graph models. To approximate the expected dynamics of these processes, we employ a mean-field technique known as the N-Intertwined Mean-Field Approximation (NIMFA). Our primary goal is to quantify the impact of the randomness in the network topology on the accuracy of such approximations. While classical work by Kurtz …

This https://arxiv.org/abs/2309.02073 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Debiased regression adjustment in completely randomized experiments with moderately high-dimensional covariates
Completely randomized experiment is the gold standard for causal inference. When the covariate information for each experimental candidate is available, one typical way is to include them in covariate adjustments for more accurate treatment effect estimation. In this paper, we investigate this problem under the randomization-based framework, i.e., that the covariates and potential outcomes of all experimental candidates are assumed as deterministic quantities and the randomness comes solely fro…

High-Performance Heterodyne Receiver for Quantum Information Processing in a Laser Written Integrated Photonic Platform
Andrea Peri, Giulio Gualandi, Tommaso Bertapelle, Mattia Sabatini, Giacomo Corrielli, Yoann Pi\'etri, Davide Giacomo Marangon, Giuseppe Vallone, Paolo Villoresi, Roberto Osellame, Marco Avesani
https://arxi…

High-Performance Heterodyne Receiver for Quantum Information Processing in a Laser Written Integrated Photonic Platform
Continuous-Variable Quantum Key Distribution (CV-QKD) and Quantum Random Number Generation (CV-QRNG) are critical technologies for secure communication and high-speed randomness generation, exploiting shot-noise-limited coherent detection for their operation. Integrated photonic solutions are key to advancing these protocols, as they enable compact, scalable, and efficient system implementations. In this work, we introduce Femtosecond Laser Micromachining (FLM) on borosilicate glass as a novel …

The Spurious Factor Dilemma: Robust Inference in Heavy-Tailed Elliptical Factor Models
Jiang Hu, Jiahui Xie, Yangchun Zhang, Wang Zhou
https://arxiv.org/abs/2506.05116

The Spurious Factor Dilemma: Robust Inference in Heavy-Tailed Elliptical Factor Models
Factor models are essential tools for analyzing high-dimensional data, particularly in economics and finance. However, standard methods for determining the number of factors often overestimate the true number when data exhibit heavy-tailed randomness, misinterpreting noise-induced outliers as genuine factors. This paper addresses this challenge within the framework of Elliptical Factor Models (EFM), which accommodate both heavy tails and potential non-linear dependencies common in real-world da…

A theory of vectorial probability for quantum correlations
Sheng Feng
https://arxiv.org/abs/2506.12101 https://arxiv.org/pdf/2506.121…

A theory of vectorial probability for quantum correlations
Randomness is a ubiquitous phenomenon that is practically accompanied by physical events described by probability theory. However, probability by definition in the theory is a nonnegative scalar quantity. Here, we propose the concept of vectorial probability, quantified as a vector with interesting but hidden geometry, and develop a theory to describe random events with correlations dictated by this geometry. Based on this theory, we construct a local model that is able to reproduce the predict…