% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centrality.R
\name{centrality_prestige_domain}
\alias{centrality_prestige_domain}
\title{Domain Prestige}
\usage{
centrality_prestige_domain(x, ...)
}
\arguments{
\item{x}{Directed network input (matrix, igraph, cograph_network, tna object).}

\item{...}{Additional arguments passed to \code{\link{centrality}}.}
}
\value{
Named numeric vector of domain prestige values in
\eqn{\{0, 1, \ldots, N - 1\}}.
}
\description{
Directed-graph prestige measure: for each node \eqn{v}, the number of
other nodes that can reach \eqn{v} via a directed path.
\deqn{\mathrm{domain}(v) = |\{u \ne v : u \to^* v\}|}
}
\details{
Bit-exact match against \code{sna::prestige(cmode = "domain")}.
Directed-only; returns \code{NA} with a warning on undirected input.
}
\examples{
# Directed 3-cycle: every node reaches every other node
adj <- matrix(c(0,1,0, 0,0,1, 1,0,0), 3, 3, byrow = TRUE)
rownames(adj) <- colnames(adj) <- c("A", "B", "C")
centrality_prestige_domain(adj)
}
\references{
Wasserman, S., & Faust, K. (1994). \emph{Social Network Analysis: Methods
and Applications}. Cambridge University Press.
}
\seealso{
\code{\link{centrality}}, \code{\link{centrality_reaching_local}}
for the dual "out-reachability" measure, \code{\link{centrality_pairwisedis}}
for a related reachability-based directed measure.
}
