Charting an organs’ biological atlas requires us to spatially resolve the entire single-cell transcriptome, and to relate such cellular features to the anatomical scale. Single-cell and single-nucleus RNA-seq (sc/snRNA-seq) can profile cells comprehensively, but lose spatial information. Spatial transcriptomics allows for spatial measurements, but at lower resolution and with limited sensitivity. Targeted in situ technologies solve both issues, but are limited in gene throughput. To overcome these limitations we present Tangram, a method that aligns sc/snRNA-seq data to various forms of spatial data collected from the same region, including MERFISH, STARmap, smFISH, Spatial Transcriptomics (Visium) and histological images. Tangram can map any type of sc/snRNA-seq data, including multimodal data such as those from SHARE-seq, which we used to reveal spatial patterns of chromatin accessibility. We demonstrate Tangram on healthy mouse brain tissue, by reconstructing a genome-wide anatomically integrated spatial map at single-cell resolution of the visual and somatomotor areas.

Dynamical processes on networks have generated widespread interest in recent years. The theory of pattern formation in reaction–diffusion systems defined on symmetric networks has often been investigated, due to its applications in a wide range of disciplines. Here we extend the theory to the case of directed networks, which are found in a number of different fields, such as neuroscience, computer networks and traffic systems. Owing to the structure of the network Laplacian, the dispersion relation has both real and imaginary parts, at variance with the case for a symmetric, undirected network. The homogeneous fixed point can become unstable due to the topology of the network, resulting in a new class of instabilities, which cannot be induced on undirected graphs. Results from a linear stability analysis allow the instability region to be analytically traced. Numerical simulations show travelling waves, or quasi-stationary patterns, depending on the characteristics of the underlying graph.

Networks are a widely used and efficient paradigm to model real-world systems where basic units interact pairwise. Many body interactions are often at play, and cannot be modelled by resorting to binary exchanges. In this work, we consider a general class of dynamical systems anchored on hypergraphs. Hyperedges of arbitrary size ideally encircle individual units so as to account for multiple, simultaneous interactions. These latter are mediated by a combinatorial Laplacian, that is here introduced and characterised. The formalism of the master stability function is adapted to the present setting. Turing patterns and the synchronisation of non linear (regular and chaotic) oscillators are studied, for a general class of systems evolving on hypergraphs. The response to externally imposed perturbations bears the imprint of the higher order nature of the interactions.

We propose a one-parameter family of random walk processes on hypergraphs, where a parameter biases the dynamics of the walker towards hyperedges of low or high cardinality. We show that for each value of the parameter, the resulting process defines its own hypergraph projection on a weighted network. We then explore the differences between them by considering the community structure associated to each random walk process. To do so, we adapt the Markov stability framework to hypergraphs and test it on artificial and real-world hypergraphs.