EDBT 2026 Demo / reviewers in the wild / expert
Samraat Pawar
dblp:207/7782
· DBLP profile ↗
6ranked-venue papers
0as first author
5since 2021 · last 2025
0000-0001-8375-5684ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
2 papers |
Visualization and visual analytics · 100% | |
| Theoretical computer science
2 papers |
Graph algorithms and graph theory · 57% Mathematical optimization · 43% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › graph visualization
graph drawing |
0.9 | 2 | 2021 | Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization · IEEE Trans. Vis. Comput. Graph. 2021 Graph Drawing by Stochastic Gradient Descent · IEEE Trans. Vis. Comput. Graph. 2019 |
Visualization and visual analytics › graph visualization
edge bundling |
0.5 | 1 | 2021 | Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization · IEEE Trans. Vis. Comput. Graph. 2021 |
Visualization and visual analytics › graph visualization › graph drawing
force-directed layout |
0.4 | 1 | 2019 | Graph Drawing by Stochastic Gradient Descent · IEEE Trans. Vis. Comput. Graph. 2019 |
Visualization and visual analytics
stress minimization |
0.4 | 1 | 2019 | Graph Drawing by Stochastic Gradient Descent · IEEE Trans. Vis. Comput. Graph. 2019 |
Mathematical optimization › stochastic optimization › stochastic gradient methods
stochastic gradient descent |
0.1 | 1 | 2019 | Graph Drawing by Stochastic Gradient Descent · IEEE Trans. Vis. Comput. Graph. 2019 |
Methods — techniques the papers use, named apart from their topics
routing graph construction · 1.0power graph decomposition · 1.0stochastic gradient descent · 0.8sparse stress approximation · 0.8multidimensional scaling · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Accuracy of the Lotka-Volterra model fails in strongly coupled microbial consumer-resource systemsabstractThe generalized Lotka-Volterra (GLV) model is a cornerstone of theoretical ecology for modeling the dynamics emerging from species interactions within complex ecological communities. The GLV is also increasingly being used to infer species interactions and predict dynamics from empirical data on microbial communities, in particular. However, despite its widespread use, the accuracy of the GLV's pairwise interaction structure in capturing the unseen dynamics of microbial consumer-resource interactions-arising from resource competition and metabolite exchanges-remains unclear. Here, we rigorously quantify how well the GLV can represent the dynamics of a general mathematical model that encapsulates key consumer-resource processes in microbial communities. We find that the GLV significantly misrepresents the feasibility, stability, and reactivity of microbial communities above a threshold biologically feasible level of consumer-resource coupling, because it omits higher-order nonlinear interactions. We show that the probability of the GLV making inaccurate predictions can be quantified by a simple, empirically accessible measure of timescale separation between consumers and resources. These insights advance our understanding of the temporal dynamics of resource-mediated microbial interactions and provide a method for gauging the GLV's reliability across various empirical and theoretical scenarios. Michael P. Mustri, Quqiming Duan, Samraat Pawar |
PLoS Comput. Biol. | 3 |
| 2022 | Investigating microscale patchiness of motile microbes under turbulence in a simulated convective mixed layerabstractMicrobes play a primary role in aquatic ecosystems and biogeochemical cycles. Spatial patchiness is a critical factor underlying these activities, influencing biological productivity, nutrient cycling and dynamics across trophic levels. Incorporating spatial dynamics into microbial models is a long-standing challenge, particularly where small-scale turbulence is involved. Here, we combine a fully 3D direct numerical simulation of convective mixed layer turbulence, with an individual-based microbial model to test the key hypothesis that the coupling of gyrotactic motility and turbulence drives intense microscale patchiness. The fluid model simulates turbulent convection caused by heat loss through the fluid surface, for example during the night, during autumnal or winter cooling or during a cold-air outbreak. We find that under such conditions, turbulence-driven patchiness is depth-structured and requires high motility: Near the fluid surface, intense convective turbulence overpowers motility, homogenising motile and non-motile microbes approximately equally. At greater depth, in conditions analogous to a thermocline, highly motile microbes can be over twice as patch-concentrated as non-motile microbes, and can substantially amplify their swimming velocity by efficiently exploiting fast-moving packets of fluid. Our results substantiate the predictions of earlier studies, and demonstrate that turbulence-driven patchiness is not a ubiquitous consequence of motility but rather a delicate balance of motility and turbulent intensity. Alexander Kier Christensen, Matthew D. Piggott, Erik van Sebille, Maarten van Reeuwijk, Samraat Pawar |
PLoS Comput. Biol. | 5 |
| 2021 | Thermodynamic constraints on the assembly and diversity of microbial ecosystems are different near to and far from equilibriumabstractNon-equilibrium thermodynamics has long been an area of substantial interest to ecologists because most fundamental biological processes, such as protein synthesis and respiration, are inherently energy-consuming. However, most of this interest has focused on developing coarse ecosystem-level maximisation principles, providing little insight into underlying mechanisms that lead to such emergent constraints. Microbial communities are a natural system to decipher this mechanistic basis because their interactions in the form of substrate consumption, metabolite production, and cross-feeding can be described explicitly in thermodynamic terms. Previous work has considered how thermodynamic constraints impact competition between pairs of species, but restrained from analysing how this manifests in complex dynamical systems. To address this gap, we develop a thermodynamic microbial community model with fully reversible reaction kinetics, which allows direct consideration of free-energy dissipation. This also allows species to interact via products rather than just substrates, increasing the dynamical complexity, and allowing a more nuanced classification of interaction types to emerge. Using this model, we find that community diversity increases with substrate lability, because greater free-energy availability allows for faster generation of niches. Thus, more niches are generated in the time frame of community establishment, leading to higher final species diversity. We also find that allowing species to make use of near-to-equilibrium reactions increases diversity in a low free-energy regime. In such a regime, two new thermodynamic interaction types that we identify here reach comparable strengths to the conventional (competition and facilitation) types, emphasising the key role that thermodynamics plays in community dynamics. Our results suggest that accounting for realistic thermodynamic constraints is vital for understanding the dynamics of real-world microbial communities. Jacob Cook, Samraat Pawar, Robert G. Endres |
PLoS Comput. Biol. | 2 |
| 2021 | The role of competition versus cooperation in microbial community coalescenceabstractNew microbial communities often arise through the mixing of two or more separately assembled parent communities, a phenomenon that has been termed "community coalescence". Understanding how the interaction structures of complex parent communities determine the outcomes of coalescence events is an important challenge. While recent work has begun to elucidate the role of competition in coalescence, that of cooperation, a key interaction type commonly seen in microbial communities, is still largely unknown. Here, using a general consumer-resource model, we study the combined effects of competitive and cooperative interactions on the outcomes of coalescence events. To do so, we simulate coalescence events between pairs of communities with different degrees of competition for shared carbon resources and cooperation through cross-feeding on leaked metabolic by-products (facilitation). We also study how structural and functional properties of post-coalescence communities evolve when they are subjected to repeated coalescence events. We find that in coalescence events, the less competitive and more cooperative parent communities contribute a higher proportion of species to the new community because of their superior ability to deplete resources and resist invasions. Consequently, when a community is subjected to repeated coalescence events, it gradually evolves towards being less competitive and more cooperative, as well as more speciose, robust and efficient in resource use. Encounters between microbial communities are becoming increasingly frequent as a result of anthropogenic environmental change, and there is great interest in how the coalescence of microbial communities affects environmental and human health. Our study provides new insights into the mechanisms behind microbial community coalescence, and a framework to predict outcomes based on the interaction structures of parent communities. Pablo Lechón-Alonso, Tom Clegg, Jacob Cook, Thomas P. Smith, Samraat Pawar |
PLoS Comput. Biol. | 5 |
| 2021 | Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network VisualizationabstractBach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and short-circuit problems, and solve both by modifying the routing graph to retain the hierarchical structure of power groups. We also classify the exact type of confluent drawings that the algorithm can produce as 'power-confluent', and prove that it is a subclass of the previously studied 'strict confluent' drawing. A description and source code of our implementation is also provided, which additionally includes an improved method for power graph construction. Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman |
IEEE Trans. Vis. Comput. Graph. | 2 |
| 2019 | Graph Drawing by Stochastic Gradient DescentabstractA popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input. We present an algorithm to minimize its energy function, known as stress, by using stochastic gradient descent (SGD) to move a single pair of vertices at a time. Our results show that SGD can reach lower stress levels faster and more consistently than majorization, without needing help from a good initialization. We then show how the unique properties of SGD make it easier to produce constrained layouts than previous approaches. We also show how SGD can be directly applied within the sparse stress approximation of Ortmann et al. [1], making the algorithm scalable up to large graphs. Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman |
IEEE Trans. Vis. Comput. Graph. | 2 |