R: Evaluation on an induced subgraph

S-ergmTerm {ergm} | R Documentation

## Evaluation on an induced subgraph

### Description

This operator takes a two-sided forumla `attrs` whose LHS gives the attribute or attribute function for which tails and heads will be used to construct the induced subgraph. They must evaluate either to a logical vector equal in length to the number of tails (for LHS) and heads (for RHS) indicating which nodes are to be used to induce the subgraph or a numeric vector giving their indices.

### Usage

    # binary: S(formula, attrs)

### Arguments

`formula` | a one-sided `ergm()`-style formula with the terms to be evaluated
`attrs` | a two-sided formula to be used. A one-sided formula (e.g., `~A` ) is symmetrized (e.g., `A~A` ).

### Details

As with indexing vectors, the logical vector will be recycled to the size of the network or the size of the appropriate bipartition, and negative indices will deselect vertices.

When the two sets are identical, the induced subgraph retains the directedness of the original graph. Otherwise, an undirected bipartite graph is induced.

### See Also

`ergmTerm` for index of model terms currently visible to the package.

[Package ergm version 4.2.1 Index]