相关论文: Measuring sets in infinite groups

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

This paper develops a theory for group Lasso using a concept called strong group sparsity. Our result shows that group Lasso is superior to standard Lasso for strongly group-sparse signals. This provides a convincing theoretical…

We examine several notions of randomness for elements in a given $\Pi^0_1$ class $\mathcal{P}$. Such an effectively closed subset $\mathcal{P}$ of $2^\omega$ may be viewed as the set of infinite paths through the tree $T_{\mathcal{P}}$ of…

In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff…

In this paper we examine the existence of heterogeneity within a group, in panels with latent grouping structure. The assumption of within group homogeneity is prevalent in this literature, implying that the formation of groups alleviates…

The field of property testing of probability distributions, or distribution testing, aims to provide fast and (most likely) correct answers to questions pertaining to specific aspects of very large datasets. In this work, we consider a…

In this article, we introduce an interesting topology-like concept concerning groups (and with almost the same method it can be defined for other algebraic systems). Given an arbitrary group $G$, we define a {\em topo-system} on $G$ as a…

Applied statistical problems often come with pre-specified groupings to predictors. It is natural to test for the presence of simultaneous group-wide signal for groups in isolation, or for multiple groups together. Classical tests for the…

We define a relative property A for a countable group with respect to a finite family of subgroups. Many characterizations for relative property A are given. In particular a relative bounded cohomological characterization shows that if a…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

Nodes in real-world networks are usually organized in local modules. These groups, called communities, are intuitively defined as sub-graphs with a larger density of internal connections than of external links. In this work, we introduce a…

When testing a set of data for randomness according to a probability distribution that depends on a parameter, access to this parameter can be considered as a computational resource. We call a randomness test Hippocratic if it is not…

Let G be a finite group and p a prime dividing its order. We define new collections of p-subgroups of G. We study the homotopy relations among them and with the standard collections of p-subgroups. We determine their ampleness and sharpness…

The framework of generalized probabilistic theories (GPT) is a widely-used approach for studying the physical foundations of quantum theory. The standard GPT framework assumes the no-restriction hypothesis, in which the state space of a…

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…

Let G be a finite group of nilpotency class 2 and w a group word. In this short paper we show that the probability that a random n-tuple of elements from G satisfies w is at least one over the order of G. This answers a special case of a…

A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…

Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a "good" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation.…

Let $G=\mathop{A\ast B}\limits_C$ be an amalgamated product of finite rank free groups $A$, $B$ and $C$. We introduce atomic measures and corresponding asymptotic densities on a set of normal forms of elements in $G$. We also define two…