The core of the work is a single, measurable quantity the authors call the competitive balance. In classic metapopulation theory, a species persists when its local extinction rate is lower than the so-called metapopulation capacity, typically captured by the largest eigenvalue of a dispersal kernel matrix. That logic works for a lone species, but in a community of many competitors, meeting the threshold is necessary yet not sufficient. The new framework shows that long-term persistence in an interacting metacommunity is instead governed by how a species’ competitive balance compares with those of all its neighbors—a collective property that emerges nonlinearly from the whole community rather than summing individual contributions.

What makes the approach practical is its refusal to demand data that ecologists rarely have. Mechanistic models of interacting communities usually require estimates of demographic rates, interaction coefficients and dispersal parameters, which are notoriously difficult to measure in species-rich ecosystems. Statistical tools such as species distribution models or population viability analyses are more data-friendly but often treat species in isolation. The Padova-led team sidestepped the problem by modeling the interaction–dispersal kernel entries as effectively random, drawn from a species-specific gamma distribution whose parameters can be inferred directly from spatial abundance patterns—the kind of coarse-grained census data that forest monitoring plots already collect.

The bridge between theory and data is a quantity called the vacancy-adjusted abundance, or VAA. For each species in a subplot, the VAA is the fraction of space it occupies divided by the locally unoccupied space. This normalization upweights patches that are nearly saturated, so the same relative space-use contributes differently depending on how crowded a site is. The result has a clear ecological reading: it rescales local occupancy to reflect a species’ effective colonization effort. Fitting the theoretical VAA distributions to empirical histograms yields two interpretable parameters per species—dispersal heterogeneity and effective dispersal strength—without any direct measurement of vital rates or interaction coefficients.

To validate the framework, the researchers turned to three spatially complete forest censuses: the Barro Colorado Island tropical plot in Panama, the Pasoh Forest Reserve plot in Malaysia and the Michigan Big Woods temperate plot in the United States. Each plot was partitioned into 50-meter square subplots, and the space used by each species was estimated using an established allometric relation between trunk diameter and crown area. The theory captured the diversity of distributional shapes across species with striking accuracy. In out-of-sample tests, parameters fitted on one half of a plot predicted the mean space-use of species in the other half with coefficients of determination of 0.97, 0.93 and 0.95 for the three datasets respectively.

The framework also outperformed ecological null models. Against a neutral negative-binomial model with community-level parameters, and against a species-specific variant matched in parameter count, the new theory achieved absolute goodness-of-fit consistent with a correctly specified model across all three forests, and beat the alternatives in relative comparisons. Perhaps most tellingly, the fitted parameters carried real biological signal: in the Barro Colorado Island data, gap-exploiting and intermediate tree species showed significantly higher dispersal heterogeneity than shade-tolerant species, consistent with the episodic local dominance that light-demanding trees achieve when canopy gaps open. Effective dispersal strength, by contrast, did not differ significantly between guilds.

The deeper payoff comes when the competitive balances of all species are computed from the fitted parameters. Although dispersal-related parameters varied widely among species in all three forests, the competitive balances themselves were tightly clustered around their mean. The theory predicts exactly this: a group of competing species can coexist as long as their balances are not too dissimilar, with full coexistence possible only within a limited region of balance space surrounding the equal-balance condition. Equal balance does not mean identical traits—simulations with species sharing the same balance but different dispersal strategies produced distinct abundances—so the narrow clustering reflects a community-wide trade-off rather than trait uniformity.

From this clustering, the team derived a vulnerability index: the distance between a community’s position in competitive-balance space and the critical boundary below which a given species cannot persist. A negative value signals persistence; a positive value means eventual competitive exclusion. Applied to the three forests, every analysed species fell safely below its threshold. More provocative was what the index revealed about rarity. Abundance and vulnerability were strongly correlated only near the extinction threshold; far from it, species with low average abundance were not necessarily in danger of competitive suppression. In simulations, species with positive vulnerabilities saw their stationary abundance collapse toward zero, but away from the threshold, abundances spread across a wide range, confirming that being rare does not automatically mean being doomed.

The explanation lies in spatial strategy. Holding mean abundance constant, the researchers found a significant negative partial correlation between the spatial heterogeneity of a species’ space-use distribution and its vulnerability across all three datasets. Two Barro Colorado species made the point vividly: Prioria copaifera and Pterocarpus rohrii differ in total stem count by only about two percent, yet the former’s much more heterogeneous spatial distribution gives it a lower vulnerability. Intuitively, a heterogeneous dispersal strategy lets a species carve out spatial niches where it is hard to displace, trading some overall abundance for local strongholds. This trade-off between abundance, its spatial variability and vulnerability may be a key mechanism sustaining the coexistence of many species in the same forest.

The authors are careful about limits. The vulnerability index predicts final outcomes, not the timescales over which species approach them, and transient dynamics varied substantially in simulations. At very low abundances, demographic randomness will matter, and the framework cannot disentangle local competition from facilitation, both of which are folded into the inferred kernel parameters. Still, the applications are tantalizing: the same machinery could probe how an invasive species with a particular competitive balance might reconfigure a community, or whether suppressing a single species would trigger cascading exclusions like dominoes. An open-source package, vulntool, implements the core calculations. For a field racing to anticipate a potential mass extinction, the message is quietly radical: to know which species are truly at risk, look not just at how many individuals remain, but at how variedly they spread themselves across the landscape.

Subject of Research: A statistical-physics framework quantifying species vulnerability to competitive exclusion in metacommunities using spatial abundance data

Article Title: Dispersal diversity buffers species vulnerability to local extinction

Article References: Bernardi, D., Nicoletti, G., Padmanabha, P., Suweis, S., Azaele, S., Levin, S. A., Rinaldo, A., & Maritan, A. (2026). Dispersal diversity buffers species vulnerability to local extinction. Nature Ecology & Evolution. https://doi.org/10.1038/s41559-026-03195-y

Image Credits: AI Generated

DOI: 10.1038/s41559-026-03195-y

Keywords: community ecology, metacommunity, dispersal, competitive exclusion, species vulnerability, coexistence, statistical physics, forest plots, biodiversity, spatial ecology, dynamical mean-field theory, conservation

The story begins with Cordeschi’s original insight, which Gagliardi revisits and reinterprets. In the 1930s and 1940s, researchers in the emerging behavioral sciences began constructing machines—mechanical and, later, electronic artifacts—that could reproduce intelligent and adaptive behavior. These were not merely engineering curiosities. They functioned as scientific models: ways of testing hypotheses about how minds and nervous systems might work. Kenneth Craik’s 1943 proposal that organisms carry internal models of external reality, Warren McCulloch and Walter Pitts’s 1943 logical calculus of neural activity, and the later cybernetic machines of Norbert Wiener’s circle all exemplified what came to be known as the “Synthetic Method.” Rather than analyzing a natural system into its components and deriving its behavior from first principles, the synthetic method proceeds in the opposite direction: it assembles an artifact from simple parts and observes whether the target behavior emerges.

Gagliardi’s central move is to pair this familiar narrative with a less obvious one from physics. In 1920, Wilhelm Lenz proposed a radically simplified model of ferromagnetism, and his student Ernst Ising worked out its properties in 1925. The Lenz–Ising model represents a magnetic material as a lattice of spins, each of which can point up or down and interacts only with its nearest neighbors. Nothing about the model resembles a real magnet in its fine detail. Yet this deliberately crude artifact turned out to capture something essential about how collective phenomena—phase transitions, critical points, cooperative behavior—arise from local interactions. Gagliardi argues that the introduction of the Ising model in the 1920s represents a methodological turning point in the physical sciences directly analogous to the one occurring at the same time in the behavioral sciences: the embrace of artificial, simulative models as legitimate instruments of scientific understanding.

Why did both fields converge on this strategy? Gagliardi’s answer lies in the mathematics of complexity. In the kinetic theory of gases, the nineteenth-century triumph of Ludwig Boltzmann and James Clerk Maxwell, it was possible to move analytically from the microscopic behavior of particles to macroscopic laws: the model could be solved in closed form, yielding the ideal gas law. But the Ising model resists such treatment. It has been formally proven, in work by Sorin Istrail published in 2000, that computing the ground state of the Ising model is computationally intractable—an NP-hard problem. Assuming the widely held conjecture that P does not equal NP, no closed-form analytical solution exists except in trivial cases. The same wall of intractability confronts cognitive modelers: Paul Thagard and Kevin Verbeurgt showed in 1998 that a connectionist model of coherence as constraint satisfaction is equivalent to the NP-complete Max-Cut problem. When exact analysis is impossible, the only route to understanding is simulation—running the model and observing its behavior.

This is where the concept of computational irreducibility enters. For complex systems, whether biological or material, there is often no shortcut from the model’s specification to its outcomes; one must simply let the dynamics unfold. Gagliardi contends that this epistemic necessity, rather than any mere fashion or convenience, explains why both cognitive science and statistical physics became what he calls “complexity sciences.” Both disciplines, in his phrase, “discovered the artificial”: they came to accept that understanding a system may require building an internal model of it whose behavior can be observed, even when no analytic derivation of that behavior is available. The artificial model becomes not a substitute for explanation but the very medium of explanation.

The philosophical stakes of this claim are considerable. Traditional accounts of scientific explanation, descending from Galileo’s famous declaration that the book of nature is written in mathematical language, privilege derivation: to explain is to deduce consequences from mathematical first principles. Gagliardi argues that the synthetic method extends rather than abandons this Galilean language. The new language of models and simulations adds to mathematical description the capacity to create and run artificial systems whose behavior can be studied. He points to Ernst Mach’s nineteenth-century observation that all science seeks to replace or economize experience through the mental reproduction of facts—reproductions that are easier to handle than experience itself and can stand in for it. Simulation, on this view, is the modern technological fulfillment of Mach’s epistemology of thought-economies, closer in spirit to a gedankenexperiment than to a laboratory measurement.

The article also engages a live debate in the philosophy of science about the epistemic status of computer simulations. Are simulations experiments, or are they theory? Gagliardi notes that observing the physical system under study belongs to the empirical verification phase of the scientific method, whereas observing a simulation pertains to theory and to the deduction of a model’s properties. He acknowledges that this distinction is contested: philosophers such as Anouk Barberousse, Cyrille Imbert and Sara Franceschelli, Claus Beisbart, and Judith Jebeile have argued for a genuine affinity between experiments and simulations, while others, including Julian McClelland and Darrell Rowbottom, treat simulations as instruments rather than faithful recreations of phenomena. Gagliardi’s historical framing gives this debate new context: the question of what simulations are is inseparable from the century-long process by which both physics and the mind sciences learned to trust artificial models.

Perhaps the most provocative element of the paper is its appeal to weak emergence, a concept developed by Mark Bedau, to characterize the new kind of scientific understanding that the synthetic method affords. In systems like the Ising model, there is no causal reductionism linking the internal model to macroscopic phenomena in the way that the kinetic theory analytically links molecular motion to the gas laws. Instead, macroscopic patterns depend on, but are not derivable from, the micro-dynamics—a dependence that must be exhibited through simulation rather than demonstrated through derivation. Gagliardi suggests that explanation centered on the internal functional organization of systems, in the tradition of Robert Cummins’s functional analysis, offers a shared explanatory idiom for both disciplines. Understanding becomes a matter of seeing how a system’s organization produces its capacities, a form of comprehension that simulation makes possible and that pure mathematics alone cannot deliver.

The convergence Gagliardi describes has contemporary resonance. The 2024 Nobel Prize in Physics, awarded for foundational work on artificial neural networks, underscored how deeply the physics of collective phenomena and the science of mind have become intertwined: John Hopfield’s 1982 neural networks drew explicitly on statistical-mechanical ideas, and Boltzmann machines, developed by David Ackley, Geoffrey Hinton and Terrence Sejnowski in 1985, carry the name of the great statistical physicist. Recent work by Iris van Rooij and colleagues has argued for reclaiming artificial intelligence, with its computational models and simulation techniques, as a theoretical foundation for cognitive science, with computational complexity theory playing a central role. Gagliardi’s historical analysis provides the deep background for these developments: they are not accidents of interdisciplinary fashion but expressions of a shared “Culture of the Artificial” that has been consolidating for a hundred years.

The paper, dedicated to the memory of Roberto Cordeschi, ultimately offers a vision of scientific unity that is neither reductionist nor pluralist in the usual senses. Cognitive science and statistical physics remain distinct disciplines with distinct subject matters, yet they are aligned at a deeper epistemic level: both have learned that the road to understanding complex, adaptive, collective phenomena runs through the construction of artificial models and the observation of their simulated behavior. In extending the Galilean language of mathematics into a language of model-building and simulation, twentieth-century science did not abandon rigor; it redefined what counts as explanation for a world whose systems are too complex to be solved, and rich enough to be understood only from the inside out.

Subject of Research: The historical convergence of the synthetic method and artificial modeling in cognitive science and statistical physics

Article Title: The discovery of the artificial and the use of the synthetic method in cognitive and physical sciences

Article References: Gagliardi, F. (2026). The discovery of the artificial and the use of the synthetic method in cognitive and physical sciences. AI & SOCIETY. https://doi.org/10.1007/s00146-026-03291-4

Image Credits: AI Generated

DOI: 10.1007/s00146-026-03291-4

Keywords: synthetic method, discovery of the artificial, cognitive science, statistical physics, Ising model, cybernetics, computer simulation, computational irreducibility, weak emergence, complexity science, Roberto Cordeschi, history of science

The Ising model, borrowed from statistical physics, describes a collection of spins that can each point up or down, with interactions that either favor alignment or anti-alignment between neighboring spins. Finding the lowest-energy spin configuration of such a system is mathematically equivalent to a broad class of hard combinatorial problems, a correspondence that Andrew Lucas laid out systematically in a widely cited 2014 paper in Frontiers of Physics. Because of this equivalence, researchers have long been interested in building physical systems, so-called Ising machines, whose natural dynamics drive them toward low-energy states, allowing the hardware itself to perform the search that would otherwise demand enormous computational effort from conventional digital machines.

Several approaches to Ising machines have been explored over the past decade. In 2016, two landmark demonstrations appeared in Science: a team led by T. Inagaki and colleagues at NTT built a coherent Ising machine using a network of optical parametric oscillators, while Peter McMahon and collaborators at Stanford University demonstrated a similar photonic architecture with improved scaling and solution quality. These photonic systems showed that physical analog hardware could indeed compete with digital algorithms on certain problem instances, sparking a worldwide effort to find faster, cheaper and more compact physical substrates for Ising-style computation.

Magnetic devices entered this race for compelling reasons. A magnetic tunnel junction consists of two ferromagnetic layers separated by a thin insulating barrier, and its resistance depends on the relative orientation of the two magnetizations, parallel or antiparallel. Those two resistance states map naturally onto the two states of an Ising spin, up or down. Furthermore, each magnetic tunnel junction is, in effect, a tiny bar magnet with genuine thermal fluctuations, a property that Kerem Camsari, Rafatul Faria, Brian Sutton and Supriyo Datta exploited in 2017 in Physical Review X to propose stochastic units called p-bits, probabilistic bits that fluctuate between states with tunable bias and can implement powerful sampling-based optimization and inference algorithms when networked together.

The work highlighted in the new perspective, an article by S. Li and colleagues in Nature Electronics, advances this program by using voltage-controlled magnetic anisotropy to switch and modulate the magnetic tunnel junctions in an integrated array. Voltage-controlled magnetic anisotropy, first demonstrated prominently by W.-G. Wang, M. Li, S. Hageman and C. L. Chien in Nature Materials in 2012, allows the magnetic anisotropy of an ultrathin ferromagnetic film, and hence its energy barrier and preferred magnetization direction, to be tuned by applying a voltage across an adjacent gate dielectric. Because this mechanism acts through an electric field rather than a current, it promises dramatically lower energy per operation than current-based switching schemes, addressing one of the central bottlenecks for scaling magnetic logic and memory technologies.

In the architecture described by the perspective, the integrated array of magnetic tunnel junctions serves as a physical realization of Ising spins, while the coupling between spins, the analog of the exchange interactions in the Ising model, encodes the structure of the optimization problem being solved. By driving the array with appropriate voltage control, the system explores the configuration space and relaxes toward low-energy states that correspond to good, and in favorable cases optimal, solutions of the encoded problem. Crucially, the perspective emphasizes that this can be done quickly and with low energy consumption, two figures of merit that determine whether such hardware can move beyond laboratory demonstrations and into practical use for real workloads in logistics, finance, drug discovery and chip design.

The new report builds on a series of recent advances in magnetic Ising and probabilistic computing hardware. In 2023, Y. Shao and colleagues published work in Nanotechnology on magnetic tunnel junction-based approaches to Ising computation, and in 2024, J. Si and collaborators reported in Nature Communications on magnetic tunnel junction arrays for such applications. More recently, in 2026, M. A. Iftakher and colleagues described related stochastic magnetic computing concepts in Nature Communications. Together, these studies trace a rapid trajectory from single-device physics toward integrated, array-scale systems, and the Li and colleagues work reported in Nature Electronics represents an important consolidation of that progress into a functional, integrated platform for model optimization problems.

What makes the magnetic approach particularly attractive is its compatibility with existing semiconductor manufacturing. Magnetic tunnel junctions are already embedded in billions of consumer devices as memory cells, and the materials and process technology for fabricating them at scale is mature. A computing architecture that repurposes these devices as stochastic optimization elements could, in principle, be fabricated alongside conventional CMOS circuitry, opening a path toward hybrid chips in which a conventional processor offloads hard combinatorial kernels to a dense magnetic Ising fabric. The low switching energies enabled by voltage-controlled magnetic anisotropy further strengthen the case, since the energy cost of each spin update is a key determinant of overall system efficiency at scale.

Challenges nonetheless remain before magnetic Ising machines can challenge state-of-the-art algorithms and specialized processors on production-scale problems. The quality of solutions found by physical relaxations depends on the fidelity of the implemented couplings, the stability and controllability of the stochastic dynamics, the number of spins that can be integrated, and the efficiency of reading out and verifying results. Problems of practical interest often involve far more variables than any near-term chip can host, requiring embedding techniques that inflate problem size, and the performance of Ising machines against the best classical solvers continues to be debated. The authors of the perspective, who are affiliated with the George Washington University and the Physical Measurement Laboratory of the National Institute of Standards and Technology, note that demonstrating clear, reproducible advantages on benchmark problems will be essential for the field’s credibility.

Even so, the demonstration that an integrated array of magnetic tunnel junctions can rapidly and efficiently solve Ising-model optimization problems marks a significant milestone at the intersection of magnetism, memory technology and unconventional computing. It suggests that the devices built to remember bits may also be enlisted to search for them, turning the physics of nanoscale magnetism into a computational resource. As the hardware matures and couples more tightly with conventional electronics, magnetic Ising machines could become a practical accelerator for some of the hardest, most economically consequential computational problems that society routinely faces.

Subject of Research: Using integrated arrays of magnetic tunnel junctions with voltage-controlled magnetic anisotropy to accelerate Ising-model-based combinatorial optimization.

Article Title: Magnetic memory accelerates combinatorial optimization

Article References: Zhang, H., Borders, W. A., & Stiles, M. D. (2026). Magnetic memory accelerates combinatorial optimization. Nature Electronics. https://doi.org/10.1038/s41928-026-01713-1

Image Credits: AI Generated

DOI: 10.1038/s41928-026-01713-1

Keywords: magnetic tunnel junctions, Ising machines, combinatorial optimization, voltage-controlled magnetic anisotropy, Nature Electronics, probabilistic computing, spintronics, low-power computing, p-bits, statistical physics, MRAM, unconventional computing