Conic formulations of graph homomorphisms

Given graphs X and Y, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from X to Y. By varying the cone, we obtain similar characterizations of quantum/entanglement-assisted homomorphisms and three previously studied relaxations of these relations. Motivated by this, we investigate the properties of these “conic homomorphisms” for general (suitable) cones. We also consider two generalized versions of the Lovász theta function, and how they interact with these conic homomorphisms. We prove analogs of several results on classical graph homomorphisms as well as some monotonicity theorems. We also show that one of the generalized theta functions is multiplicative on lexicographic and disjunctive graph products.     

Quantum families of quantum group homomorphisms

The notion of a quantum family of maps has been introduced in the framework of C*-algebras. As in the classical case, one may consider a quantum family of maps preserving additional structures (e.g. quantum family of maps preserving a state). In this paper, we define a quantum family of homomorphisms of locally compact quantum groups. Roughly speaking, we show that such a family is classical. The purely algebraic counterpart of the discussed notion, i.e. a quantum family of homomorphisms of Hopf algebras, is introduced and the algebraic counterpart of the aforementioned result is proved. Moreover, we show that a quantum family of homomorphisms of Hopf algebras is consistent with the counits and coinverses of the given Hopf algebras. We compare our concept with weak coactions introduced by Andruskiewitsch and we apply it to the analysis of adjoint coaction.     

Linear conic formulations for two-party correlations and values of nonlocal games

In this work we study the sets of two-party correlations generated from a Bell scenario involving two spatially separated systems with respect to various physical models. We show that the sets of classical, quantum, no-signaling and unrestricted correlations can be expressed as projections of affine sections of appropriate convex cones. As a by-product, we identify a spectrahedral outer approximation to the set of quantum correlations which is contained in the first level of the Navascués, Pironio and Acín (NPA) hierarchy and also a sufficient condition for the set of quantum correlations to be closed. Furthermore, by our conic formulations, the value of a nonlocal game over the sets of classical, quantum, no-signaling and unrestricted correlations can be cast as a linear conic program. This allows us to show that a semidefinite programming upper bound to the classical value of a nonlocal game introduced by Feige and Lovász is in fact an upper bound to the quantum value of the game and moreover, it is at least as strong as optimizing over the first level of the NPA hierarchy. Lastly, we show that deciding the existence of a perfect quantum (resp. classical) strategy is equivalent to deciding the feasibility of a linear conic program over the cone of completely positive semidefinite matrices (resp. completely positive matrices). By specializing the results to synchronous nonlocal games, we recover the conic formulations for various quantum and classical graph parameters that were recently derived in the literature.     

A solitaire game played on 2-colored graphs

We introduce a solitaire game played on a graph. Initially one disk is placed at each vertex, one face green and the other red, oriented with either color facing up. Each move of the game consists of selecting a vertex whose disk shows green, flipping over the disks at neighboring vertices, and deleting the selected vertex. The game is won if all vertices are eliminated. We derive a simple parity-based necessary condition for winnability of a given game instance. By studying graph operations that construct new graphs from old ones, we obtain broad classes of graphs where this condition also suffices, thus characterizing the winnable games on such graphs. Concerning two familiar (but narrow) classes of graphs, we show that for trees a game is winnable if and only if the number of green vertices is odd, and for n-cubes a game is winnable if and only if the number of green vertices is even and not all vertices have the same color. We provide a linear-time algorithm for deciding winnability for games on maximal outerplanar graphs. We reduce the decision problem for winnability of a game on an arbitrary graph G to winnability of games on its blocks, and to winnability on homeomorphic images of G obtained by contracting edges at 2-valent vertices.     

Static search games played over graphs and general metric spaces

We define a general game which forms a basis for modelling situations of static search and concealment over regions with spatial structure. The game involves two players, the searching player and the concealing player, and is played over a metric space. Each player simultaneously chooses to deploy at a point in the space; the searching player receiving a payoff of 1 if his opponent lies within a predetermined radius r of his position, the concealing player receiving a payoff of 1 otherwise. The concepts of dominance and equivalence of strategies are examined in the context of this game, before focusing on the more specific case of the game played over a graph. Methods are presented to simplify the analysis of such games, both by means of the iterated elimination of dominated strategies and through consideration of automorphisms of the graph. Lower and upper bounds on the value of the game are presented and optimal mixed strategies are calculated for games played over a particular family of graphs.     

On the Monotonicity of Process Number

Graph searching games involve a team of searchers that aims at capturing a fugitive in a graph. These games have been widely studied for their relationships with tree-and path-decomposition of graphs. In order to define decompositions for directed graphs, similar games have been proposed in directed graphs. In this paper, we consider such a game that has been defined and studied in the context of routing reconfiguration problems in WDM networks. Namely, in the processing game, the fugitive is invisible, arbitrary fast, it moves in the opposite direction of the arcs of a digraph, but only as long as it has access to a strongly connected component free of searchers. We prove that the processing game is monotone which leads to its equivalence with a new digraph decomposition.     

Hitting time results for Maker‐Breaker games

We study Maker‐Breaker games played on the edge set of a random graph. Specifically, we analyze the moment a typical random graph process first becomes a Maker's win in a game in which Maker's goal is to build a graph which admits some monotone increasing property \begin{align*}\mathcal{P}\end{align*}. We focus on three natural target properties for Maker's graph, namely being k ‐vertex‐connected, admitting a perfect matching, and being Hamiltonian. We prove the following optimal hitting time results: with high probability Maker wins the k ‐vertex connectivity game exactly at the time the random graph process first reaches minimum degree 2k; with high probability Maker wins the perfect matching game exactly at the time the random graph process first reaches minimum degree 2; with high probability Maker wins the Hamiltonicity game exactly at the time the random graph process first reaches minimum degree 4. The latter two statements settle conjectures of Stojakovi? and Szabó. We also prove generalizations of the latter two results; these generalizations partially strengthen some known results in the theory of random graphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

An evolutionary game-theoretic model for ethno-religious conflicts between two groups

Ethno-religious conflict in multi-cultural societies has been one of the major causes of loss of life and property in recent history. In this paper, we present and analyze a multi-agent game theoretic model for computational study of ethno-religious conflicts in multi-cultural societies. Empirical fact-based research in sociology and conflict resolution literature have identified (a) ethno-religious identity of the population, (b) spatial structure (distribution) of the population, (c) existing history of animosity, and (d) influence of leaders as some of the salient factors causing ethno-religious violence. It has also been experimentally shown by Lumsden that multi-cultural conflict can be viewed as a Prisoner’s Dilemma (PD) game. Using the above observations, we model the multi-cultural conflict problem as a variant of the repeated PD game in graphs. The graph consists of labeled nodes corresponding to the different ethno-religious types and the topology of the graph encodes the spatial distribution and interaction of the population. We assume the structure of the graph to have the statistical properties of a social network with the high degree nodes representing the leaders of the society. The agents play the game with neighbors of their opponent type and they update their strategies based on neighbors of their same type. This strategy update dynamics, where the update neighborhood is different from the game playing neighborhood, distinguishes our model from conventional models of PD games in graphs. We present simulation results showing the effect of various parameters of our model to the propensity of conflict in a population consisting of two ethno-religious groups. We also compare our simulation results to real data of occurrence of ethno-religious violence in Yugoslavia.     

可能行无限图C~*-代数

本文研究可能行无限有向图的C~*-代数。对于一个可能行无限的有向图E,通过引进集合S(μ,v),将行无限点上的算子拓扑强收敛关系代数化表示出来,并由此构造了一个结构丰富的非零*-代数H_E;进而利用H_E证明了一个由Cuntz-Krieger E-族{s_e,p_v}生成的泛C~*-代数 C~*(E)的存在性,并且证明了H_E和 C~*(E)在图同构意义下不依赖于E的选择,从而是可能行无限有向图的同构不变量。     

Homomorphisms of graphs and of their orientations

Consider a set of graphs and all the homomorphisms among them. Change each graph into a digraph by assigning directions to its edges. Some of the homomorphisms preserve the directions and so remain as homomorphisms of the set of digraphs; others do not. We study the relationship between the original set of graph-homomorphisms and the resulting set of digraph-homomorphisms and prove that they are in a certain sense independent. This independence result no longer holds if we start with a proper class of graphs, or if we require that only one direction be given to each edge (unless each homomorphism is invertible, in which case we again prove independence). We also specialize the results to the set consisting of one graph and prove the independence of monoids (groups) of a graph and the corresponding digraph.With 1 Firgure     

Intersections of graphs

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed image graph H. We introduce our techniques by proving that the lex graph has the largest number of homomorphisms into K₂ with one looped vertex (or equivalently, the largest number of independent sets) among graphs with fixed number of vertices and edges. Our main result is the solution to the extremal problem for the number of homomorphisms into P, the completely looped path of length 2 (known as the Widom–Rowlinson model in statistical physics). We show that there are extremal graphs that are threshold, give explicitly a list of five threshold graphs from which any threshold extremal graph must come, and show that each of these “potentially extremal” threshold graphs is in fact extremal for some number of edges. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 67: 261–284, 2011     

On Some Problems Studied by R. V. Kadison

Several problems studied by professor R. V. Kadison are shown to be closely related. The problems were originally formulated in the contexts of homomorphisms of C^*-algebras, cohomology of von Neumann algebras and perturbations of C^*-algebras. Recent research by G. Pisier has demonstrated that all of the problems considered are related to the question of whether all C^*-algebras have finite length.     

On finding curb sets in extensive games

We characterize strategy sets that are closed under rational behavior (curb) in extensive games of perfect information and finite horizon. It is shown that any such game possesses only one minimal curb set, which necessarily includes all its subgame perfect Nash equilibria. Applications of this result are twofold. First, it lessens computational burden while computing minimal curb sets. Second, it implies that the profile of subgame perfect equilibrium strategies is always stochastically stable in a certain class of games.I am grateful to J. Kamphorst, G. van der Laan and X. Tieman, who commented on the earlier versions of the paper. I also thank an anonymous referee and an associate editor for their helpful remarks. The usual disclaimer applies.     

Maximum Orbit Weights in the σ-game and Lit-only σ-game on Grids and Graphs

Let G be a graph in which each vertex can be in one of two states: on or off. In the σ-game, when you “push” a vertex v you change the state of all of its neighbors, while in the σ⁺-game you change the state of v as well. Given a starting configuration of on vertices, the object of both games is to reduce it, by a sequence of pushes, to the smallest possible number of on vertices. We show that any starting configuration in a graph with no isolated vertices can, by a sequence of pushes, be reduced to at most half on, and we characterize those graphs for which you cannot do better. The proofs use techniques from coding theory. In the lit-only versions of these two games, you can only push vertices which are on. We obtain some results on the minimum number of on vertices one can obtain in grid graphs in the regular and lit-only versions of both games.     

The common structure graph: Common structural features of a set of graphs

A method is proposed for abstracting the common features of a set of graphs. It is based on the graph homomorphisms that a set of graphs share. A semilattice structure is imposed on the partial order of graph homomorphisms of a set of graphs. The ‘common structure graphs’ are defined in relation to this semilattice.     

Partitions and homomorphisms in directed and undirected graphs

Boyle has given a condition for defining a homomorphism in terms of minimal paths for undirected graphs. The purpose of such homomorphisms is to provide a simpler graph which will reflect the structure of the more complex graph, and thereby enable the researcher to make observations which may have been shrouded by a preponderance of nodes and edges. This paper develops Boyle's ideas and introduces further homomorphisms for directed as well as undirected graphs. The relationships between the various homomorphisms are also examined.     

匹配对策模型的核心稳定性

本文研究匹配合作对策模型的核心稳定性。基于线性规划对偶理论和图论的相关知识，我们首先证明了匹配对策有稳定核心当且仅当其基础二部图有完美匹配。其次我们讨论了几个与核心稳定性密切相关的性质（核心的包容性、对策的精确性和可扩性）并证明了它们的等价性。基于这些结果，我们还讨论了相应问题的算法。     

Directed graphical structure,Nash equilibrium,and potential games

This paper considers the directed graphical structure of a game, called influence structure, where a directed edge from player $i$ to player $j$ indicates that player $i$ may be able to affect $j$’s payoff via his unilateral change of strategies. We give a necessary and sufficient condition for the existence of pure-strategy Nash equilibrium of games having a directed graph in terms of the structure of that graph. We also discuss the relationship between the structure of graphs and potential games.     

The existence theorem of absolute equilibrium about games on connected graph with state payoff vector

By introducing state payoff vector to every state node on the connected graph in this paper,dynamic game is researched on finite graphs.The concept of simple strategy about games on graph defined by Berge is introduced to prove the existence theorem of absolute equilibrium about games on the connected graph with state payoff vector.The complete algorithm and an example in the three-dimensional connected mesh-like graph are given in this paper.     

The existence theorem of absolute equilibrium about games on connected graph with state payoff vecto

By introducing state payoff vector to every state node on the connected graph in this paper, dynamic game is researched on finite graphs. The concept of simple strategy about games on graph defined by Berge is introduced to prove the existence theorem of absolute equilibrium about games on the connected graph with state payoff vector. The complete algorithm and an example in the three-dimensional connected mesh-like graph are given in this paper.