Fraigniaud et al. (2006) introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching proble...

The measurement of disproportionality, volatility and malapportionment often employ similar indices. Yet the debate on the issue of adequate measurement has remained open. We offer a formal and rigorous list of properties that roughly subsume those of Taagepera and Grofman (2003). One of these properties, Dalton’s principle of transfers, is formalized in a manner that resolves the ambiguity ass...

We show that the Confusion Entropy, a measure of performance in multiclass problems has a strong (monotone) relation with the multiclass generalization of a classical metric, the Matthews Correlation Coefficient. Analytical results are provided for the limit cases of general no-information (n-face dice rolling) of the binary classification. Computational evidence supports the claim in the gener...

Given a monotone property P of graphs, write Pn for the set of graphs with vertex set [n] having property P. Building on recent results in the enumeration of graphical properties, we prove numerous results about the structure of graphs in Pn and the functions |Pn|. We also examine the measure eP (n), the maximum number of edges in a graph of Pn.

We consider the definition of possibility measures on complete lattices rather than on complete Boolean algebras of sets. We give a necessary and sufficient condition for the extendability of any mapping to such a possibility measure. We also associate two types of integrals with these possibility measures, and discuss some of their more important properties, amongst which a monotone convergenc...

Using finite difference operators, we define a notion of boundary and surface measure for configuration sets under Poisson measures. A Margulis-Russo type identity and a co-area formula are stated with applications to bounds on the probabilities of monotone sets of configurations and on related isoperimetric constants.

It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.

We study the existence of optimal controls for problems governed by semilinear parabolic equations. The nonlinearities in the state equation need not be monotone and the data need not be regular. In particular, the control may be any bounded Radon measure. Our examples include problems with nonlinear boundary conditions and parabolic systems.

We generalise belief functions to many-valued events which are represented by elements of Lindenbaum algebra of infinite-valued Łukasiewicz propositional logic. Our approach is based on mass assignments used in the Dempster–Shafer theory of evidence. A generalised belief function is totally monotone and it has Choquet integral representation with respect to a unique belief measure on Boolean ev...

We consider a special class of mean field SDEs with common noise which depends on the image solution (i.e., conditional distribution given noise). The strong well-posedness is derived under monotone condition weaker than those used in literature games; Feynman–Kac formula established to solve Schrördinegr type PDEs $$\mathscr {P}_2$$ , and ergodicity proved for measure-valued diffusion processes.