Pages that link to "Item:Q4736772"

The following pages link to Large deviations for sums of partly dependent random variables (Q4736772):

Displaying 42 items.

• Group-wise semiparametric modeling: a SCSE approach (Q321904) (← links)
• Limit behaviors of random connected graphs driven by a Poisson process (Q394844) (← links)
• Hölder-type inequalities and their applications to concentration and correlation bounds (Q505059) (← links)
• On-line approximate string matching with bounded errors (Q653329) (← links)
• Sharp threshold for percolation on expanders (Q662426) (← links)
• On triangle estimation using tripartite independent set queries (Q825973) (← links)
• Penalized cluster analysis with applications to family data (Q901606) (← links)
• \(t\)-wise independence with local dependencies (Q963369) (← links)
• Hoeffding's inequality for sums of dependent random variables (Q1693395) (← links)
• Renewal theory for asymmetric \(U\)-statistics (Q1722026) (← links)
• Stable limit theorems for empirical processes under conditional neighborhood dependence (Q1740523) (← links)
• Weighted dependency graphs (Q1990226) (← links)
• Multi-point Gaussian states, quadratic-exponential cost functionals, and large deviations estimates for linear quantum stochastic systems (Q2019985) (← links)
• Improved Hoeffding inequality for dependent bounded or sub-Gaussian random variables (Q2038279) (← links)
• When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence (Q2070641) (← links)
• Quenched law of large numbers and quenched central limit theorem for multiplayer leagues with ergodic strengths (Q2108894) (← links)
• Estimating the number of connected components in a graph via subgraph sampling (Q2174974) (← links)
• Localization in random geometric graphs with too many edges (Q2179590) (← links)
• Central moment inequalities using Stein's method (Q2201505) (← links)
• No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
• On the Bennett-Hoeffding inequality (Q2438252) (← links)
• Finding the seed of uniform attachment trees (Q2631843) (← links)
• Data-driven verification of stochastic linear systems with signal temporal logic constraints (Q2665419) (← links)
• Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence (Q2672967) (← links)
• Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
• On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
• Equitable coloring of random graphs (Q3055766) (← links)
• A tail bound for read-<i>k</i>families of functions (Q3192374) (← links)
• On the number of generalized Sidon sets (Q3382921) (← links)
• Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
• A Class of Random Cantor Measures, with Applications (Q4608905) (← links)
• Limiting Spectral Distribution for Large Sample Covariance Matrices with Graph-Dependent Elements (Q5046631) (← links)
• (Q5053318) (← links)
• New bounds on Cantor maximal operators (Q5057805) (← links)
• Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks (Q5066493) (← links)
• Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations (Q5107065) (← links)
• Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples (Q5137942) (← links)
• Local limits of spatial Gibbs random graphs (Q5208900) (← links)
• CLT-related large deviation bounds based on Stein's method (Q5426467) (← links)
• Strong approximation of Gaussian \(\beta\) ensemble characteristic polynomials: the hyperbolic regime (Q6103977) (← links)
• Structured model selection via ℓ1−ℓ2 optimization (Q6141559) (← links)
• Concentration inequality and the weak law of large numbers for the sum of partly negatively dependent \(\varphi\)-subgaussian random variables (Q6152239) (← links)