A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
From MaRDI portal
Publication:5814290
DOI10.1214/aoms/1177729330zbMath0048.11804OpenAlexW2042587503WikidataQ56430037 ScholiaQ56430037MaRDI QIDQ5814290
Publication date: 1952
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729330
Related Items
A probabilistic framework for problems with real structured uncertainty in systems and control, Disjointly representing set systems, A self-normalized Erdős-Rényi type strong law of large numbers, Designing algorithms by expectations, Speed of convergence of the least-squares estimator in autoregressive models, Nonclairvoyant scheduling, Extended large deviations, Convergence rates for posterior distributions and adaptive estimation, Fast approximate probabilistically checkable proofs, On large deviation expansion of distribution of maximum likelihood estimator and its application in large sample estimation, A problem of Füredi and Seymour on covering intersecting families by pairs, Generalized divergence measures and the probability of error, Minimax Euclidean separation rates for testing convex hypotheses in \(\mathbb{R}^{d}\), Blinking model and synchronization in small-world networks with a time-varying coupling, Perturbation analysis of the \(GI/GI/1\) queue, Large deviations for fields with stationary independent increments, The mean residual life function at great age: Applications to tail estimation, Expected complexity of graph partitioning problems, Adaptive decision making for stochastic processes, A design of a parallel dictionary using skip lists, Randomized routing on generalized hypercubes, Undecidable statements and random graphs, The sharp threshold for making squares, Exponential bounds for the tail probability of the supremum of an inhomogeneous random walk, Self-normalized large deviations, A large deviation principle for \(m\)-variate von Mises-statistics and \(U\)- statistics, Learning fallible deterministic finite automata, Optimal convergence rates and asymptotic efficiency of point estimators under truncated distribution families, Self-normalization: taming a wild population in a heavy-tailed world, Functional Erdős-Rényi laws for processes indexed by sets, Efficient massively parallel implementation of some combinatorial algorithms, Random induced subgraphs of generalized \(n\)-cubes, Independence number and the complexity of families of sets, On some conjectures of Graffiti, Some properties of the Hellinger transform and its application in classification problems, Simultaneous approximation of the Feller operator, Large deviations for combinatorial distributions. I: Central limit theorems, Fluctuations of shapes of large areas under paths of random walks, A lower bound for irredundant Ramsey numbers, Size-estimation framework with applications to transitive closure and reachability, A provisioning problem with stochastic payments, Direct scaling analysis of localization in single-particle quantum systems on graphs with diagonal disorder, Large deviations for sums of bounded functions of a normalized sample under gamma distribution, Optimal bounds for the approximation of Boolean functions and some applications, Probabilistic robustness analysis: Explicit bounds for the minimum number of samples, Analysis and application of adaptive sampling, Entropic value-at-risk: a new coherent risk measure, A note on interference in random networks, Faster deterministic sorting through better sampling., When does a random Robin Hood win?, How to use several noisy channels with unknown error probabilities, An improved reliability bound of a probabilistic parallel integer sorting algorithm, Bayesian efficiency, Bipartite Ramsey numbers of paths for random graphs, Gustav Elfving's impact on experimental design., On string matching with mismatches, Probabilistic robust design of control systems for high-fidelity cyber-physical testing, Sparse multipartite graphs as partition universal for graphs with bounded degree, Chernoff index for Cox test of separate parametric families, Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs, On large deviations in testing simple hypotheses for locally stationary Gaussian processes, Moderate deviations for M-estimators in linear models with \(\phi\)-mixing errors, Local information and the design of sequential hypothesis tests, Integer sets with prescribed pairwise differences being distinct, Chernoff distance for conditionally specified models, Systematic mistakes are likely in bounded optimal decision-making systems, Phase transition for accessibility percolation on hypercubes, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, A note on the global offensive alliances in graphs, A probabilistic analysis of the maximal covering location problem, A general lower bound on the number of examples needed for learning, A simple linear expected time algorithm for finding a Hamilton path, Probabilistic analysis of a heuristic for the dual bin packing problem, Average-case analysis of the modified harmonic algorithm, Large deviations for functionals of stationary processes, Convexity and logical analysis of data, Effective bandwidths and performance bounds in high-speed communication systems, Random sampling and greedy sparsification for matroid optimization problems, Large deviation theorems for extended random variables and some applications, A new integral nonparametric test for the affine symmetry hypothesis, A large deviation theorem for \(U\)-processes, Elements of a theory of computer simulation. I, Chernoff-type bound for finite Markov chains, A near-optimal polynomial time algorithm for learning in certain classes of stochastic games, Large-deviation theorems in hypothesis-testing problems, Large-deviation probability and the local dimension of sets, Asymptotic approximations for error probabilities of sequential or fixed sample size tests in exponential families., Random subgraphs of Cayley graphs over \(p\)-groups, On generalized Ramsey theory: The bipartite case, The extremal function for complete minors, Signed domination in regular graphs and set-systems, Randomized path coloring on binary trees., On the decisional complexity of problems over the reals, Statistical learning control of uncertain systems: theory and algorithms., Information and entropy econometrics -- editor's view., Chernoff efficiency of the sign and Wilcoxon tests for testing the symmetry hypothesis, Singular stationary measures are not always fractal, The passport control problem or how to keep a dynamic service system load balanced?, The complexity of theory revision, An estimate of the probabilities of deviation of the sample mean, Thermodynamic Bayesian model comparison, Central limit theorems of partial sums for large segmental values, Directed drift: A new linear threshold algorithm for learning binary weights on-line, Asymptotic efficiency of majority rule relative to rank-sum method for selecting the best population, A survey of randomized algorithms for control synthesis and performance verification, Posterior probabilities: nonmonotonicity, asymptotic rates, log-concavity, and Turán's inequality, Fast message dissemination in random geometric networks, Tight bounds on the expected runtime of a standard steady state genetic algorithm, Boundedness and concentration of random singular integrals defined by wavelet summability kernels, Minimum \(H\)-decompositions of graphs, On the Chernoff bound for efficiency of quantum hypothesis testing, Probabilistic integer sorting, Stochastic algorithms for robustness of control performances, A cell-based population control of Monte Carlo particles for the global variance reduction for transport equations, The evolution of the random reversal graph, LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization, Multiscale geometric methods for data sets. I: Multiscale SVD, noise and curvature., PALO: a probabilistic hill-climbing algorithm, Probabilistic constructions in generalized quadrangles, Obfuscated fuzzy Hamming distance and conjunctions from subset product problems, Rate optimal Chernoff bound and application to community detection in the stochastic block models, Theoretically extensible quantum digital signature with starlike cluster states, Statistical inference for the intensity in a partially observed jump diffusion, Estimation of the hardness of the learning with errors problem with a restricted number of samples, Smart sampling and incremental function learning for very large high dimensional data, Geometry of quantum phase transitions, Time-uniform Chernoff bounds via nonnegative supermartingales, On detection of Gaussian stochastic sequences, Chernoff information between Gaussian trees, Learning under \(p\)-tampering poisoning attacks, Exponential bounds for minimum contrast estimators, Almost Euclidean sections in symmetric spaces and concentration of order statistics, Exact group sequential methods for estimating a binomial proportion, Costly information acquisition. Is it better to toss a coin?, Asymptotic properties for M-estimators in linear models with dependent random errors, Problems of ruin and survival in economics: applications of limit theorems in probability, Gaussian concentration bound and ensemble equivalence in generic quantum many-body systems including long-range interactions, A reference-invariant health disparity index based on Rényi divergence, Classification with guaranteed probability of error, Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination, Arthur-Merlin games in Boolean decision trees, Upper bounds on the global offensive alliances in graphs, Efficient algorithmic learning of the structure of permutation groups by examples, Fano's inequality for random variables, Second-order asymptotics for quantum hypothesis testing, On semiparametric statistical inferences in the moderate deviation zone, Hypothesis testing via Euclidean separation, Recursive robust estimation and control without commitment, Probabilistic distance measures of the Dirichlet and beta distributions, \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration, Goodness-of-fit tests via phi-divergences, A large deviation inequality for vector functions on finite reversible Markov chains, Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples, Validity indices for clusters of uncertain data objects, Exponential tail bounds for chisquared random variables, Improved statistical fluctuation analysis for measurement-device-independent quantum key distribution, Convergence of \(k\) nearest neighbor kernel estimator in nonparametric functional regression, Toward a tight upper bound for the error probability of the binary Gaussian classification problem, Faster estimates of the mean of bounded random variables, Discriminative extended canonical correlation analysis for pattern set matching, Bounds on the sample complexity for private learning and private data release, Characterization of product anti-magic graphs of large order, On random stable partitions, Approximating the online set multicover problems via randomized winnowing, Performance bounds for mismatched decision schemes with Poisson process observations, Item response theory with estimation of the latent population distribution using spline-based densities, Fourier concentration from shrinkage, Meet and merge: approximation algorithms for confluent flows, Radio communication in random graphs, Minima in branching random walks, Euclidean lattices, theta invariants, and thermodynamic formalism, Nonparametric regression with additional measurement errors in the dependent variable, Research on probabilistic methods for control system design, Macroeconomic uncertainty prices when beliefs are tenuous, Large deviations for M-estimators, Expected time analysis of a simple recursive Poisson random variate generator, On joint conditional complexity (entropy), Some rainbow cycles in \(r\)-good edge-colorings, Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction, Toward the history of the St. Petersburg school of probability and statistics. IV: Characterization of distributions and limit theorems in statistics, Time-uniform, nonparametric, nonasymptotic confidence sequences, Smoothing spline regression estimation based on real and artificial data, Clustering in a hyperbolic model of complex networks, Estimation of a density using an improved surrogate model, Asymptotic enumeration of linear hypergraphs with given number of vertices and edges, Bipartite Ramsey numbers of cycles for random graphs, A constructive proof of a concentration bound for real-valued random variables, Information geometry of reversible Markov chains, Beyond conventional security in sponge-based authenticated encryption modes, On the reliability roots of simplicial complexes and matroids, Localized Fourier analysis for graph signal processing, Some implications of interval approach to dimension for network complexity, Randomized methods for design of uncertain systems: sample complexity and sequential algorithms, Aggregating estimates by convex optimization, Learning Poisson binomial distributions, Global and individualized community detection in inhomogeneous multilayer networks, Noisy beeping networks, Forbidding intersection patterns between layers of the cube, Properties of noncommutative Rényi and Augustin information, On coupon colorings of graphs, On solving LPN using BKW and variants, Implementation and analysis, Large deviations principle for white noise distributions with growth condition, Indirect acquisition of information in quantum mechanics, Strongly continuous and locally equi-continuous semigroups on locally convex spaces, Multilevel hybrid Chernoff tau-leap, Search cost for a nearly optimal path in a binary tree, Guarantees for the success frequency of an algorithm for finding Dodgson-election winners, On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences, Edge-disjoint rainbow spanning trees in complete graphs, On the runtime and robustness of randomized broadcasting, Hypothesis testing via affine detectors, Discriminating quantum states: the multiple Chernoff distance, Command-based importance sampling for statistical model checking, The behavior of the generator normalization factor in approximation of random processes, Note on the structure of Kruskal's algorithm, Biobjective robust optimization over the efficient set for Pareto set reduction, Subjective interestingness of subgraph patterns, The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels, Agent-based randomized broadcasting in large networks, Convergence rates of large deviations probabilities for point estimators, Applications of large deviations to optimal experimental designs, Approximating majority depth, Probabilities of large deviations in topological spaces. I, Large population limits for evolutionary dynamics with random matching, Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks, Binary templates for comma-free DNA codes, On large deviations for Poisson stochastic integrals, The misclassification error of the maximum likelihood procedure when deciding among a finite choice of distributions, A subdiffusive behaviour of recurrent random walk in random environment on a regular tree, Second-order efficient test for inhomogeneous Poisson processes, A reversion of the Chernoff bound, Approximation algorithms for multiprocessor scheduling under uncertainty, Randomised broadcasting: memory vs. randomness, Reducing reinforcement learning to KWIK online regression, Random induced subgraphs of Cayley graphs induced by transpositions, On large deviations in testing Ornstein-Uhlenbeck-type models, Confidence-based reasoning in stochastic constraint programming, Robust cutpoints in the logical analysis of numerical data, Minimum \(H\)-decompositions of graphs: edge-critical case, Law of large numbers in an epidemic model, Some results on approximate 1-median selection in metric spaces, An elementary proof of the lower bound of Cramér's theorem in \(\mathbb R^d\), Classification when the covariate vectors have unequal dimensions, Efficient computation of approximate isomorphisms between Boolean functions, Uniform accuracy of the maximum likelihood estimates for probabilistic models of biological sequences, Asymptotic properties of posterior distributions in nonparametric regression with non-Gaussian errors, Limiting behavior of relative Rényi entropy in a non-regular location shift family, Spreading of messages in random graphs, Communication and energy efficient routing protocols for single-hop radio networks, Pricing of American options in discrete time using least squares estimates with complexity penalties, Spatial birth-death swap chains, The adaptable choosability number grows with the choosability number, Total progeny in killed branching random walk, Nonparametric signal detection with small type I and type II error probabilities, Randomly colouring graphs (a combinatorial view), The saga of minimum spanning trees, Robust control of uncertain systems: classical results and recent developments, Efficient distributed sensing using adaptive censoring-based inference, Colouring graphs when the number of colours is almost the maximum degree, Noise sensitivity in continuum percolation, Confidence intervals for the Shapley-Shubik power index in Markovian games, Chernoff distance for truncated distributions, System identification in the presence of outliers and random noises: a compressed sensing approach, Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions, The horseshoe estimator: posterior concentration around nearly black vectors, Neighborhood-based uncertainty generation in social networks, Hypothesis testing by convex optimization, Discussion of ``Hypothesis testing by convex optimization, Rejoinder of ``Hypothesis testing by convex optimization, On the distances between certain distributions in multivariate statistical analysis, Uniform asymptotic properties of a nonparametric regression estimator of conditional tails, Randomized multipacket routing and sorting on meshes, Fast randomized parallel methods for planar convex hull construction, Improved parallel approximation of a class of integer programming problems, Bayesian signal detection with compressed measurements, Randomized approximation of bounded multicovering problems, Profile forward regression screening for ultra-high dimensional semiparametric varying coefficient partially linear models, Tight bounds for active self-assembly using an insertion primitive, The influence of large coalitions, Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy, The total path length of split trees, EL inference for partially identified models: large deviations optimality and bootstrap validity, User-friendly tail bounds for sums of random matrices, Solution to a function equation and divergence measures, Exact computation of minimum sample size for estimation of binomial parameters, Robustness and ambiguity in continuous time, Analysis of least squares regression estimates in case of additional errors in the variables, Thermodynamic uncertainty relations and irreversibility, Bootstrap-calibrated interval estimates for latent variable scores in item response theory, Fractional motions, Examining socioeconomic health disparities using a rank-dependent Rényi index, A provably efficient algorithm for dynamic storage allocation, Exponential bounds for the running time of a selection algorithm, Some inequalities relating to the partial sum of binomial probabilities, On the maximum cardinality of a consistent set of arcs in a random tournament, On the minimum order of graphs with given semigroup, Probabilities of large and moderate deviations for maximum likelihood estimates, On parallel integer sorting, An upward measure separation theorem, Learning and generalization errors for the 2D binary perceptron., Large triangle-free subgraphs in graphs without \(K_ 4\), Random homeomorphisms, On convergence of conditional probability measures, Large deviations and asymptotic efficiency of a statistic of integral type. II, Multidimensional large deviation local limit theorems, Large deviations of uniformly recurrent Markov additive processes, The distribution of the finitely many times in the strong law of large numbers, Probabilistic methods, On the shape of the convex hull of random points, Local Bahadur efficiency of score tests, Communication-efficient parallel algorithms for distributed random-access machines, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Packing items from a triangular distribution, Does co-NP have short interactive proofs ?, A parallel bucket sort, Edge-colouring random graphs, Applications of the theory of records in the study of random trees, Broadcasting with random faults, Probabilities of large deviations for random fields, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Measures of distance between probability distributions, Knowing what doesn't matter: exploiting the omission of irrelevant data, Some first passage problems related to cusum procedures, Some new properties of the Bechhofer-Kiefer-Sobel stopping rule, Reprint of: Approximating majority depth, Semi-degree threshold for anti-directed Hamiltonian cycles, A relation between the Chernoff index and the Pitman efficacy, Allocating observations between two normal populations to maximize the half slope of the F-test, A guided tour of Chernoff bounds, Bahadur efficiency of the F-test, A note on the asymptotic efficiency of the Sobel-Wald test, 0-1 laws and decision problems for fragments of second-order logic, Roth's estimate of the discrepancy of integer sequences is nearly sharp, Irregularities of two-colourings of the NxN square lattice, Processor sharing: a survey of the mathematical theory, Large deviations in testing fractional Ornstein-Uhlenbeck models, A lower bound for radio broadcast, Asymptotic error rates in quantum hypothesis testing, Programmed interactions in higher-order neural networks: Maximal capacity, Local Chernoff and Hodges-Lehmann efficiencies of linear rank tests for symmetry, An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties, Confidence intervals for the mean in the bounded case, Some observations on skip-lists, The maximum number of winning 2-sets, On the complexity of approximating the independent set problem, Expected parallel time and sequential space complexity of graph and digraph problems, Optimal randomized parallel algorithms for computational geometry, Goodness-of-fit tests for a heavy tailed distribution, Hodges-Lehmann and Chernoff efficiencies of linear rank statistics, Game chromatic index of graphs with given restrictions on degrees, Dynamic point location in arrangements of hyperplanes, On packing bipartite graphs, Edge colouring by total labellings, \(t\)-wise independence with local dependencies, A generalization of quantum Stein's lemma, Asymptotically optimal frugal colouring, Circuit size relative to pseudorandom oracles, Randomized range-maxima in nearly-constant parallel time, Deviation inequalities for an estimator of the conditional value-at-risk, A note on the distribution of the number of prime factors of the integers, The relative contributions of private information sharing and public information releases to information aggregation, Cooperation versus competition, Discrepancy and signed domination in graphs and hypergraphs, Optimally ranking unrankable tournaments, Critical branching random walks with small drift, Bayesian discriminant approach to input signal selection in parameter estimation problems, On sequential distinguishability for the exponential family, Bootstrap of deviation probabilities with applications, Optimal query complexity bounds for finding graphs, Exponential bound for distribution of locally infinitely divisible processes, The analysis of double hashing, Exponential convergence properties of linear estimators under exponential and uniform distribution, The weak convergence of likelihood ratio random fields and its applications, Evaluation and selection of models for out-of-sample prediction when the sample size is small relative to the complexity of the data-generating process, Cuckoo hashing: Further analysis, A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation, A closed-form reduction of multi-class cost-sensitive learning to weighted multi-class learning, On hiding information from an oracle, Separating models of learning with faulty teachers, A practical approximation algorithm for the LMS line estimator, The Chernoff lower bound for symmetric quantum hypothesis testing, Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps, Bipartite Ramsey numbers involving large \(K_{n,n}\), Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis, Choosing from a large tournament, Large components in random induced subgraphs of \(n\)-cubes, An introduction to some statistical aspects of PAC learning theory, A scale-free graph model based on bipartite graphs, On randomized algorithms for the majority problem, Sample average approximation method for chance constrained programming: Theory and applications, On the expected probability of constraint violation in sampled convex programs, On nonparametric and semiparametric testing for multivariate linear time series, A new statistical approach for the analysis of uncertain systems, On an upper bound of Sanov's inequality for the probability of a large deviation, Large deviations of order n for sums of random variables related to a Markov chain, Stopping times of one-sample rank order sequential probability ratio tests, Semiparametric analysis of discrete response. Asymptotic properties of the maximum score estimator, On the \(L_ p\) norm for some approximation operators, On progressively truncated maximum likelihood estimators, A conditional limit construction of the normal probability density, Longest Path Distance in Random Circuits, A note on tilted Sperner families with patterns, AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS, Optimal Proximity Proofs, Depth Properties of scaled attachment random recursive trees, Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities, A Statistical Analysis of Probabilistic Counting Algorithms, Degenerate and Poisson convergence criteria for success runs, QUANTUM HYPOTHESIS TESTING AND NON-EQUILIBRIUM STATISTICAL MECHANICS, Settling time bounds for M/G/1 queues, Pseudorandom sources for BPP, Cumulative disease progression models for cross-sectional data: A review and comparison, The sub-Gaussian norm of a binary random variable, Supporting various top-k queries over uncertain datasets, Sample path large deviations and optimal importance sampling for stochastic volatility models, Connectivity of inhomogeneous random graphs, Sets that are connected in two random graphs, Asymptotic theory of sparse Bradley-Terry model, Mining explainable local and global subgraph patterns with surprising densities, Lifshitz asymptotics for percolation Hamiltonians, Optimal estimator of hypothesis probability for data mining problems with small samples, On Lagrangian relaxation for constrained maximization and reoptimization problems, Control-oriented regularization for linear system identification, Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded Variable Means, A probabilistic point of view on peak effects in linear difference equations, A general large deviation result for partial sums of i.i.d. super-heavy tailed random variables, Reachability is harder for directed than for undirected finite graphs, Towards Secure Distance Bounding, Unnamed Item, Probably approximately optimal satisficing strategies, Entropy, character theory and centrality of finite quasigroups, Some new inequalities for the beta function and certain ratios of beta functions, A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network, Learning cost-sensitive active classifiers, Erdős-Rényi-Type Functional Limit Laws for Renewal Processes, On some connections between Esscher's tilting, saddlepoint approximations, and optimal transportation: a statistical perspective, Practical measurement-device-independent quantum key distribution with advantage distillation, Spreading Messages, An Analysis of the Height of Tries with Random Weights on the Edges, Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound, Finite-key analysis of sending-or-not-sending twin-field quantum key distribution with intensity fluctuations, Optimizing the decoy-state BB84 QKD protocol parameters, Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations, Faster cut sparsification of weighted graphs, Learning elliptic partial differential equations with randomized linear algebra, A Proposal for a New Bound for Discrete Distributions, A Bernoulli mean estimate with known relative error distribution, Probabilistic estimation of the reachable set of model reference adaptive controllers using the scenario approach, Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds, Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure, On Radio Broadcasting in Random Geometric Graphs, A Family of Unsupervised Sampling Algorithms, The scaling window of the 2-SAT transition, Large deviation principles for non-uniformly hyperbolic rational maps, Statistical Evidence for Small Generating Sets, Connecting the probability distributions of different operators and generalization of the Chernoff–Hoeffding inequality, Asymptotic behavior of macroscopic observables in generic spin systems, Finding an Unknown Acyclic Orientation of a Given Graph, Likelihood-based inference for Matérn type-III repulsive point processes, On the expected maximum degree of Gabriel and Yao graphs, Nonparametric Entropy-Based Tests of Independence Between Stochastic Processes, On probabilistic elimination of generalized quantifiers, VALUE-AT-RISK ESTIMATION FOR DYNAMIC HEDGING, On list coloring Steiner triple systems, Two Non-Regular Extensions of Large Deviation Bound, Large deviations for Poisson systems of independent random walks, A large deviation principle for bootstrapped sample means, Optimal sampling of independent increment processes, Statistical Learning Theory: A Pack-based Strategy for Uncertain Feasibility and Optimization Problems, Critical random graphs and the structure of a minimum spanning tree, Problemas de optimo que relacionan la informacion de Kullback y el conjunto de riesgos de Neyman-Pearson, Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal, Ramsey properties of random discrete structures, Optimal Proximity Proofs Revisited, Sampling independent sets in the discrete torus, FIDELITY APPROACH TO QUANTUM PHASE TRANSITIONS, Clever Arbiters Versus Malicious Adversaries, A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias, On exponential bounds for binomial probabilities, Exact calculation of minimum sample size for estimating a Poisson parameter, The General Form of γ-Family of Quantum Relative Entropies, TESTING EMBEDDABILITY BETWEEN METRIC SPACES, Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity, Approximation Algorithms for D-optimal Design, On the VC-dimension and boolean functions with long runs, Iteration of positive approximation operators, Robust stabilisation of time-varying delay systems with probabilistic uncertainties, Unnamed Item, Frankl-Rödl-type theorems for codes and permutations, Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs, A class of measures of informativity of observation channels, A sequential approach to classification: Cost of not knowing the covariance matrix, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, Unnamed Item, Large deviations for a class of scale-parameter-free statistics under the gamma distribution, Moderate deviations for the kernel mode estimator and some applications, Sequential sampling techniques for algorithmic learning theory, Connectivity threshold of Bluetooth graphs, Quantum correlations and distinguishability of quantum states, Preparation information and optimal decompositions for mixed quantum states, Convergence rates of change-point estimators and tail probabilities of the first-passage-time process, Asymptotic Pitman's Relative Efficiency, Controlling the key by choosing the detection bits in quantum cryptographic protocols, Optimal Bipartite Network Clustering, ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS, Sparse pseudorandom distributions, A note on the probabilistic analysis of patricia trees, Estimation of Entropy and Mutual Information, Hellinger integrals of diffusion processes, On random cartesian trees, On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm, A review of tests for exponentiality with Monte Carlo comparisons, Interferometric visibility and coherence, Unnamed Item, Tail bounds for sum of gamma variables and related inferences, Trading quantum for classical resources in quantum data compression, Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design, Exponentiality test based on alpha-divergence and gamma-divergence, A supplement to the laws of large numbers and the large deviations, An overview of the theory of large deviations and applications to statistical mechanics, Connectivity of the k-Out Hypercube, A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems, Approximately Counting Triangles in Sublinear Time, Analysis of quickselect : an algorithm for order statistics, PP multivariate random weighting method, Robust algorithms for packet routing in a mesh, Exact Asymptotics for a Multitimescale Model with Applications in Modeling Overdispersed Customer Streams, On Approximating the Number of $k$-Cliques in Sublinear Time, Unnamed Item, Robust Estimation of the Mean with Bounded Relative Standard Deviation, Nonparametric hypothesis testing with small type I or type II error probabilities, Unnamed Item, Cramér’s Theorem in Banach Spaces Revisited, A Mathematical Analysis of Memory Lifetime in a Simple Network Model of Memory, Efficient quantum algorithms for state measurement and linear algebra applications, Tractable Sampling Strategies for Ordinal Optimization, Finite-key security analysis of quantum key distribution with imperfect light sources, Large deviations for denominators of continued fractions, Thwarting the photon-number-splitting attack with entanglement-enhanced BB84 quantum key distribution, Infinitary logics and very sparse random graphs, Unnamed Item, Skip trees, an alternative data structure to skip lists in a concurrent approach, On the theory of interconnection networks for parallel computers, Asymmetric twin-field quantum key distribution with both statistical and intensity fluctuations, Scalable Algorithms for the Sparse Ridge Regression, Almost sure convergence of the Hill estimator, Computable bounds for the discrimination of Gaussian states, Unnamed Item, Unnamed Item, A Theory of Sequence Indexing and Working Memory in Recurrent Neural Networks, Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications, Lagrangian Uncertainty Quantification and Information Inequalities for Stochastic Flows, Deterministic approximations of probability inequalities, An asymptotically tight bound on the adaptable chromatic number, Statistical inference on random dot product graphs: a survey, Transversals in Trees, Tail asymptotics of signal-to-interference ratio distribution in spatial cellular network models, Bahadur efficiency and probabilities of large deviations, [https://portal.mardi4nfdi.de/wiki/Publication:4150440 M�langes d'�quations diff�rentielles et grands �carts � la loi des grands nombres], Forbidden Intersections, Some Large Deviations Limit Theorems in Conditional Nonparametric Statistics, Unnamed Item, Unnamed Item, Unnamed Item, Nonuniversality of weighted random graphs with infinite variance degree, Goodness-of-fit test statistics that dominate the Kolmogorov statistics, Concentration inequalities for measures of a Boolean model, A glimpse of the impact of pál erdős on probability and statistics, Statistische Analyse des homogenen und des inhomogenen Poissonprozesses, Lectures on Entropy. I: Information-Theoretic Notions, Halving the Bounds for the Markov, Chebyshev, and Chernoff Inequalities Using Smoothing, An Improvement of Hind's Upper Bound on the Total Chromatic Number, Functional laws of the iterated logarithm for small increments of empirical processes, Some probabilistic methods in the theory of approximation operators, The chernoff efficiency of the wilcoxon rank test, Strong extension axioms and Shelah's zero-one law for choiceless polynomial time, On the complexity of approximating the independent set problem, Chernoff bounds for discriminating between two markov processes, Refined quicksort asymptotics, Zero-One Laws for Sparse Random Graphs, On the asymptotic efficiency of aligned‐rank tests in randomized block designs, A chaos hypothesis for some large systems of random equations, Universal Limit Laws for Depths in Random Trees, On the asymptotic distribution of a class of aligned rank order test statistics in randomized block designs, Einige statistische Verfahren im Zusammenhang mit Poissonprozessen und deren Anwendung, On the Optimality of Affine Policies for Budgeted Uncertainty Sets, Approximations for interactive Markov chains in discrete and continuous time, A normal approximation for beta and gamma tail probabilities, The asymptotic probabilistic behaviour of quadratic sum assignment problems, Unnamed Item, Asymptotic properties of random Voronoi cells with arbitrary underlying density, Repeated likelihood ratio tests for curved exponential families, The Sum of a Digitaddition Series, Upper and lower class sequences for minimal uniform spacings, Fixed-width confidence sequences for the normal mean and the binomial probability, Sequential stratified splitting for efficient Monte Carlo integration, Unnamed Item, [https://portal.mardi4nfdi.de/wiki/Publication:3946964 Vitesses maximales de d�croissance des erreurs et tests optimaux associ�s], Binary response models comparison using the 𝛼-Chernoff divergence measure and exponential integral functions, Some results on increments of the partially observed empirical process, Path-Based Divergence Rates and Lagrangian Uncertainty in Stochastic Flows, A relation between moment generating functions and convergence rates in the law of large numbers, Fixed-design regression estimation based on real and artificial data, Relative efficiency of the Wald ${\rm SPRT}$ and the Chernoff information number, Comparison of experiments when the parameter space is finite, Unnamed Item, Tools to Estimate the First Passage Time to a Convex Barrier, Parameter Estimation for α-GMM Based on Maximum Likelihood Criterion, Some Results Giving Rates of Convergence in the Law of Large Numbers for Weighted Sums of Independent Random Variables, On the Recurrence of a Certain Chain, Adaptable and conflict colouring multigraphs with no cycles of length three or four, Discrimination of quantum states under locality constraints in the many-copy setting, Majority dynamics on sparse random graphs, Chernoff’s inequality in Riesz spaces, Multiscale principle of relevant information for hyperspectral image classification, Extremal bipartite independence number and balanced coloring, Moderate deviation principle of modularity in network, Surface localization in impurity band with arbitrary singular disorder and long-range potentials, A central limit theorem for integer partitions into small powers, A large deviation theorem for weighted sums, Coloring k-colorable graphs in constant expected parallel time, Extraction rates of random continuous functionals, Approximate majority analyses using tri-molecular chemical reaction networks, Non-trivial \(r\)-wise intersecting families, Tight Probability Bounds with Pairwise Independence, Simplified Chernoff bounds with powers-of-two probabilities, Choosing the right algorithm with hints from complexity theory, \( \lambda \)-deformed evidence lower bound (\( \lambda \)-ELBO) using Rényi and Tsallis divergence, Random bipartite Ramsey numbers of long cycles, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, Orientability Thresholds for Random Hypergraphs, A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials, Unnamed Item, The variance of the $\ell _p^n$-norm of the Gaussian vector, and Dvoretzky’s theorem, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, Estimation of extreme survival probabilities with cox model, Pósa's conjecture for graphs of order at least 2 × 108, SOME NEW RELIABILITY BOUNDS FOR SUMS OF NBUE RANDOM VARIABLES, Biological applications of time series frequency domain clustering, Unnamed Item, Unnamed Item, Large deviations for renewal processes, On independent sets in hypergraphs, Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures, On the strong law of large numbers for a class of stochastic processes, Convergence properties of two-stage stochastic programming, On evaluating a class of frame-based nonstationary pattern recognition methods using Bhattacharyya distance, Random Construction of Interpolating Sets for High-Dimensional Integration, Nonstandard strong laws for local quantile processes, Large deviations for \(U\)-statistics, On the multifractal analysis of measures, Efficient randomized routing algorithms on the two-dimensional mesh of buses, Transmitting once to elect a leader on wireless networks, Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses, Probabilistic solutions to some NP-hard matrix problems, Integration of Stochastic Models by Minimizing α-Divergence, Log-efficient search for significant inputs of linear model, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, Lower bounds on the complexity of simplex range reporting on a pointer machine, On the threshold for rainbow connection number \(r\) in random graphs, Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint, Unnamed Item, Study of incompatibility or near compatibility of bivariate discrete conditional probability distributions through divergence measures, Discriminating between distributions using feed-forward neural networks, On the rate of convergence of empirical measure in $\infty $-Wasserstein distance for unbounded density function, Using Chernoff’s Bounding Method for High-Performance Structural Break Detection and Forecast Error Reduction, A Note on Weak Convergence, Large Deviations, and the Bounded Approximation Property, Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs, Fast Augmenting Paths by Random Sampling from Residual Graphs, Concentration bounds for quantum states with finite correlation length on quantum spin lattice systems, [https://portal.mardi4nfdi.de/wiki/Publication:5515921 Verschl�sselungstheorie f�r symmetrische Kan�le], Unnamed Item, On the Strong Law of Large Numbers
