Probabilistic methods for algorithmic discrete mathematics
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
The articles of this volume will be reviewed individually. Indexed articles: \textit{Molloy, Michael}, The probabilistic method, 1-35 [Zbl 0918.05092] \textit{Frieze, Alan M.; Reed, Bruce}, Probabilistic analysis of algorithms, 36-92 [Zbl 0980.65153] \textit{Motwani, Rajeev; Raghavan, Prabhakar}, An overview of randomized algorithms, 93-115 [Zbl 0916.68070] \textit{Jerrum, Mark}, Mathematical foundations of the Markov chain Monte Carlo method, 116-165 [Zbl 0920.65001] \textit{Welsh, Dominic}, Percolation and the random cluster model: Combinatorial and algorithmic problems, 166-194 [Zbl 0916.60085] \textit{McDiarmid, Colin}, Concentration, 195-248 [Zbl 0927.60027] \textit{Devroye, Luc}, Branching processes and their applications in the analysis of tree structures and tree algorithms, 249-314 [Zbl 0924.60077]
- Data-driven robust chance constrained problems: a mixture model approach
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
- Curve reconstruction from noisy samples
- A scaling limit for the length of the longest cycle in a sparse random graph
- Spectrum of heavy-tailed elliptic random matrices
- Tree/endofunction bijections and concentration inequalities
- Concentration of Markov chains indexed by trees
- Covering the edges of a random hypergraph by cliques
- Central moment inequalities using Stein's method
- Faster rumor spreading with multiple calls
- Cover time in edge-uniform stochastically-evolving graphs
- Quantized compressed sensing for random circulant matrices
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
- Counting in one-hop beeping networks
- RIPless compressed sensing from anisotropic measurements
- Average case recovery analysis of tomographic compressive sensing
- Semi-supervised statistical region refinement for color image segmentation
- Broadcast in the rendezvous model
- Approximation schemes for scheduling and covering on unrelated machines
- Radiocoloring in planar graphs: Complexity and approximations
- A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs
- Randomized approximation for the set multicover problem in hypergraphs
- The loss of serving in the dark
- scientific article; zbMATH DE number 1643840 (Why is no real title available?)
- Critical window for the vacant set left by random walk on random regular graphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- On dynamic monopolies of graphs with probabilistic thresholds
- Probabilistic-algebraic algorithms of Monte Carlo methods
- On weak twins and up-and-down sub-permutations
- Serving in the dark should be done non-uniformly
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- On dynamic monopolies of graphs with general thresholds
- scientific article; zbMATH DE number 1197458 (Why is no real title available?)
- Compressing interactive communication under product distributions
- Bisecting sparse random graphs
- Visualization of distributed algorithms based on graph relabelling systems
- Combinatorial anti-concentration inequalities, with applications
- An improved upper bound on the density of universal random graphs
- Critical window for the vacant set left by random walk on the configuration model
- Dynamic double auctions: toward first best
- A general framework for graph sparsification
- Window-Games between TCP Flows
- Dimension reduction for finite trees in \(\ell_1\)
- scientific article; zbMATH DE number 7771747 (Why is no real title available?)
- A scaling limit for the length of the longest cycle in a sparse random digraph
- Maximal inequalities and some applications
- Distributionally robust Weber problem with uncertain demand
- Ordered unavoidable sub-structures in matchings and random matchings
- A strengthened asymptotic uniform distribution property
- Cross-validation on extreme regions
- Colorings of k-sets with low discrepancy on small sets
- Environment viewed from the particle and slowdown for ballistic RWRE in low dimensions
- Extreme eigenvalues of Laplacian random matrices with Gaussian entries (with an appendix by Santiago Arenas-Velilla and Victor Perez-Abreu)
- A probabilistic cellular automaton that admits no successful basic i.i.d. coupling
- Uniform generalization bounds on data-dependent hypothesis sets via PAC-Bayesian theory on random sets
- Online k-means clustering on arbitrary data streams
- Largest bipartite sub-matchings of a random ordered matching or a problem with socks
- Soft memberships for spectral clustering, with application to permeable language distinction
- Window-games between TCP flows
This page was built for publication: Probabilistic methods for algorithmic discrete mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1270418)
