Reproduce “Analytical maximum-likelihood method to detect patterns in real networks” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Tiziano Squartini, Diego Garlaschelli

The method constructs maximum-entropy network ensembles from degree, strength, or reciprocity constraints, fitting hidden vertex parameters by maximum likelihood rather than repeatedly rewiring networks. It calculates property expectations efficiently, although some general-property estimates are approximate. Across eight food webs, adding reciprocity substantially reduced motif z-scores for motifs 2, 3, and 13; this shows baseline dependence, not a sole cause.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.