McMorris, F.R.
http://repub.eur.nl/ppl/3921/
List of Publicationsenhttp://repub.eur.nl/logo.png
http://repub.eur.nl/
RePub, Erasmus University RepositoryAn axiomatic approach to location functions on finite metric spaces
http://repub.eur.nl/pub/41360/
Mon, 09 Sep 2013 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Novick, B.</div><div>Powers, R.C.</div>
A location function on a finite metric space (X, d) is a function on the set, X*, of all finite sequences of elements of X, to 2X\θ, which minimizes some criteria of remoteness. Axiomatic characterizations of these functions have, for the most part, been established only for very special cases. While McMorris, Mulder and Powers [F.R. McMorris, H.M. Mulder, R.C. Powers, "The median function on median graphs and semilattices," Discrete Appl. Math., 101, (2000), 221-230] were able to characterize the median function on median graphs with three axioms, one of their axioms was very specific to the structure of median graphs. Recently, however, Mulder and Novick [H.M. Mulder, B.A. Novick, "A tight axiomatization of the median procedure on median graphs," Discrete Appl. Math., 161, (2013), 838-846] characterized the median function for all median graphs using only three very natural axioms. These three axioms are meaningful in the more general context of finite metric spaces. In this work, we establish that these same three axioms are indeed independent and then we settle completely the question of interdependence among the collection of axioms involved in the above mentioned two characterizations, giving examples for all logically relevant cases. We introduce several new location functions and pose some questions. The ℓ
p-function on trees
http://repub.eur.nl/pub/34915/
Sat, 01 Sep 2012 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Ortega, O.</div>
A p-value of a sequence π = (x1, x2,⋯, xk) of elements of a finite metric space (X, d) is an element x for which ∑i=1kdp(x,xi) is minimum. The function ℓpwith domain the set of all finite sequences defined by ℓp(π) = {x: x is a p-value of π} is called the ℓp-function on X. The ℓp-functions with p = 1 and p = 2 are the well-studied median and mean functions respectively. In this article, the ℓp-function on finite trees is characterized axiomatically. The Lp-function on trees
http://repub.eur.nl/pub/20773/
Thu, 23 Sep 2010 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Ortega, O.</div>
Axiomatic characterization of the mean function on trees
http://repub.eur.nl/pub/37668/
Wed, 01 Sep 2010 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Ortega, O.</div>
A mean of a sequence π = (x1, x2, …, xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean (π) = {x|x is a mean of π} is called the mean function on X. In this note, the mean function on finite trees is characterized axiomatically.
Axiomatic Characterization of the Mean Function on Trees
http://repub.eur.nl/pub/18261/
Tue, 23 Feb 2010 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Ortega, O.</div>
A mean of a sequence π = (x1, x2, . . . , xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean(π) = { x | x is a mean of π } is called the mean function on X. In this paper the mean function on finite trees is characterized axiomatically.The t-median function on graphs
http://repub.eur.nl/pub/19259/
Fri, 01 Dec 2006 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Powers, R.C.</div>
A median of a sequence π=x1,x2,…,xk of elements of a finite metric space (X,d) is an element x for which is minimum. The function M with domain the set of all finite sequences on X and defined by M(π)={x:x is a median of π} is called the median function on X, and is one of the most studied consensus functions. Based on previous characterizations of median sets M(π), a generalization of the median function is introduced and studied on various graphs and ordered sets. In addition, new results are presented for median graphs.The t-median function on graphs
http://repub.eur.nl/pub/6916/
Tue, 23 Aug 2005 00:00:01 GMT<div>McMorris, F.R.</div><div>Mulder, H.M.</div><div>Powers, R.C.</div>
A median of a sequence = x1, x2, … , xk of elements of a finite metric space (X, d ) is an element x for which 1 ≤ I ≤ k d(x, xi) is minimum. The function M with domain the set of all finite sequences on X and defined by M() = {x: x is a median of } is called the median function on X, and is one of the most studied consensus functions. Based on previous characterizations of median sets M(), a generalization of the median function is introduced and studied on various graphs and ordered sets. In addition, new results are presented for median graphs.