Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for characterizations of those graphs in terms of neighborhood and clique hypergraphs which have the Helly property and whose line graph is chordal. These graphs are dual (in the sense of hypergraphs) to chordal graphs. By us...

Let G = (V,E) be a simple undirected graph. The neighborhood hypergraph N (G) = (V, EN ) of G has the edge set EN = {e ⊆ V | |e| ≥ 1 ∧ ∃x ∈ V : e = NG(x)}. In a certain sense, this is a generalization of the well-known notion of the neighborhood graph N(G) = (V,EN ). For several products G1 ◦G2 of simple undirected graphs G1 and G2, we investigate the question how N(G1 ◦G2) / N (G1 ◦G2) can be ...

Wolpert and Macready's No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. The meaning of the No Free Lunch theorem has, however, been the subject of intense debate. We prove that for local neighborhood search on problems of bounded complexity, where complexity is measured in terms of number of basins of attraction in the search s...

We formulate a robust Wiener filtering problem for wide-sense stationary (WSS) Gaussian processes in the presence of modelling errors. It requires solving a minimax problem that consists of finding the best filter for the least-favorable statistical model within a neighborhood of the nominal model. The neighborhood is formed by models whose relative entropy with respect to the nominal model is ...

We classify torsion-free real-analytic affine connections on compact oriented real-analytic surfaces which are locally homogeneous on a nontrivial open set, without being locally homogeneous on all of the surface. In particular, we prove that such connections exist. This classification relies in a local result that classifies germs of torsion-free real-analytic affine connections on a neighborh...

We present a probabilistic cellular automaton (CA) with two absorbing states which performs classification of binary strings in a nondeterministic sense. In a system evolving under this CA rule, empty sites become occupied with a probability proportional to the number of occupied sites in the neighborhood, while occupied sites become empty with a probability proportional to the number of empty ...

In this paper we examine the Neighborhood Networks project: a community-based participatory design project. The goal of the Neighborhood Networks project is to facilitate and investigate the use of participatory design to prompt critical engagements between people, technology, and the urban environment, and to enable the production of creative expressions of local issues by residents, using rob...

Wolpert and Macready’s No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. The meaning of the No Free Lunch theorem has, however, been the subject of intense debate. We prove that for local neighborhood search on problems of bounded complexity, where complexity is measured in terms of number of basins of attraction in the search s...

Prominent explanations of the overrepresentation of Black Americans in criminal justice statistics focus on the effects of neighborhood concentrated disadvantage, racial isolation, and social disorganization. We suggest that perceived personal discrimination is an important but frequently neglected complement to these factors. We test this hypothesis with longitudinal data on involvement in gen...

A neighborhood's normative climate is linked to, but conceptually distinct from, its structural characteristics such as poverty and racial/ethnic composition. Given the deleterious consequences of early sexual activity for adolescent health and well-being, it is important to assess normative influences on youth behaviors such as sexual debut, number of sex partners, and involvement in casual se...