This paper considers the problem of clustering a partially observed unweighted graph—i.e., one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know whether or not there is an edge. We want to organize the nodes into disjoint clusters so that there is relatively dense (observed) connectivity within cluster...

Social networks and interactions in social media involve both positive and negative relationships. Signed graphs capture both types of relationships: positive edges correspond to pairs of “friends”, and negative edges to pairs of “foes”. The edge sign prediction problem, that aims to predict whether an interaction between a pair of nodes will be positive or negative, is an important graph minin...

A key computation in visual cortex is the extraction of object contours, where the first stage of processing is commonly attributed to V1 simple cells. The standard model of a simple cell-an oriented linear filter followed by a divisive normalization-fits a wide variety of physiological data, but is a poor performing local edge detector when applied to natural images. The brain's ability to fin...

This paper describes algorithms for detecting and classifying objects such as tanks and trucks in forward-looking infrared (FLIR) imagery. It summarizes research conducted in the course of a two-year project in the areas of image modeling, preand post-processing, segmentation, feature extraction, and classification. 1. Image models The work on image modeling conducted under this project was con...

Introduction: A structured methodology aimed at the automated recognition of impact craters on planetary surfaces is presented. The initial phase focus on edge detection; this is followed by a crucial step, in which a template matching procedure is employed to create a probability volume from which the best candidates are selected and undergo a third phase, designed to detect the centers and es...

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction whether the event occurs. On the other hand, weighted majority functions are shown to be noise-stable. Several necessary and sufficient conditions for noise se...

A stochastic flow network is a directed graph with incoming edges (inputs) and outgoing edges (outputs), tokens enter through the input edges, travel stochastically in the network and can exit the network through the output edges. Each node in the network is a splitter, namely, a token can enter a node through an incoming edge and exit on one of the output edges according to a predefined probab...

A short proof of the Harris-Kesten result that the critical probability for bond percolation in the planar square lattice is 1/2 was given in [1], using a sharp threshold result of Friedgut and Kalai. Here we point out that a key part of this proof may be replaced by an argument of Russo [6] from 1982, using his approximate zero-one law in place of the Friedgut-Kalai result. Russo’s paper gave ...

Evolutionary social dilemma games are extended by an additional matching-pennies game that modifies the collected payoffs. In a spatial version players are distributed on a square lattice and interact with their neighbors. First, we show that the matching-pennies game can be considered as the microscopic force of the Red Queen effect that breaks the detailed balance and induces eddies in the mi...