Tootfinder

Le randonneur québécois qui n’a pu être retrouvé Š temps
https://www.lapresse.ca/actualites/justice-et-faits-divers/2025-05-29/le-randonneur-quebecois-qui-n-a-pu-etre-retrouve-a-temps.php…

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 …

Interessante, isto.
(mesmo que o abacate, francamente, fosse muito dispensšvel. É um sorvedouro de šgua, aquilo)
https://eco.sapo.pt/2025/08/28/do-emprego-ao-rendimento-um-raio-x-a-agricultura-algarvia/

Do emprego ao rendimento, um raio-x à agricultura algarvia
Radiografia à atividade agrícola no Algarve mostra que setor está em forte crescimento, gera riqueza, emprego, apesar da escassez de água na região.

Why Are Parsing Actions for Understanding Message Hierarchies Not Random?
Daichi Kato, Ryo Ueda, Yusuke Miyao
https://arxiv.org/abs/2506.22366 https://

Why Are Parsing Actions for Understanding Message Hierarchies Not Random?
If humans understood language by randomly selecting parsing actions, it might have been necessary to construct a robust symbolic system capable of being interpreted under any hierarchical structure. However, human parsing strategies do not seem to follow such a random pattern. Why is that the case? In fact, a previous study on emergent communication using models with hierarchical biases have reported that agents adopting random parsing strategies$\unicode{x2013}$ones that deviate significantly …

Google Fotos: Neue Funktionen zum 10. Geburtstag
Google Fotos wird 10 Jahre alt. Anlässlich des runden Jubiläums schenkt Google der Foto-App neue Funktionen und ein Redesign des Editors. 
https://www.

from my link log —
Basic facts about GPUs.
https://damek.github.io/random/basic-facts-about-gpus/
saved 2025-06-22 https:…

Evasive Random Walks and the Clairvoyant Demon
Aaron Abrams, Henry Landau, Zeph Landau, James Pommersheim, Eric Zaslow
https://arxiv.org/abs/2506.21929 htt…

Evasive Random Walks and the Clairvoyant Demon
A pair of random walks $(R,S)$ on the vertices of a graph $G$ is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along $R$ and $S$ without colliding. We consider questions related to P. Winkler's {\it clairvoyant demon problem}, which asks whether for random walks $R$ and $S$ on $G$, $Pr[\ (R,S) \mbox{ is successful }] >0$. We introduce the notion of an {\it evasive} walk on $G$: a walk $S$ so that for a random walk $R$ on $G$, $Pr[\ (R,S) \mbox{ is s…

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

Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton
A substantial body of work in machine learning (ML) and randomized numerical linear algebra (RandNLA) has exploited various sorts of random sketching methodologies, including random sampling and random projection, with much of the analysis using Johnson--Lindenstrauss and subspace embedding techniques. Recent studies have identified the issue of inversion bias -- the phenomenon that inverses of random sketches are not unbiased, despite the unbiasedness of the sketches themselves. This bias pres…

Random braids and random walks on finite groups
Heorhii Zhylinskyi
https://arxiv.org/abs/2507.21999 https://arxiv.org/pdf/2507.21999

Random braids and random walks on finite groups
In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting elements of random walk on a Coxeter group to a braid group.