The research, led by Julia Kuligowski and Guillermo Quintás and colleagues from institutions in Spain, addresses a fundamental interpretive gap. Traditional metabolomic interpretation relies on pathway-based approaches, in which metabolites are grouped into predefined biochemical routes such as glycolysis or the citrate cycle. These groupings have been enormously useful, but they carry well-known drawbacks. Pathway databases are curated inconsistently, metabolites frequently participate in multiple overlapping pathways, and incomplete metabolite coverage means that pathway analyses may miss the very regions of metabolism that matter most. As the authors note, the experimentally observed metabolome is only a sparse projection of the underlying metabolic network, and this sparsity can bias downstream analyses by underestimating the relevance of network structures close to, but not exactly matching, measured features.

To overcome these constraints, the team turned to a concept borrowed from genomics: network propagation. In genetics, graph-based diffusion methods have proven powerful for identifying disease genes and drug targets by spreading association signals across protein and gene interaction networks. The idea is simple in principle and mathematically elegant in practice. If a node carries a signal, its neighbors inherit a portion of that signal, so that information about local measurements is integrated with the global topology of the network. Until now, however, these strategies had rarely been applied to metabolomic data, and never in the specific bipartite form the Spanish team developed.

The key innovation lies in the network’s architecture. Rather than connecting metabolites directly to one another, the researchers reconstructed an undirected bipartite graph in which metabolites and the enzyme-catalyzed reactions that link them are modeled as two distinct node classes. Using the KEGG database, they retrieved compound–reaction associations and filtered the network to focus on core metabolic processes, excluding currency metabolites such as ATP, NADH, and water, which create nonspecific connectivity, as well as peripheral pathway classes such as drug metabolism. The resulting graph contains 8,236 nodes — 1,601 metabolites and 6,635 reactions — connected by 11,867 edges. Community detection using the Louvain algorithm revealed strong modularity, with 126 modules and a modularity value of 0.831, confirming that the network faithfully reflects the compartmentalized organization of biochemistry.

Onto this scaffold, the method places statistical relevance rather than concentration. Each measured metabolite receives a statistical score derived from univariate or multivariate analyses — for example, the negative logarithm of a p-value — while unmeasured metabolites and all reaction nodes are initialized at zero. A random walk-based diffusion operator, defined by the closed-form equation F = (I − αW)⁻¹X, then distributes these scores across the graph. The diffusion parameter α controls how far signal travels: low values restrict propagation to immediate neighbors, while higher values spread information across broader neighborhoods. The team fixed α at 0.5 as an intermediate setting, and a supervised clamping step restored the original scores of measured metabolites after propagation, preserving experimental observations. Finally, a topological distance mask erased signals at nodes more than two steps from any measured metabolite, eliminating background diffusion noise and keeping the inferred features anchored to experimental data.

The critical question, of course, was whether the propagated signals mean anything biologically. To answer it, the researchers built controlled simulations mimicking two distinct metabolic perturbations — oxidative stress and mitochondrial dysfunction — alongside two no-effect control scenarios. Each simulation represented 15 case-versus-control studies, with only 400 of the 1,601 metabolite nodes detectable, replicating the 75 percent sparsity typical of real metabolomic experiments. In the oxidative stress scenario, the perturbed metabolites centered on glutathione metabolism and redox processes; in the mitochondrial dysfunction scenario, they targeted central energy metabolism hubs such as acetyl-CoA, pyruvate, and 2-oxoglutarate, some of which rank among the most connected nodes in the entire network, with degrees exceeding 200.

The results were striking. After propagation and distance masking, the number of non-zero metabolite nodes expanded from 400 to 861, and non-zero reaction nodes from none to 1,863. In both perturbation scenarios, significant nodes clustered in network regions consistent with the simulated biology: oxidative stress propagated signal into glutathione turnover, sulfur metabolism, and purine catabolism, while mitochondrial dysfunction extended into the TCA cycle, amino acid metabolism, and fatty-acid pathways. Degree-matched permutation tests confirmed that the significant metabolites were not randomly scattered — in the oxidative stress case, 98 of 99 significant metabolites formed a single interconnected subnetwork, with mean shortest path distances of roughly five steps, both highly significant results. Pathway over-representation analysis of the propagated feature sets independently recovered the expected enriched pathways, reinforcing that the topology-informed signals tracked genuine biochemical structure rather than diffusion artifacts.

Just as important was what did not happen. In the null comparison between the two no-effect groups, no metabolic or reaction nodes reached statistical significance, and predictive models built on propagated data showed no artificial class separation. This specificity matters because it demonstrates that propagation redistributes background variation without manufacturing signal from noise. Meanwhile, partial least squares discriminant analysis showed statistically significant improvements in predictive performance after propagation in both perturbation scenarios — the discriminant Q² rose from 0.483 to 0.832 in the mitochondrial dysfunction case, a propagation-induced change of 0.349 with a permutation p-value of 0.004 — though the authors caution that such gains depend on the topology of the perturbed regions and should not be assumed for every dataset.

The team then applied the framework to real human data: serum metabolic profiles from 1,336 postmenopausal women enrolled in the Cancer Prevention Study II Nutrition Cohort, comparing estrogen-only users, combined estrogen and progesterone users, and women reporting no hormone use. Of 781 identified metabolites, 229 mapped onto the reference network. Univariate analysis of the propagated, bootstrap-derived statistical profiles identified 51 significant features, including 10 metabolites that had never been measured in the original experiment. Among these network-inferred candidates were 2-hydroxyestrone and 16-glucuronide-estriol, both involved in estrogen phase-I and phase-II metabolism, along with S-adenosyl-L-methionine, a central methyl donor, and several histidine and purine biosynthetic intermediates. The inference of a glucuronidated estrogen metabolite purely through topological connections to measured steroid compounds illustrates exactly the kind of hypothesis the method is designed to generate: candidates that instruments missed but biochemistry suggests deserve targeted follow-up.

Notably, the experimental signal did not consolidate into one globally clustered subgraph — permutation tests for global clustering were not significant — reflecting the multi-focal nature of real biological perturbations spanning steroid biotransformation, purine metabolism, and lipid pathways simultaneously. The authors are careful to frame their method’s limits as clearly as its strengths. Propagated scores represent topology-informed statistical relevance, not reconstructed concentrations, and must never be mistaken for experimental evidence of differential abundance. The extent of diffusion depends on network position, the choice of α and distance thresholds, and the structure of missingness in the data, so sensitivity analyses should accompany any new application. Experimental validation, including targeted measurements and complementary enzyme-level data, remains essential.

Even with those caveats, the study offers metabolomics something it has long lacked: a principled way to let measured data speak for unmeasured chemistry. As instruments and annotation databases improve, the sparse-projection problem will shrink, but it will never disappear entirely — and for the foreseeable future, most of metabolism will remain outside the direct line of sight of any single experiment. By fusing statistical evidence with the wiring diagram of biochemistry itself, bipartite network propagation turns that blindness into a structured search problem, pointing researchers toward the candidates most worth hunting. It is a compelling demonstration that in metabolomics, as in so much of modern biology, context on a graph can be as informative as the measurement itself.

Subject of Research: Network propagation across bipartite metabolite–reaction graphs to extend statistical signals from measured to unmeasured metabolites in metabolomic data exploration.

Article Title: Network propagation in bipartite metabolite–reaction graphs for metabolomic data exploration

Article References: Kuligowski, J., Moreno-Torres, M., Pérez-Guaita, D., Esteve-Turrillas, F. A., & Quintás, G. (2026). Network propagation in bipartite metabolite–reaction graphs for metabolomic data exploration. Metabolomics, 22(5), Article 152. https://doi.org/10.1007/s11306-026-02529-y

Image Credits: AI Generated

DOI: 10.1007/s11306-026-02529-y

Keywords: metabolomics, network propagation, bipartite graph, KEGG, graph diffusion, random walk, PLS-DA, statistical relevance scores, pathway analysis, oxidative stress, mitochondrial dysfunction, hormone therapy

Social influence estimation is a cornerstone problem for platforms that rely on word-of-mouth dynamics. Identifying influential users underpins targeted advertising, viral marketing campaigns, and behavior prediction models. Prior work has long suggested that similarity between users is a significant driver of influence: people tend to trust, imitate, and adopt behaviors from those who resemble them. Traditional approaches measured that resemblance through structural metrics such as common neighbors, Jaccard coefficients, or path-based distances within the social graph. More recent methods turned to representation learning, embedding users into continuous vector spaces where proximity reflects similarity. Yet, as the authors point out, these techniques capture only limited facets of user characteristics, typically ignoring the rich geographic dimension that location-based social networks uniquely provide.

The study addresses this gap with two progressive contributions. The first, called NSH, short for Node Embedding and Spatial Homophily, is a hybrid, unsupervised method that linearly combines embedding-based structural similarity with spatial homophily, the well-documented tendency of geographically close users to be socially connected and behaviorally alike. NSH is deliberately simple and interpretable: it takes a user similarity score derived from network embeddings and blends it with a spatial homophily score computed from check-in co-location patterns. The result is a transparent similarity measure that serves as a strong baseline for analyzing the relationship between similarity and influence, and one that practitioners can compute without heavy machinery.

The second and central innovation is GeoSocial2Vec, an end-to-end unified embedding model designed to learn a single representation for each user by intrinsically merging social ties and spatial co-visitation patterns. Rather than computing two separate similarity scores and averaging them, GeoSocial2Vec constructs a heterogeneous graph in which users, social links, and locations coexist as nodes of different types. An adaptive random walk mechanism then traverses this combined graph, generating sequences of nodes that alternate between social hops and spatial transitions. These walks are fed into a skip-gram style embedding procedure, so that the resulting vectors encode both who a user knows and where a user goes within one coherent geometric space. The adaptive component weights different transition types dynamically, allowing the model to balance social and spatial evidence according to the structure of the data rather than a fixed heuristic.

This design reflects a broader shift in representation learning toward heterogeneous graph embeddings, where multiple node and edge types are embedded jointly instead of being projected into separate spaces. In the context of location-based social networks, the payoff is substantial. Two users who never interact directly but repeatedly visit the same neighborhoods at similar times will land close together in the GeoSocial2Vec embedding, capturing a latent affinity that pure network metrics would miss. Conversely, two friends who live in different cities and never share locations will still be pulled together by their social tie, something a purely geographic model would overlook. The embedding, in effect, learns the full socio-spatial signature of each user.

To test whether these richer similarity measures actually track influence, the researchers evaluated the relationship between user similarity and social influence through Pearson correlation and regression analysis on geographically filtered segments of three real-world location-based social networks: Gowalla, Brightkite, and Foursquare. These datasets, drawn from check-in services that were popular in the early 2010s, remain standard benchmarks in this field because they pair explicit friendship graphs with millions of timestamped location records. Filtering the data geographically ensured that the spatial component of the analysis was meaningful, focusing on regions dense enough for co-visitation patterns to be statistically robust.

The results were striking. Both proposed methods, in which spatial homophily is integrated with embedding-based similarity, produced a significantly stronger correlation with observed influence patterns than classical approaches that rely on structure alone. The GeoSocial2Vec framework achieved the highest accuracy across the benchmarks, demonstrating that intrinsically coupled socio-spatial learning outperforms post-hoc fusion of separate signals. In other words, it matters not just that social and geographic information are both considered, but that they are woven together during representation learning itself, allowing the model to capture interactions between the two dimensions that a linear combination cannot express.

At the same time, the authors are careful not to declare NSH obsolete. While GeoSocial2Vec offers the best predictive performance, the NSH framework retains clear advantages in interpretability and computational simplicity. Because NSH is a linear fusion of two comprehensible scores, an analyst can inspect exactly how much of a predicted influence relationship stems from network proximity versus geographic overlap. This transparency matters in business applications where stakeholders must justify targeting decisions, and in settings where training a deep heterogeneous embedding model is impractical due to limited compute or data volume. The two frameworks thus occupy complementary niches: GeoSocial2Vec as the accuracy-oriented state of the art, and NSH as a practical, explainable tool for everyday analysis.

The implications extend well beyond academic benchmarking. For advertisers on check-in-driven platforms, influence estimation that accounts for where people go, not just who they know, could sharpen the selection of seed users in viral campaigns, ensuring that promotional content spreads through communities that are both socially and geographically primed to receive it. For behavior prediction, the fused embeddings offer a way to anticipate adoption of products, venues, or even public health behaviors by modeling the twin channels of social contagion and spatial co-presence. Urban planners and mobility researchers may also find the technique useful, since the same embeddings encode movement regularities that correlate with social structure.

The study also contributes to a long-running scientific conversation about homophily, the principle that similar individuals connect and influence one another. Spatial homophily has been documented repeatedly in location-based social networks, where the probability of friendship decays with physical distance and shared places act as meeting grounds for ties. By demonstrating that this geographic dimension measurably strengthens the link between similarity and influence, the research quantifies how much predictive power has been left on the table by purely structural methods. It suggests that future influence models, and by extension the recommendation and marketing systems built on them, should treat location not as metadata but as a first-class signal in the learning process.

Technically, the work sits at the intersection of network embedding, heterogeneous graph learning, and random-walk-based representation methods. The adaptive random walk at the heart of GeoSocial2Vec echoes the logic of metapath-guided walks in heterogeneous graphs, but with a twist: transition probabilities are tuned to the data, letting the model decide how often to follow social edges versus spatial co-visit links. This adaptivity is what allows a single embedding space to serve both dimensions faithfully, and it is likely the key reason the framework outperformed the linear NSH fusion. The evaluation methodology, combining Pearson correlation with regression analysis across three independent platforms, adds confidence that the findings are not an artifact of one dataset’s quirks.

Limitations and open questions remain, as they do in any study of this kind. The benchmark datasets are aging, and modern platforms may exhibit different spatial dynamics, particularly as privacy changes and check-in behavior declines in some services. Influence itself is a latent quantity, inferred from observed diffusion patterns rather than measured directly, so all correlation results inherit the assumptions of the influence estimation pipeline. The authors also note that the published version is an early-access, peer-reviewed accepted manuscript carrying a permanent DOI, subject to final editorial edits. Still, the core message is robust: when it comes to understanding who moves whom in location-based social networks, knowing both the social graph and the map beats knowing either alone.

As location-aware platforms continue to blend commerce, mobility, and social connection, methods like GeoSocial2Vec point toward a future in which influence is predicted not from a single flattened network, but from the rich, coupled reality of how people relate and where they roam. The research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors, and the authors declare no competing interests.

Subject of Research: Estimating social influence in location-based social networks using embedding-based similarity and spatial homophily

Article Title: Investigating social influence using embedding-based similarity and spatial homophily on the location based social networks

Article References: Akhavan-Hejazi, Z. S., Ghobaei-Arani, M., & Sajjadi, Z. S. (2026). Investigating social influence using embedding-based similarity and spatial homophily on the location based social networks. Journal of Big Data. https://doi.org/10.1186/s40537-026-01546-x

Image Credits: AI Generated

DOI: 10.1186/s40537-026-01546-x

Keywords: social influence, location-based social networks, node embeddings, spatial homophily, GeoSocial2Vec, heterogeneous graph, random walk, Gowalla, Brightkite, Foursquare, representation learning, targeted advertising