% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/multiply.R
\name{multiply_bipartite}
\alias{multiply_bipartite}
\title{Construct a co-occurrence network via two-mode multiplication}
\usage{
multiply_bipartite(
  B,
  mode = "columns",
  similarity = "none",
  threshold = 0,
  top_n = NULL,
  self_loops = FALSE
)
}
\arguments{
\item{B}{A sparse bipartite matrix (works x entities), already weighted
by the counting method.}

\item{mode}{Character. \code{"columns"} for column-mode co-occurrence
(e.g., co-citation), \code{"rows"} for row-mode (e.g., coupling).}

\item{similarity}{Character. Normalization method (see \code{\link[=normalize]{normalize()}}).}

\item{threshold}{Numeric. Minimum edge weight to retain.}

\item{top_n}{Integer or \code{NULL}. If specified, keep only the top \code{n}
most frequent nodes and return all edges among them.}
}
\value{
A data frame with columns \code{from}, \code{to}, \code{weight}, \code{count}.
}
\description{
The unified engine for all bibliometric networks. Operates entirely in
sparse representation — never allocates a dense n x n matrix.
}
\keyword{internal}
