Pages that link to "Item:Q5470721"
From MaRDI portal
The following pages link to On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph (Q5470721):
Displaying 36 items.
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Separating sublinear time computations by approximate diameter (Q849140) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Level-based analysis of the univariate marginal distribution algorithm (Q1725648) (← links)
- A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- Small deviations of sums of independent random variables (Q2010615) (← links)
- Motif estimation via subgraph sampling: the fourth-moment phenomenon (Q2131263) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- On monotonicity of Ramanujan function for binomial random variables (Q2244567) (← links)
- A sharp estimate for probability distributions (Q2273739) (← links)
- Three convolution inequalities on the real line with connections to additive combinatorics (Q2329261) (← links)
- On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (Q3580951) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Combinatorial anti-concentration inequalities, with applications (Q4958638) (← links)
- Comparing node degrees in probabilistic networks (Q4958787) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- Edge estimation with independent set oracles (Q4993304) (← links)
- On the Complexity of Sampling Vertices Uniformly from a Graph (Q5002838) (← links)
- (Q5009503) (← links)
- (Q5091015) (← links)
- (Q5091207) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- Separating Sublinear Time Computations by Approximate Diameter (Q5505645) (← links)
- (Q5743463) (← links)
- Optimizing stakes in simultaneous bets (Q5881787) (← links)
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
- Marchenko-Pastur law for a random tensor model (Q6110561) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
- On a Conjecture of Feige for Discrete Log-Concave Distributions (Q6187075) (← links)
- Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)
