6 research outputs found
Consensus Strategies for Signed Profiles on Graphs
The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was studied. Here one maximizes the average distance to the clients. In this paper the mixed case is studied. Clients are represented by a profile, which is a sequence of vertices with repetitions allowed. In a signed profile each element is provided with a sign from {+,-}. Thus one can take into account whether the client prefers the facility (with a + sign) or rejects it (with a - sign). The graphs for which all median sets, or all antimedian sets, are connected are characterized. Various consensus strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming graphs, Johnson graphs and halfcubes
Consensus strategies for signed profiles on graphs
The median problem is a classical problem in Location Theory: one searches for a
location that minimizes the average distance to the sites of the clients. This is for desired
facilities as a distribution center for a set of warehouses. More recently, for obnoxious
facilities, the antimedian was studied. Here one maximizes the average distance to the
clients. In this paper the mixed case is studied. Clients are represented by a profile, which
is a sequence of vertices with repetitions allowed. In a signed profile each element is
provided with a sign from (+,-). Thus one can take into account whether the client
prefers the facility (with a + sign) or rejects it (with a - sign). The graphs for which all
median sets, or all antimedian sets, are connected are characterized. Various consensus
strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity.
Hypercubes are the only graphs on which Majority produces the median set for all signed
profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming
graphs, Johnson graphs and halfcubes
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
__Abstract__
A median (antimedian) of a profile of vertices on a graph is a vertex that minimizes (maximizes) the remoteness value, that is, the sum of the distances to the elements in the profile. The median (or antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (or obnoxious) facility in a network.
The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper an axiomatic characterization is obtained for the median and antimedian functions on complete graphs minus a perfect matching (also known as cocktail-party graphs). In addition a characterization of the antimedian function on complete graphs is presented
Axiomatic Characterization of the Median and Antimedian Function on a Complete Graph minus a Matching
__Abstract__
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements in the profile. The median (antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (obnoxious) facility in a network. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper an axiomatic characterization is obtained for the median and antimedian function on complete graphs minus a matching
Compatibilization of polymer blends by Janus particles
Due to their strong tendency for demixing, immiscible polymers require compatibilization to ensure that immiscible polymer blends with a fine and stable morphology as well as adequate interfacial adhesion are obtained. Classically, compatibilization is performed with either copolymers or nanoparticles. Janus particles, which are particles having two sides with distinct chemical or physical properties, combine the amphiphilic character of copolymers with the physical characteristics of particles. In the present work, compatibilization by means of Janus particles is reviewed, with a particular emphasis on polymer blends. After providing a short overview of the different Janus particle types and production routes as well as their compatibilization mechanisms, the available literature on polymer blends compatibilized with Janus particles is reviewed. Janus particles are more efficient morphology stabilizers, leading to a larger reduction in domain sizes and more significant slowing down of phase separation kinetics as compared to homogeneous nanoparticles. Hence, the use of Janus particles forms a very promising route to generate nano- or microstructured high-performance materials from polymer blends with a tuneable organization on two levels, namely that of the Janus particles at the interface as well as that of the global blend morphology. In this endeavor, one of the major challenges is the development of large-scale production routes for Janus nanoparticles, which would allow their use on industrial scale