ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “random linear map”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DScs.CCcs.ITTheoreticalRecentOct 26, 2026

Linear Hashing Is Poissonesque

Vinayak M. Kumar

The paper shows that a random linear map behaves similarly to a fully random map in terms of expected loads and concentration of bin loads.

View →
math.PRstat.MLTheoreticalRecentJul 8, 2026

Local large deviations for linear-region growth in random piecewise-linear networks

Recep Özkan, Christian Hirsch

This paper studies a random compositional model for the growth of affine regions in deep piecewise-linear networks and proves the existence of a submultiplicative pressure for the number of affine pie…

View →
cs.ITcs.CCcs.CRTheoreticalRecentJun 23, 2026

Discrepancy for Random Linear Codes

Dean Doron, Tal Leonov, Jonathan Mosheiff, Henrique Navas +2 more

This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.

View →
math.COcs.CGcs.DMTheoreticalRecentJun 8, 2026

Connectivity of Districting Metagraphs

Mehmet Emre, Daniel C. Jerison, Ellen Veomett

This paper proves irreducibility results for a family of Markov chains used in redistricting and gerrymandering analysis.

View →
stat.MLcs.LGmath.OCEmpiricalRecentJun 18, 2026

Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach

Haonan Xu, Yingying Li

This paper proposes a novel algorithm SME-OFU that improves the regret bound for stochastic linear contextual bandits with bounded reward noise.

View →
cs.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

View →
math.PRcs.DMmath.COTheoreticalRecentOct 19, 2026

The rank of the random $k$-XORSAT matrix beyond satisfiability

Amin Coja-Oghlan, Maurice Rolvien

Determines the limiting distribution of the rank of a random $k$-XORSAT matrix beyond the satisfiability threshold.

View →
cs.DScs.CRmath.NTMay 17, 2026

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Ming-Xing Luo

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

View →
cs.ITmath.PRmath.STTheoreticalRecentJun 15, 2026

Testing for a Hidden Geometry in Random Graphs

Amit Silber, Mor Oren-Loberman, Wasim Huleihel

This paper studies the problem of detecting a hidden geometric signal in a random graph.

View →
cs.CRcs.FLcs.MSMar 20, 2026

Cellular Automata based Resource Efficient Maximally Equidistributed Pseudo-Random Number Generators

Bhuvaneswari A, Kamalika Bhattacharjee

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

View →
cs.DScs.DMTheoreticalRecentJun 11, 2026

Random Generation of $k$-coloured Motzkin Paths

Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani

The study investigates k-coloured Motzkin paths and their connection with prefixes ending at odd height from both analytical and combinatorial perspectives.

View →
cs.DSEmpiricalRecentJun 21, 2026

Modular Rank and Linear-Complexity Tests for Pseudorandom Number Generators

Sebastiano Vigna

The paper introduces a modular version of rank and linear-complexity tests for pseudorandom number generators and provides a Rust program, modlin, to detect statistical bias in generators that are lin…

View →
cs.NEcs.CEEmpiricalRecentJul 8, 2026

Sampling on Random Subspaces under Limited Data in the Context of Exploratory Landscape Analysis

Iván Olarte Rodríguez, Anja Jankovic, Thomas Bäck, Elena Raponi

This paper proposes a new sampling strategy for Exploratory Landscape Analysis using random linear embeddings to improve the robustness of landscape descriptors when budgets are limited.

View →
cs.DScs.CCTheoreticalRecentJun 11, 2026

Sketching Intersection Profiles: A Simple Proof and Three Applications

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi +2 more

This paper settles the complexity of three sketching problems in graphs and distributions.

View →
cs.DCcs.DSTheoreticalRecentAug 13, 2026

Triangle-Free Coloring in LOCAL via Resilient Lovász Local Lemma

Peter Davies-Peck, Xusheng Zhang

This paper adapts the distributed triangle-free coloring algorithm of Pettie and Su to solve LLL instances in logarithmic rounds, eliminating the LLL steps as the bottleneck.

View →
cs.LGcs.AIRecentMay 31, 2026

Strong Stochastic Flow Maps

Sam McCallum, Zander W. Blasingame, Timothy Herschell, Niklas Rindtorff +2 more

The paper introduces Strong Stochastic Flow Maps (SSFMs), a novel framework that directly learns the strong solution map of additive-noise Stochastic Differential Equations (SDEs), enabling few-step s…

View →