Rohit Sahasrabuddhe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rohit Sahasrabuddhe has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Renaud Lambiotte
Jiangsu University
4 shared publications - Martin Rosvall
Integrated Science Lab, Department of Physics, Umeå University, Umeå, Sweden
3 shared publications - Anton Holmgren
Integrated Science Lab, Department of Physics, Umeå University, SE-901 87 Umeå, Sweden
1 shared publication - Christopher Blöcker
Integrated Science Lab, Department of Physics, Umeå University, SE-901 87 Umeå, Sweden
1 shared publication - Daniel Edler
Integrated Science Lab, Department of Physics, Umeå University, SE-901 87 Umeå, Sweden
1 shared publication - Leonie Neuhäuser
RWTH Aachen University, Aachen, Germany
1 shared publication
Latest Publications
- Open Access
- 20 November 2026
- Published by Springer Nature in EPJ Data Science
From first principles to multi-scale decomposition: mutual information as a segregation index
Segregation operates across demographic and spatial scales and requires careful and principled measurement. In this work, we derive mutual information from well-known general approaches to constructing segregation indices and interpret the mathematical properties that are unique to it. The properties relate mainly to its behaviour when demographic identities and spatial units are coarse-grained. Mutual information decomposes into the contributions of regions and supergroups, which reveals insights that would be inaccessible otherwise. We demonstrate this with an exploratory case study of residential ethnic segregation in England and Wales. Overall, we help researchers identify when mutual information is the only suitable segregation index and provide open source software to support multi-scale analysis.
- 20 November 2026
- Published by Springer Nature in EPJ Data Science
Open AccessFrom first principles to multi-scale decomposition: mutual information as a segregation index
Segregation operates across demographic and spatial scales and requires careful and principled measurement. In this work, we derive mutual information from well-known general approaches to constructing segregation indices and interpret the mathematical properties that are unique to it. The properties relate mainly to its behaviour when demographic identities and spatial units are coarse-grained. Mutual information decomposes into the contributions of regions and supergroups, which reveals insights that would be inaccessible otherwise. We demonstrate this with an exploratory case study of residential ethnic segregation in England and Wales. Overall, we help researchers identify when mutual information is the only suitable segregation index and provide open source software to support multi-scale analysis.
- Open Access
- 8 January 2026
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 7 (1)
Mapping memory-biased dynamics with compact models reveals overlapping communities in large networks
Many real-world systems, from social networks to protein-protein interactions and species distributions, exhibit overlapping flow-based communities that reflect their functional organisation. However, reliably identifying such overlapping flow-based communities requires higher-order relational data, which are often unavailable. To address this challenge, we capitalise on the flow model underpinning the representation-learning algorithm node2vec and model higher-order flows through memory-biased random walks on first-order networks. Instead of simulating these walks, we model their higher-order dynamic constraints with compact models and control model complexity with an information-theoretic approach. Using the map equation framework, we identify overlapping modules in the resulting higher-order networks. Our compact-model approach proves robust across synthetic benchmark networks, reveals interpretable overlapping communities in empirical networks, and scales to large networks.
- 8 January 2026
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 7 (1)
Open AccessMapping memory-biased dynamics with compact models reveals overlapping communities in large networks
Many real-world systems, from social networks to protein-protein interactions and species distributions, exhibit overlapping flow-based communities that reflect their functional organisation. However, reliably identifying such overlapping flow-based communities requires higher-order relational data, which are often unavailable. To address this challenge, we capitalise on the flow model underpinning the representation-learning algorithm node2vec and model higher-order flows through memory-biased random walks on first-order networks. Instead of simulating these walks, we model their higher-order dynamic constraints with compact models and control model complexity with an information-theoretic approach. Using the map equation framework, we identify overlapping modules in the resulting higher-order networks. Our compact-model approach proves robust across synthetic benchmark networks, reveals interpretable overlapping communities in empirical networks, and scales to large networks.
- Open Access
- 10 October 2025
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 11 (41) , eadw4544
Concise network models of memory dynamics reveal explainable patterns in path data
Network methods capture the interplay between structure and dynamics of complex systems across scales by modeling indirect interactions as random walks. However, path data from real-world systems frequently exhibit memory effects that this first-order Markov model fails to capture. Although higher-order Markov models can capture these effects, they grow rapidly in size and require large amounts of data, making them prone to overfitting some parts and underfitting others in systems with uneven coverage. To address this challenge, we construct concise networks from path data by interpolating between first-order and second-order Markov models. We prioritize simplicity and interpretability by creating state nodes that capture prominent second-order effects and by proposing a transparent measure that balances model size and quality. Our concise networks reveal large-scale memory patterns in both synthetic and real-world systems while remaining far simpler than full second-order models.
- 10 October 2025
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 11 (41) , eadw4544
Open AccessConcise network models of memory dynamics reveal explainable patterns in path data
Network methods capture the interplay between structure and dynamics of complex systems across scales by modeling indirect interactions as random walks. However, path data from real-world systems frequently exhibit memory effects that this first-order Markov model fails to capture. Although higher-order Markov models can capture these effects, they grow rapidly in size and require large amounts of data, making them prone to overfitting some parts and underfitting others in systems with uneven coverage. To address this challenge, we construct concise networks from path data by interpolating between first-order and second-order Markov models. We prioritize simplicity and interpretability by creating state nodes that capture prominent second-order effects and by proposing a transparent measure that balances model size and quality. Our concise networks reveal large-scale memory patterns in both synthetic and real-world systems while remaining far simpler than full second-order models.
- 10 October 2025
- Published by American Association for the Advancement of Science (AAAS)
(undefined)
- Open Access
Concise network models of memory dynamics reveal explainable patterns in path data
Networks are a powerful tool to model the structure and dynamics of complex systems across scales. Direct connections between system components are often represented as edges, while paths and walks capture indirect interactions. This approach assumes that flows in the system are sequences of independent transitions. Path data from real-world systems often have higher-order dependencies, which require more sophisticated models. In this work, we propose a method to construct concise networks from path data that interpolate between first and second-order models. We prioritise simplicity and interpretability by creating state nodes that capture latent modes of second-order effects and introducing an interpretable measure to balance model size and accuracy. In both synthetic and real-world applications, our method reveals large-scale memory patterns and constructs concise networks that provide insights beyond the first-order model at the fraction of the size of a second-order model.
Open AccessConcise network models of memory dynamics reveal explainable patterns in path data
Networks are a powerful tool to model the structure and dynamics of complex systems across scales. Direct connections between system components are often represented as edges, while paths and walks capture indirect interactions. This approach assumes that flows in the system are sequences of independent transitions. Path data from real-world systems often have higher-order dependencies, which require more sophisticated models. In this work, we propose a method to construct concise networks from path data that interpolate between first and second-order models. We prioritise simplicity and interpretability by creating state nodes that capture latent modes of second-order effects and introducing an interpretable measure to balance model size and accuracy. In both synthetic and real-world applications, our method reveals large-scale memory patterns and constructs concise networks that provide insights beyond the first-order model at the fraction of the size of a second-order model.
- Open Access
- 2 February 2021
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 2 (2) , 025006
Modelling non-linear consensus dynamics on hypergraphs
The basic interaction unit of many dynamical systems involves more than two nodes. In such situations where networks are not an appropriate modelling framework, it has recently become increasingly popular to turn to higher-order models, including hypergraphs. In this paper, we explore the non-linear dynamics of consensus on hypergraphs, allowing for interactions within hyperedges of any cardinality. After discussing the different ways in which nonlinearities can be incorporated in the dynamical model, building on different sociological theories, we explore its mathematical properties and perform simulations to investigate them numerically. After focussing on synthetic hypergraphs, namely on block hypergraphs, we investigate the dynamics on real-world structures, and explore in detail the role of involvement and stubbornness on polarisation.
- 2 February 2021
- Published by IOP Publishing in Journal of Physics: Complexity
- Vol. 2 (2) , 025006
Open AccessModelling non-linear consensus dynamics on hypergraphs
The basic interaction unit of many dynamical systems involves more than two nodes. In such situations where networks are not an appropriate modelling framework, it has recently become increasingly popular to turn to higher-order models, including hypergraphs. In this paper, we explore the non-linear dynamics of consensus on hypergraphs, allowing for interactions within hyperedges of any cardinality. After discussing the different ways in which nonlinearities can be incorporated in the dynamical model, building on different sociological theories, we explore its mathematical properties and perform simulations to investigate them numerically. After focussing on synthetic hypergraphs, namely on block hypergraphs, we investigate the dynamics on real-world structures, and explore in detail the role of involvement and stubbornness on polarisation.