Tootfinder

🎲 Randomness reveals hidden order in the plant world
#plants

Randomness reveals hidden order in the plant world
In the intricate architecture of plant tissues, beauty often emerges from chaos, according to new research from Cornell researchers. Findings from a recent study show how randomness and growth together create the striking cellular patterns that shape plant organs—and perhaps all multicellular life.

Randomization Restrictions: Their Impact on Type I Error When Experimenting with Finite Populations
Jonathan J. Chipman, Oleksandr Sverdlov, Diane Uschner
https://arxiv.org/abs/2510.07153

Randomization Restrictions: Their Impact on Type I Error When Experimenting with Finite Populations
Participants in clinical trials are often viewed as a unique, finite population. Yet, statistical analyses often assume that participants were randomly sampled from a larger population. Under Complete Randomization, Randomization-Based Inference (RBI; a finite population inference) and Analysis of Variance (ANOVA; a random sampling inference) provide asymptotically equivalent difference-in-means tests. However, sequentially-enrolling trials typically employ restricted randomization schemes, suc…

Haar random codes attain the quantum Hamming bound, approximately
Fermi Ma, Xinyu Tan, John Wright
https://arxiv.org/abs/2510.07158 https://arxiv.org/pdf/2…

Haar random codes attain the quantum Hamming bound, approximately
We study the error correcting properties of Haar random codes, in which a $K$-dimensional code space $\boldsymbol{C} \subseteq \mathbb{C}^N$ is chosen at random from the Haar distribution. Our main result is that Haar random codes can approximately correct errors up to the quantum Hamming bound, meaning that a set of $m$ Pauli errors can be approximately corrected so long as $mK \ll N$. This is the strongest bound known for any family of quantum error correcting codes (QECs), and continues a li…

Using dense graph limit theory to count cocycles of random simplicial complexes
Andr\'as M\'esz\'aros
https://arxiv.org/abs/2509.06559 https://…

Using dense graph limit theory to count cocycles of random simplicial complexes
We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to prove results about the homology of random $2$-dimensional simplicial complexes. More specifically, we prove that if $T_n$ is a random $2$-dimensional determinantal hypertree on $n$ vertices and $p$ is any prime, then \[\frac{\dim H_1(T_n,\mathbb{F}_p)}{n^2}\]…

Docs: Oracle generated ~$900M from its Nvidia cloud server rental business, with a $125M gross profit, or a 14% margin, vs. its ~70% overall gross profit margin (The Information)
https://www.theinformation.com/articles/internal-oracl…

Internal Oracle Data Show Financial Challenge of Renting Out Nvidia Chips
Oracle became the best-performing megacap stock of 2025 after its executives said last month that the once-sleepy database firm will generate an astonishing $381 billion in revenue from renting out specialized cloud servers to OpenAI and other artificial intelligence developers over the next ...

Random Soul's Podcast
An independent record label owned and operated by Australia's leading House Music Producers, Yogi and Husky, aka Random Soul...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/random-soul/

🇺🇦 #NowPlaying on KEXP's #MechanicalBreakdown
Random Access:
🎵 Interceptor
#RandomAccess
https://open.spotify.com/track/5jkmFO4xVDJE7sghpnuvjm

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
Guan-Yu Chen, Xi Yang
https://arxiv.org/abs/2509.06856 https://

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
We propose a novel randomized framework for the estimation problem of large-scale linear statistical models, namely Sequential Least-Squares Estimators with Fast Randomized Sketching (SLSE-FRS), which integrates Sketch-and-Solve and Iterative-Sketching methods for the first time. By iteratively constructing and solving sketched least-squares (LS) subproblems with increasing sketch sizes to achieve better precisions, SLSE-FRS gradually refines the estimators of the true parameter vector, ultimat…

Randomness in Narrative Video Games: Aesthetics of Different Random Systems
https://azhdarchid.com/randomness-in-narrative-video-games-aesthetics-of-different-random-systems/
Some of these considerations & differences als…

Randomness in Narrative Video Games: Aesthetics of Different Random Systems
On virtual dice, cards, and other alternatives.

On defining Kemeny's constant for non-backtracking random walks
Jane Breen, Mark Kempton, Adam Knudson, Matthew Shumway
https://arxiv.org/abs/2510.06650 https://

On defining Kemeny's constant for non-backtracking random walks
We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that these two definitions coincide for edge-transitive graphs, and give a condition generalizing edge-transitive for which equality holds, and investigate by how much they can differ in general. We compute our non-backtracking Kemeny's constant for several families of graphs.