:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kapoor, Nicholas, Staecker, P. Christopher
Format:	Preprint
Published:	2024
Subjects:	Computers and Society Combinatorics Probability
Online Access:	https://arxiv.org/abs/2405.09009
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hiring Strategies
by: Krapivsky, P. L.
Published: (2024)

Improving the Computational Efficiency of Adaptive Audits of IRV Elections
by: Ek, Alexander, et al.
Published: (2024)

Efficient Weighting Schemes for Auditing Instant-Runoff Voting Elections
by: Ek, Alexander, et al.
Published: (2024)

The Negative Participation Paradox in Three-Candidate Instant Runoff Elections
by: McCune, David, et al.
Published: (2024)

Counting the number of group orbits by marrying the Burnside process with importance sampling
by: Diaconis, Persi, et al.
Published: (2025)

Probabilistic enumeration and equivalence of nonisomorphic trees
by: Stufler, Benedikt
Published: (2023)

Probabilistic $(m,n)$-Parking Functions
by: Harris, Pamela E., et al.
Published: (2025)

Counting partial Hadamard matrices in the cubic regime
by: Davis, Damek
Published: (2026)

Counting graphic sequences via integrated random walks
by: Balister, Paul, et al.
Published: (2023)

Counting quadrant walks via Tutte's invariant method
by: Bernardi, Olivier, et al.
Published: (2017)

Counting quadrant walks via Tutte's invariant method (extended abstract)
by: Bernardi, O, et al.
Published: (2015)

Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph $G(n,m)$: The Lower Tail
by: Alvarado, José, et al.
Published: (2024)

Probabilistic nilpotence in infinite groups
by: Martino, Armando, et al.
Published: (2018)

Instant Runoff Voting and the Reinforcement Paradox
by: McCune, David, et al.
Published: (2025)

Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals
by: Christo, Nicholas, et al.
Published: (2024)

Multiplexons: Limits of Multiplex Networks
by: Ganguly, Ankan, et al.
Published: (2025)

Counting words without strictly increasing subwords of fixed length
by: Sekhon, Senan
Published: (2025)

Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)

Eigenvalue gaps of the Laplacian of random graphs
by: Christoffersen, Nicholas, et al.
Published: (2024)

On the scaling of random Tamari intervals and Schnyder woods of random triangulations (with an asymptotic D-finite trick)
by: Chapuy, Guillaume
Published: (2024)

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
by: Draganov, Ondřej, et al.
Published: (2025)

An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds
by: Kush, Deepanshu
Published: (2026)

A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case
by: Hackl, Benjamin, et al.
Published: (2025)

On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)

Tree-indexed sums of Catalan numbers
by: Bostan, Alin, et al.
Published: (2025)

Permanents of random matrices over finite fields
by: Hunter, Zach, et al.
Published: (2026)

Optimal Union Probability Interval Is NP-Hard
by: Kaski, Petteri, et al.
Published: (2026)

The Greedy Algorithm for Dissociated Sets
by: Dutta, Sayan
Published: (2026)

Approximate Counting in Local Lemma Regimes
by: Mann, Ryan L., et al.
Published: (2025)

Inference of Hierarchical Core-Periphery Structure in Temporal Networks
by: Faust, Theodore Y., et al.
Published: (2025)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
by: Gamarnik, David, et al.
Published: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2026)

Percolation transition for random forests in $d\geq 3$
by: Bauerschmidt, Roland, et al.
Published: (2021)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
by: Marić, Nevena
Published: (2025)

The Face Group of a Simplicial Complex
by: Lupton, Gregory, et al.
Published: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
by: Higl, Hendrik
Published: (2026)

Rapid mixing of the flip chain over non-crossing spanning trees
by: Anand, Konrad, et al.
Published: (2024)