Constructing All Smallest Simultaneous Confidence Sets in a Given Class with Applications to MANOVA
نویسندگان
چکیده
منابع مشابه
An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence
Registers with Non-Linear Update (RNLUs) are a generalization of Non-Linear Feedback Shift Registers (NLFSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the stages is required. In this paper, a new algorithm for constructing RNLUs generating a given binary sequence is presented. Expected size of RNLUs constructed by the presented algorithm i...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملConstructing regular graphs with smallest defining number
In a given graph G, a set S of vertices with an assignment of colors is a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a χ(G)-coloring of the vertices of G. A defining set with minimum cardinality is called a smallest defining set (of vertex coloring) and its cardinality, the defining number, is denoted by d(G, χ). Let d(n, r, χ = k) be the ...
متن کاملConstructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary history in the presence of reticulation events is important. Previous work has suggested that constructing phylogenetic networks by merging gene trees is a biologically meaningful approach. This paper presents two new ef...
متن کاملConstructing Random Times with Given Survival Processes and Applications to Valuation of Credit Derivatives
Problem (P). Let (Ω ,G ,F,P) be a probability space endowed with the filtration F = (Ft)t∈R+ . Assume that we are given a strictly positive, càdlàg, (P,F)-local martingale N with N0 = 1 and an F-adapted, continuous, increasing process Λ , with Λ0 = 0 and Λ∞ = ∞, and such that Gt := Nte−Λt ≤ 1 for every t ∈ R+. The goal is to construct a random time τ on an extended probability space and a proba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1979
ISSN: 0090-5364
DOI: 10.1214/aos/1176344784