Results 231 to 240 of about 31,009 (261)

Random Partitions by Semigroup Methods

Semigroup Forum, 1999
Let \({\mathcal P}\) be the set of all partitions of \(\mathbb{N}\). For \(U,V \in {\mathcal P}\), the maximum partition \(U\vee V\in {\mathcal P}\) is defined by ``joining'' \(U\) with \(V\). Then \(({\mathcal P},\vee)\) is an Abelian idempotent semigroup with neutral element \(U_0=\{\{j\}: j\in\mathbb{N}\}\) and absorbing element \(U_\infty ...
Hirth, Ulrich, Ressel, Paul
openaire   +2 more sources

On comparisons of random, partition, and proportional partition testing

IEEE Transactions on Software Engineering, 2001
Early studies of random versus partition testing used the probability of detecting at least one failure as a measure of test effectiveness and indicated that partition testing is not significantly more effective than random testing. More recent studies have focused on proportional partition testing because a proportional allocation of the test cases ...
openaire   +1 more source

Random walks on random partitions in one dimension

Physical Review E, 1996
Random walks on state space partitions provide an abstract generic picture for the description of macroscopic fluctuations in heterogeneous systems such as proteins. We determine the average residence probability and the average distribution of residence times in a particular macroscopic state for the ensemble of random partitions of a one-dimensional ...
, Nadler, , Huang, , Stein
openaire   +2 more sources

Random Uniform Partitions

2015
exaly   +2 more sources

Spectral partitioning of random graphs

Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 2001
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all three problems above in the average case, as well as a
openaire   +1 more source

Random Plancherel Partitions

2015
exaly   +2 more sources

On random and partition testing

ACM SIGSOFT Software Engineering Notes, 1998
There have been many comparisons of random and partition testing. Proportional partition testing has been suggested as the optimum way to perform partition testing. In this paper we show that this might not be so and discuss some of the problems with previous studies.
openaire   +1 more source

Limit Theorems for Random Partitions

Theory of Probability & Its Applications, 1983
Molchanov, S. A., Reznikova, A. Ya.
openaire   +2 more sources

Optimal and Random Partitions of Random Graphs

2013
The behavior of random graphs with respect to graph partitioning is considered. Conditions are identified under which random graphs cannot be partitioned well, i.e., a random partition is likely to be almost as good as an optimal partition.
Heath, Lenwood S., Lavinus, Joseph W.
openaire   +1 more source

Statistics and gap distributions in random Kakutani partitions and multiscale substitution tilings

Journal of Mathematical Analysis and Applications, 2022
Yotam Smilansky
exaly