Related papers: Shuffling posets on trajectories (technical report…
In this paper, we present a heuristic operator which aims at simultaneously optimizing the orientations of all the edges in an intermediate Bayesian network structure during the search process. This is done by alternating between the space…
Group behavior has received much attention as a test case of self-organization. There has been much written in recent years to investigate interactions within groups of agents. These agents can be animals moving in an interactive way, such…
The main purpose of this paper is to investigate characterizations of composition operators on Bloch and Hardy type spaces. Initially, we use general doubling weights to study the composition operators from harmonic Bloch type spaces on the…
Recently, a boxology (graphical language) with design patterns for hybrid AI was proposed, combining symbolic and sub-symbolic learning and reasoning. In this paper, we extend this boxology with actors and their interactions. The main…
While many production-ready and robust algorithms are available for the task of recommendation systems, many of these systems do not take the order of user's consumption into account. The order of consumption can be very useful and matters…
Developing safe human-robot interaction systems is a necessary step towards the widespread integration of autonomous agents in society. A key component of such systems is the ability to reason about the many potential futures (e.g.…
Probability models have been proposed in the literature to account for "intelligent" behavior in many contexts. In this paper, probability propagation is applied to model agent's motion in potentially complex scenarios that include goals…
The pebble-motion on graphs is a subcategory of multi-agent pathfinding problems dealing with moving multiple pebble-like objects from a node to a node in a graph with a constraint that only one pebble can occupy one node at a given time.…
We analyze the poset of moves in chip-firing, as defined by Klivans and Liscio. Answering a question of Propp, we show that the move poset forms the join-irreducibles of the poset of configurations. The proof involves a graph augmentation…
We study a general transition operator, generated by a random walk on a graph $X$; in particular we give necessary and sufficient condition on the matrix coefficient (1-step transition probablilities) to be a bounded operator from…
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration…
We show that the poset of shuffles introduced by Greene in 1988 is flag-symmetric, and we describe a "local" permutation action of the symmetric group on the maximal chains which is closely related to the flag symmetric function of the…
An algorithm is presented for numerical computation of choreographies in the plane in a Newtonian potential and on the sphere in a cotangent potential. It is based on stereographic projection, approximation by trigonometric polynomials, and…
The dynamics by iteration of a function on a compact metric space, sometimes called a cascade, can be extended to the dynamics of a closed relation on such a space. Here we apply this relation dynamics to study semiflows (and their relation…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
In this short paper we discuss how the position - scale half-space of wavelet analysis may be cut into different regions. We discuss conditions under which they are independent in the sense that the T\"oplitz operators associated with their…
We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…
We study Bayesian coordination games where agents receive noisy private information over the game's payoff structure, and over each others' actions. If private information over actions is precise, we find that agents can coordinate on…
Given a finite poset $P$, we study the _whirling_ action on vertex-labelings of $P$ with the elements $\{0,1,2,\dotsc ,k\}$. When such labelings are (weakly) order-reversing, we call them $k$-bounded $P$-partitions. We give a general…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…