The core concept of this paper can occur in the guise of various representations. Four of them are relevant here, the last one being new:
-
1.
A MEDIUM, that is, a semigroup of transformations on a set of states, constrained by strong axioms (see Eppstein, Falmagne, & Ovchinnikov, 2008; Falmagne, 1997; Falmagne & Ovchinnikov, 2002).
-
2.
An ISOMETRIC SUBGRAPH OF THE HYPERCUBE, OR “PARTIAL CUBE.” By “isometric”, we mean that the distance between any two vertices of the subgraph is identical to the distance between the same two vertices in the hypercube (Djoković, 1973; Graham & Pollak, 1971). Each state of the medium is mapped to a vertex of the graph, and each transformation corresponds to an equivalence class of its arcs. Note that, as will become clear later on, no assumption of finiteness is made in this or in any of the other representation.
-
3.
An ISOMETRIC SUBGRAPH OF THE INTEGER LATTICE. This representation is not exactly interchangeable with the preceding one. While it is true that any isometric subgraph of the hypercube is representable as an isometric subgraph of the integer lattice and vice versa, the latter representation lands in a space equipped with a considerable amount of structure. Notions of “lines”, “hyperplanes”, or “parallelism” can be legitimately defined if one wishes. Moreover, the dimension of the lattice representation is typically much smaller than that of the partial cube representing the same medium and so can be valuable in the representation of large media (see, in particular, Eppstein, 2005, in which an algorithm is described for finding the minimum dimension of a lattice representation of a partial cube).
-
4.
A MEDIATIC GRAPH. Axiomatic definitions are usually regarded as preferable whenever feasible, and that is what is given here.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bondy, J. A. (1995). Basic graph theory: paths and circuits. In R. L. Graham, M. Grötschel,&L. Lovász (Eds.) Handbook of combinatorics (Vol. 1). Cambridge, MA: MIT.
Brightwell, G., Fishburn, P.,&Winkler, P. M. (1993). Interval orders and linear extension cycles. Ars Combinatoria, 36, 283–288.
Djoković, D. Z. (1973). Distance preserving subgraphs of hypercubes. Journal of Combinatorial Theory, Series B, 14, 263–267.
Doignon, J.-P.&Falmagne, J.-Cl. (1997) Well-graded families of relations. Discrete Mathematics, 173, 35–44.
Eppstein, D. (2005). The lattice dimension of a graph. European Journal of Combinatorics, 26(6), 585–592.
Eppstein, D.&Falmagne, J.-Cl. (2008). Algorithms for media. Discrete Applied Mathematics, 156, 1308–1320.
Eppstein, D., Falmagne, J.-Cl.,&Ovchinnikov, S. (2008). Media theory. Berlin: Springer.
Falmagne, J.-Cl. (1997). Stochastic token theory. Journal of Mathematical Psychology, 41(2), 129– 143.
Falmagne, J.-Cl.&Ovchinnikov, S. (2002). Media theory. Discrete Applied Mathematics, 121, 83–101.
Fishburn, P. C. (1971). Betweenness, orders and interval graphs. Journal of Pure and Applied Algebra, 1(2), 159–178.
Fishburn, P. C. (1985). Interval orders and interval graphs. London: Wiley.
Fishburn, P. C.&Trotter, W. T. (1999). Split semiorders. Discrete Mathematics, 195, 111–126.
Graham, R. L.&Pollak, H. (1971). On addressing problem for loop switching. Bell Systems Technical Journal, 50, 2495–2519.
König, D. (1916). Ü ber Graphen und ihren Anwendung auf Determinanten-theorie und Mengen-lehre. Mathematische Annalen, 77, 453–465.
Ovchinnikov, S. (2007). Fundamentals of media theory. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 15(6), 649–680.
Ovchinnikov, S. (2008). Media theory: representations and examples. Discrete Applied Mathematics, 156, 1197–1219.
Ovchinnikov, S.&Dukhovny, A. (2000). Advances in media theory. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 8(1), 45–71.
Winkler, P. M. (1984). Isometric embedding in products of complete graphs. Discrete Applied Mathematics, 7, 221–225.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Falmagne, JC., Ovchinnikov, S. (2009). Mediatic Graphs. In: Brams, S.J., Gehrlein, W.V., Roberts, F.S. (eds) The Mathematics of Preference, Choice and Order. Studies in Choice and Welfare. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79128-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-79128-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79127-0
Online ISBN: 978-3-540-79128-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)