arXiv subjects

Shaswat Mohanty

Publications and source records attributed to Shaswat Mohanty.

13 recordsLinked to original sources

arXiv2026

Why is the strength of an elastomeric polymer network so low?

Experiments have long shown that a polymer network of covalent bonds commonly ruptures at a stress that is orders of magnitude lower than the strength of the covalent bonds. Here we investigate this large reduction in strength by coarse-grained molecular dynamics simulations. We show that the network ruptures by sequentially breaking a small fraction of bonds, and that each broken bond lies on the minimum "shortest path". The shortest path is the path of the fewest bonds that connect two monomers at the opposite ends of the network. As the network is stretched, the minimum shortest path straightens and bears high tension set by covalent bonds, while most strands off the path deform by entropic elasticity. After a bond on the minimum shortest path breaks, the process repeats for the next minimum shortest path. As the network is stretched and bonds are broken, the scatter in lengths of the shortest paths first narrows, causing stress to rise, and then broadens, causing stress to decline. This sequential breaking of a small fraction of bonds causes the network to rupture at a stress that is orders of magnitude below the strength of the covalent bonds.

cond-mat.soft↗

arXiv2026

Learning Interatomic Force Coefficients from X-ray Thermal Diffuse Scattering Data

We present a fully automated framework for extracting interatomic force constants (IFCs) directly from X-ray thermal diffuse scattering (TDS) data. By formulating scattering intensity as a differentiable function of a symmetry-reduced IFC parameterization, we enable gradient-based optimization via direct, Cholesky-based sampling of correlated atomic displacements at thermal equilibrium. This approach bypasses the computational bottleneck of repeated Hessian matrix diagonalizations, significantly accelerating the inversion process. Benchmark tests demonstrate that the framework accurately recovers ground-truth IFCs and phonon dispersion relations, providing a robust, high-throughput pathway for studying lattice dynamics across diverse crystalline materials. This method bridges the gap between experimental observations and computational modeling, enabling the direct integration of TDS data into the refinement of high-fidelity inter-atomic potentials.

physics.comp-ph↗

arXiv2026

From Connectivity to Rupture: A Coarse-Grained Stochastic Network Dynamics Approach to Polymer Network Mechanics

We introduce a coarse-grained stochastic network dynamics (CGSND) framework for modeling deformation and rupture in polymer networks. The method replaces explicit molecular dynamics (MD) or coarse-grained molecular dynamics (CGMD) with network-level evolution rules while retaining chain entropic elasticity and force-controlled bond failure. Under uniaxial loading, CGSND reproduces the characteristic nonlinear stress--stretch response of elastomeric networks, including a well-defined ultimate tensile strength and post-peak softening due to progressive bond rupture. Comparison with coarse-grained molecular dynamics (CGMD) simulations shows that CGSND captures the qualitative form of the stress response and the onset of catastrophic damage despite its rate-independent formulation. Analysis of rupture kinetics reveals a pronounced peak in the bond-breaking hazard rate near the ultimate tensile strength in both approaches. In addition, the distribution of broken segment lengths remains statistically indistinguishable from the initial network, indicating that rupture is not biased toward short or long chains. Finally, the evolution of the Gini coefficient of bond force magnitudes reveals strong force localization preceding failure. These results demonstrate that CGSND provides a computationally efficient and physically interpretable framework for connecting force localization and rupture kinetics to macroscopic failure in polymer networks.

cond-mat.soft↗

arXiv2026

On the First Passage Times of Branching Random Walks in $\mathbb R^d$

We study the first passage times of discrete-time branching random walks in ${\mathbb R}^d$ where $d\geq 1$. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage times to a ball of radius one with a distance $x$ from the origin, conditioned upon survival. We provide explicitly the linear dominating term and the logarithmic correction term as a function of $x$. The asymptotics are precise up to an order of $o_{\mathbb P}(\log x)$ for general jump distributions and up to $O_{\mathbb P}(\log\log x)$ for spherically symmetric jumps. A crucial ingredient of both results is the tightness of first passage times. We also discuss an extension of the first passage time analysis to a modified branching random walk model that has been proven to successfully capture shortest path statistics in polymer networks.

math.PR↗

arXiv2026

StockBot 2.0: Vanilla LSTMs Outperform Transformer-based Forecasting for Stock Prices

Accurate forecasting of financial markets remains a long-standing challenge due to complex temporal and often latent dependencies, non-linear dynamics, and high volatility. Building on our earlier recurrent neural network framework, we present an enhanced StockBot architecture that systematically evaluates modern attention-based, convolutional, and recurrent time-series forecasting models within a unified experimental setting. While attention-based and transformer-inspired models offer increased modeling flexibility, extensive empirical evaluation reveals that a carefully constructed vanilla LSTM consistently achieves superior predictive accuracy and more stable buy/sell decision-making when trained under a common set of default hyperparameters. These results highlight the robustness and data efficiency of recurrent sequence models for financial time-series forecasting, particularly in the absence of extensive hyperparameter tuning or the availability of sufficient data when discretized to single-day intervals. Additionally, these results underscore the importance of architectural inductive bias in data-limited market prediction tasks.

cs.CE↗

arXiv2025

Large Deviations of First Passage Times of Branching Random Walks in $\mathbb{R}^d$: Asymptotics and Algorithms

We investigate the large deviation probabilities of first passage times (FPT) of discrete-time supercritical non-lattice branching random walks (BRWs) in $\mathbb{R}^d$ where $d\geq 1$. The FPT refers to the first time the BRW enters a ball of radius one with a distance $x$ from the origin, conditioned upon the process's survival. Furthermore, we apply the spine decomposition technique to construct an asymptotically optimal polynomial-time algorithm for computing the lower large deviation probabilities of the FPT. The accuracy of our algorithm is also verified numerically. Our analysis not only provides a deeper theoretical understanding of these stochastic processes but also offers new insights into the microstructural features that are key to characterizing the strength of polymers.

math.PR↗

arXiv2024

Generalizability of Graph Neural Network Force Fields for Predicting Solid-State Properties

Machine-learned force fields (MLFFs) promise to offer a computationally efficient alternative to ab initio simulations for complex molecular systems. However, ensuring their generalizability beyond training data is crucial for their wide application in studying solid materials. This work investigates the ability of a graph neural network (GNN)-based MLFF, trained on Lennard-Jones Argon, to describe solid-state phenomena not explicitly included during training. We assess the MLFF's performance in predicting phonon density of states (PDOS) for a perfect face-centered cubic (FCC) crystal structure at both zero and finite temperatures. Additionally, we evaluate vacancy migration rates and energy barriers in an imperfect crystal using direct molecular dynamics (MD) simulations and the string method. Notably, vacancy configurations were absent from the training data. Our results demonstrate the MLFF's capability to capture essential solid-state properties with good agreement to reference data, even for unseen configurations. We further discuss data engineering strategies to enhance the generalizability of MLFFs. The proposed set of benchmark tests and workflow for evaluating MLFF performance in describing perfect and imperfect crystals pave the way for reliable application of MLFFs in studying complex solid-state materials.

cs.LG↗

arXiv2024

Modeling Shortest Paths in Polymeric Networks using Spatial Branching Processes

Recent studies have established a connection between the macroscopic mechanical response of polymeric materials and the statistics of the shortest path (SP) length between distant nodes in the polymer network. Since these statistics can be costly to compute and difficult to study theoretically, we introduce a branching random walk (BRW) model to describe the SP statistics from the coarse-grained molecular dynamics (CGMD) simulations of polymer networks. We postulate that the first passage time (FPT) of the BRW to a given termination site can be used to approximate the statistics of the SP between distant nodes in the polymer network. We develop a theoretical framework for studying the FPT of spatial branching processes and obtain an analytical expression for estimating the FPT distribution as a function of the cross-link density. We demonstrate by extensive numerical calculations that the distribution of the FPT of the BRW model agrees well with the SP distribution from the CGMD simulations. The theoretical estimate and the corresponding numerical implementations of BRW provide an efficient way of approximating the SP distribution in a polymer network. Our results have the physical meaning that by accounting for the realistic topology of polymer networks, extensive bond-breaking is expected to occur at a much smaller stretch than that expected from idealized models assuming periodic network structures. Our work presents the first analysis of polymer networks as a BRW and sets the framework for developing a generalizable spatial branching model for studying the macroscopic evolution of polymeric systems.

math-ph↗

arXiv2024

Network evolution controlling strain-induced damage and self-healing of elastomers with dynamic bonds

Highly stretchable and self-healable supramolecular elastomers are promising materials for future soft electronics, biomimetic systems, and smart textiles, due to their dynamic cross-linking bonds. The dynamic or reversible nature of the cross-links gives rise to interesting macroscopic responses in these materials such as self-healing and rapid stress-relaxation. However, the relationship between bond activity and macroscopic mechanical response, and the self-healing properties of these dynamic polymer networks (DPNs) remains poorly understood. Using coarse-grained molecular dynamics (CGMD) simulations, we reveal a fundamental connection between the macroscopic behaviors of DPNs and the shortest paths between distant nodes in the polymer network. Notably, the trajectories of the material on the shortest path-strain map provide key insights into understanding the stress-strain hysteresis, anisotropy, stress relaxation, and self-healing of DPNs. Based on CGMD simulations under various loading histories, we formulate a set of empirical rules that dictate how the shortest path interacts with stress and strain. This lays the foundation for the development of a physics-based theory centered around the non-local microstructural feature of shortest paths to predict the mechanical behavior of DPNs.

cond-mat.soft↗

arXiv2023

Evaluating the Transferability of Machine-Learned Force Fields for Material Property Modeling

Machine-learned force fields have generated significant interest in recent years as a tool for molecular dynamics (MD) simulations, with the aim of developing accurate and efficient models that can replace classical interatomic potentials. However, before these models can be confidently applied to materials simulations, they must be thoroughly tested and validated. The existing tests on the radial distribution function and mean-squared displacements are insufficient in assessing the transferability of these models. Here we present a more comprehensive set of benchmarking tests for evaluating the transferability of machine-learned force fields. We use a graph neural network (GNN)-based force field coupled with the OpenMM package to carry out MD simulations for Argon as a test case. Our tests include computational X-ray photon correlation spectroscopy (XPCS) signals, which capture the density fluctuation at various length scales in the liquid phase, as well as phonon density-of-state in the solid phase and the liquid-solid phase transition behavior. Our results show that the model can accurately capture the behavior of the solid phase only when the configurations from the solid phase are included in the training dataset. This underscores the importance of appropriately selecting the training data set when developing machine-learned force fields. The tests presented in this work provide a necessary foundation for the development and application of machine-learned force fields for materials simulations.

cs.LG↗

arXiv2023

Computational Approaches to Model X-ray Photon Correlation Spectroscopy from Molecular Dynamics

X-ray photon correlation spectroscopy (XPCS) allows for the resolution of dynamic processes within a material across a wide range of length and time scales. X-ray speckle visibility spectroscopy (XSVS) is a related method that uses a single diffraction pattern to probe ultrafast dynamics. Interpretation of the XPCS and XSVS data in terms of underlying physical processes is necessary to establish the connection between the macroscopic responses and the microstructural dynamics. To aid the interpretation of the XPCS and XSVS data, we present a computational framework to model these experiments by computing the X-ray scattering intensity directly from the atomic positions obtained from molecular dynamics (MD) simulations. We compare the efficiency and accuracy of two alternative computational methods: the direct method computing the intensity at each diffraction vector separately, and a method based on fast Fourier transform that computes the intensities at all diffraction vectors at once. The computed X-ray speckle patterns capture the density fluctuations over a range of length and time scales and are shown to reproduce the known properties and relations of experimental XPCS and XSVS for liquids.

math.NA↗

arXiv2023

Understanding Urban Water Consumption using Remotely Sensed Data

Urban metabolism is an active field of research that deals with the estimation of emissions and resource consumption from urban regions. The analysis could be carried out through a manual surveyor by the implementation of elegant machine learning algorithms. In this exploratory work, we estimate the water consumption by the buildings in the region captured by satellite imagery. To this end, we break our analysis into three parts: i) Identification of building pixels, given a satellite image, followed by ii) identification of the building type (residential/non-residential) from the building pixels, and finally iii) using the building pixels along with their type to estimate the water consumption using the average per unit area consumption for different building types as obtained from municipal surveys.

cs.CV↗

arXiv2022

StockBot: Using LSTMs to Predict Stock Prices

The evaluation of the financial markets to predict their behaviour have been attempted using a number of approaches, to make smart and profitable investment decisions. Owing to the highly non-linear trends and inter-dependencies, it is often difficult to develop a statistical approach that elucidates the market behaviour entirely. To this end, we present a long-short term memory (LSTM) based model that leverages the sequential structure of the time-series data to provide an accurate market forecast. We then develop a decision making StockBot that buys/sells stocks at the end of the day with the goal of maximizing profits. We successfully demonstrate an accurate prediction model, as a result of which our StockBot can outpace the market and can strategize for gains that are ~15 times higher than the most aggressive ETFs in the market.

q-fin.ST↗