arXiv subjects

Aanjaneya Kumar

Publications and source records attributed to Aanjaneya Kumar.

At least 19 recordsLinked to original sources

arXiv2026

The Origins of Transient Bimodality

Many dynamical systems exhibit diverse modes of behavior. In biology, such modes can represent individual or cell fates. While the emergence of multimodality is commonly studied, transient bimodality is much less well understood. Under transient bimodality, a system moving from a well-defined initial to a final state transiently undergoes a bifurcation into multiple probability modes. This noise-driven phenomenon can significantly impact processes such as cell differentiation and speciation in the presence of changing environmental conditions. We detail a theoretical approach for understanding transient bimodality connecting results from ecology, optics, chemical reaction networks and cell biology, propose a ``minimal model'' of transient bimodality and derive a general criterion for its presence. We show that fast-to-slow dynamics can lead to transient bimodality in addition to the well-known case of slow-to-fast dynamics. Finally, we discuss the role of transient bimodality across the scientific literature, with emphasis on biochemical kinetics and gene regulation.

q-bio.SC↗

arXiv2026

Branching under First-Passage Resetting

Many biological processes, from cell division to viral lysis, are triggered when an internal stochastic variable reaches a threshold. Here we introduce Branching under First-Passage Resetting, a general framework in which replication events arise endogenously from first-passage dynamics rather than from externally imposed lifetime clocks. We show that the resulting population dynamics obey an exact renewal equation linking single-trajectory first-passage statistics to the population growth rate. This mapping shows that, for fixed offspring number and fixed mean replication time, stochastic timing fluctuations necessarily enhance growth relative to a deterministic clock. When offspring yield depends on the first-passage time, however, fluctuations have non-trivial effects and expose a fundamental yield-delay trade-off: waiting longer can increase the number of descendants, but delays all future lineages. Our framework allows us to address this optimization problem analytically, and upon application to bacteriophage lysis, gives an optimal lysis time and growth rate consistent with empirical data.

q-bio.PE↗

arXiv2026

Dynamic redundancy and mortality in stochastic search

Search processes are a fundamental part of natural and artificial systems. In such settings, the number of searchers is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these dynamics, their combined influence on search efficiency remains unexplored. Here we present a general framework for stochastic search in which independent agents progressively join and leave the process, a mechanism we term dynamic redundancy and mortality (DRM). Under minimal assumptions on the underlying search dynamics, this framework yields exact first-passage time statistics. It further reveals surprising connections to stochastic resetting, including a regime in which the resetting mean first-passage time emerges as a universal lower bound for DRM, as well as regimes in which DRM search is faster. We illustrate our results through a detailed analysis of one-dimensional Brownian DRM search. Altogether, this work provides a rigorous foundation for studying first-passage processes with a fluctuating number of searchers, with direct relevance across physical, biological, and algorithmic systems.

cond-mat.stat-mech↗

arXiv2025

Chase-escape with conversion as a multiple sclerosis lesion model

We introduce conversion to the stochastic process known as chase-escape in an effort to model aspects of inflammatory damage from multiple sclerosis. We prove monotonicity results for aggregate damage for the model on the positive integers, trees, stars, and the complete graph. Additionally, we establish the existence and asymptotic order of a phase transition on bounded degree graphs with a non-trivial site percolation threshold.

math.PR↗

arXiv2025

Voter Turnouts Govern Key Electoral Statistics

Elections, the cornerstone of democratic societies, are usually regarded as unpredictable due to the complex interactions that shape them at different levels. In this work, we show that voter turnouts contain crucial information that can be leveraged to predict several key electoral statistics with remarkable accuracy. Using the recently proposed random voting model, we analytically derive the scaled distributions of votes secured by winners, runner-ups, and margins of victory, and demonstrating their strong correlation with turnout distributions. By analyzing Indian election data -- spanning multiple decades and electoral scales -- we validate these predictions empirically across all scales, from large parliamentary constituencies to polling booths. Further, we uncover a surprising scale-invariant behavior in the distributions of scaled margins of victory, a characteristic signature of Indian elections. Finally, we demonstrate a robust universality in the distribution of the scaled margin-to-turnout ratios.

physics.soc-ph↗

arXiv2024

Universal Statistics of Competition in Democratic Elections

Elections for public offices in democratic nations are large-scale examples of collective decision-making. As a complex system with a multitude of interactions among agents, we can anticipate that universal macroscopic patterns could emerge independent of microscopic details. Despite the availability of empirical election data, such universality, valid at all scales, countries, and elections, has not yet been observed. In this work, we propose a parameter-free voting model and analytically show that the distribution of the victory margin is driven by that of the voter turnout, and a scaled measure depending on margin and turnout leads to a robust universality. This is demonstrated using empirical election data from $34$ countries, spanning multiple decades and electoral scales. The deviations from the model predictions and universality indicate possible electoral malpractices. We argue that this universality is a stylized fact indicating the competitive nature of electoral outcomes.

physics.soc-ph↗

arXiv2023

Phase transitions in systems of particles with only hard-core interactions

This article contains our comments and views on the status of the current understanding of phase transitions in systems with only hard-core interactions, based on our work in this area. The equation of state for the hard sphere gas in $d$-dimensions is discussed. The universal repulsive Lee-Yang singularities in the complex activity plane, and its relation to the directed and undirected polymer models are outlined. We also discuss orientationally disordered crystalline mesophases, and some of their models.

cond-mat.stat-mech↗

arXiv2022

Depolarization of opinions on social networks through random nudges

Polarization of opinions has been empirically noted in many online social network platforms. Traditional models of opinion dynamics, based on statistical physics principles, do not account for the emergence of polarization and echo chambers in online network platforms. A recently introduced opinion dynamics model that incorporates the homophily factor -- the tendency of agents to connect with those holding similar opinions as their own -- captures polarization and echo chamber effects. In this work, we provide a non-intrusive framework for mildly nudging agents in an online community to form random connections. This is shown to lead to significant depolarization of opinions and decrease the echo chamber effects. Remarkably, even a mild nudge is seen to be effective in avoiding polarization, though a large nudge leads to another undesirable effect, namely, radicalization. Further, we obtain the optimal nudge factor to avoid the extremes of polarization and radicalization outcomes.

physics.soc-ph↗

arXiv2022

Continuous Gated First-Passage Processes

Gated first-passage processes, where completion depends on both hitting a target and satisfying additional constraints, are prevalent across various fields. Despite their significance, analytical solutions to basic problems remain unknown, e.g. the detection time of a diffusing particle by a gated interval, disk, or sphere. In this paper, we elucidate the challenges posed by continuous gated first-passage processes and present a renewal framework to overcome them. This framework offers a unified approach for a wide range of problems, including those with single-point, half-line, and interval targets. The latter have so far evaded exact solutions. Our analysis reveals that solutions to gated problems can be obtained directly from the ungated dynamics. This, in turn, reveals universal properties and asymptotic behaviors, shedding light on cryptic intermediate-time regimes and refining the notion of high-crypticity for continuous-space gated processes. Moreover, we extend our formalism to higher dimensions, showcasing its versatility and applicability. Overall, this work provides valuable insights into the dynamics of continuous gated first-passage processes and offers analytical tools for studying them across diverse domains.

cond-mat.stat-mech↗

arXiv2022

Inference from gated first-passage times

First-passage times provide invaluable insight into fundamental properties of stochastic processes. Yet, various forms of gating mask first-passage times and differentiate them from actual detection times. For instance, imperfect conditions may intermittently gate our ability to observe a system of interest, such that exact first-passage instances might be missed. In other cases, e.g., certain chemical reactions, direct observation of the molecules involved is virtually impossible, but the reaction event itself can be detected. However, this instance need not coincide with the first collision time since some molecular encounters are infertile and hence gated. Motivated by the challenge posed by such real-life situations we develop a universal -- model-free -- framework for the inference of first-passage times from the detection times of gated first-passage processes. In addition, when the underlying laws of motions are known, our framework also provides a way to infer physically meaningful parameters, e.g. diffusion coefficients. Finally, we show how to infer the gating rates themselves via the hitherto overlooked short-time regime of the measured detection times. The robustness of our approach and its insensitivity to underlying details are illustrated in several settings of physical relevance.

cond-mat.stat-mech↗

arXiv2022

Universal framework for record ages under restart

We propose a universal framework to compute record age statistics of a stochastic time-series that undergoes random restarts. The proposed framework makes minimal assumptions on the underlying process and is furthermore suited to treat generic restart protocols going beyond the Markovian setting. After benchmarking the framework for classical random walks on the $1$D lattice, we derive a universal criterion underpinning the impact of restart on the age of the $n$th record for generic time-series with nearest-neighbor transitions. Crucially, the criterion contains a penalty of order $n$, that puts strong constraints on restart expediting the creation of records, as compared to the simple first-passage completion. The applicability of our approach is further demonstrated on an aggregation-shattering process where we compute the typical growth rates of aggregate sizes. This unified framework paves the way to explore record statistics of time-series under restart in a wide range of complex systems.

cond-mat.stat-mech↗

arXiv2022

First-passage times of multiple diffusing particles with reversible target-binding kinetics

We investigate a class of diffusion-controlled reactions that are initiated at the time instance when a prescribed number $K$ among $N$ particles independently diffusing in a solvent are simultaneously bound to a target region. In the irreversible target-binding setting, the particles that bind to the target stay there forever, and the reaction time is the $K$-th fastest first-passage time to the target, whose distribution is well-known. In turn, reversible binding, which is common for most applications, renders theoretical analysis much more challenging and drastically changes the distribution of reaction times. We develop a renewal-based approach to derive an approximate solution for the probability density of the reaction time. This approximation turns out to be remarkably accurate for a broad range of parameters. We also analyze the dependence of the mean reaction time or, equivalently, the inverse reaction rate, on the main parameters such as $K$, $N$, and binding/unbinding constants. Some biophysical applications and further perspectives are briefly discussed.

physics.chem-ph↗

arXiv2022

Reversible Target-Binding Kinetics of Multiple Impatient Particles

Certain biochemical reactions can only be triggered after binding of a sufficient number of particles to a specific target region such as an enzyme or a protein sensor. We investigate the distribution of the reaction time, i.e., the first instance when all independently diffusing particles are bound to the target. When each particle binds irreversibly, this is equivalent to the first-passage time of the slowest (last) particle. In turn, reversible binding to the target renders the problem much more challenging and drastically changes the distribution of the reaction time. We derive the exact solution of this problem and investigate the short-time and long-time asymptotic behaviors of the reaction time probability density. We also analyze how the mean reaction time depends on the unbinding rate and the number of particles. Our exact and asymptotic solutions are compared to Monte Carlo simulations.

physics.chem-ph↗

arXiv2021

Evolution of honesty in higher-order social networks

Sender-receiver games are simple models of information transmission that provide a formalism to study the evolution of honest signaling and deception between a sender and a receiver. In many practical scenarios, lies often affect groups of receivers, which inevitably entangles the payoffs of individuals to the payoffs of other agents in their group, and this makes the formalism of pairwise sender-receiver games inapt for where it might be useful the most. We therefore introduce group interactions among receivers, and study how their interconnectedness in higher-order social networks affects the evolution of lying. We observe a number of counterintuitive results that are rooted in the complexity of the underlying evolutionary dynamics, which has thus far remained hidden in the realm of pairwise interactions. We find conditions for honesty to persist even when there is a temptation to lie, and we observe the prevalence of moral strategy profiles even when lies favor the receiver at a cost to the sender. We confirm the robustness of our results by further performing simulations on hypergraphs created from real-world data using the SocioPatterns database. Altogether, our results provide persuasive evidence that moral behaviour may evolve on higher-order social networks, at least as long as individuals interact in groups that are small compared to the size of the network.

physics.soc-ph↗

arXiv2021

First detection of threshold crossing events under intermittent sensing

The time of the first occurrence of a threshold crossing event in a stochastic process, known as the first passage time, is of interest in many areas of sciences and engineering. Conventionally, there is an implicit assumption that the notional 'sensor' monitoring the threshold crossing event is always active. In many realistic scenarios, the sensor monitoring the stochastic process works intermittently. Then, the relevant quantity of interest is the $\textit{first detection time}$, which denotes the time when the sensor detects the threshold crossing event for the first time. In this work, a birth-death process monitored by a random intermittent sensor is studied, for which the first detection time distribution is obtained. In general, it is shown that the first detection time is related to, and is obtainable from, the first passage time distribution. Our analytical results display an excellent agreement with simulations. Further, this framework is demonstrated in several applications -- the SIS compartmental and logistic models, and birth-death processes with resetting. Finally, we solve the practically relevant problem of inferring the first passage time distribution from the first detection time.

cond-mat.stat-mech↗

arXiv2021

Simplicial contagion in temporal higher-order networks

Complex networks represent the natural backbone to study epidemic processes in populations of interacting individuals. Such a modeling framework, however, is naturally limited to pairwise interactions, making it less suitable to properly describe social contagion, where individuals acquire new norms or ideas after simultaneous exposure to multiple sources of infections. Simplicial contagion has been proposed as an alternative framework where simplices are used to encode group interactions of any order. The presence of higher-order interactions leads to explosive epidemic transitions and bistability which cannot be obtained when only dyadic ties are considered. In particular, critical mass effects can emerge even for infectivity values below the standard pairwise epidemic threshold, where the size of the initial seed of infectious nodes determines whether the system would eventually fall in the endemic or the healthy state. Here we extend simplicial contagion to time-varying networks, where pairwise and higher-order simplices can be created or destroyed over time. By following a microscopic Markov chain approach, we find that the same seed of infectious nodes might or might not lead to an endemic stationary state, depending on the temporal properties of the underlying network structure, and show that persistent temporal interactions anticipate the onset of the endemic state in finite-size systems. We characterize this behavior on higher-order networks with a prescribed temporal correlation between consecutive interactions and on heterogeneous simplicial complexes, showing that temporality again limits the effect of higher-order spreading, but in a less pronounced way than for homogeneous structures. Our work suggests the importance of incorporating temporality, a realistic feature of many real-world systems, into the investigation of dynamical processes beyond pairwise interactions.

physics.soc-ph↗

arXiv2021

Chase-Escape Percolation on the 2D Square Lattice

Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to neighboring empty sites at rate $p$, and predator particles spread only to neighboring sites occupied by prey particles at rate $1$, killing the prey particle that existed at that site. It was found that the prey can survive with non-zero probability, if $p>p_c$ with $p_c<1$. Using Monte Carlo simulations on the square lattice, we estimate the value of $p_c = 0.49451 \pm 0.00001$, and the critical exponents are consistent with the undirected percolation universality class. We define a discrete-time parallel-update version of the model, which brings out the relation between chase-escape and undirected bond percolation. For all $p < p_c$ in $D$-dimensions, the number of predators in the absorbing configuration has a stretched-exponential distribution in contrast to the exponential distribution in the standard percolation theory. We also study the problem starting from the line initial condition with predator particles on all lattice points of the line $y=0$ and prey particles on the line $y=1$. In this case, for $p_c<p < 1$, the center of mass of the fluctuating prey and predator fronts travel at the same speed. This speed is strictly smaller than the speed of an Eden front with the same value of $p$, but with no predators. At $p=1$, the fronts undergo a depinning transition. The fluctuations of the front follow Kardar-Parisi-Zhang scaling both above and below this depinning transition.

cond-mat.stat-mech↗

arXiv2020

The evolution of trust and trustworthiness

Trust and trustworthiness form the basis for continued social and economic interactions, and they are also fundamental for cooperation, fairness, honesty, and indeed for many other forms of prosocial and moral behavior. However, trust entails risks, and building a trustworthy reputation requires effort. So how did trust and trustworthiness evolve, and under which conditions do they thrive? To find answers, we operationalize trust and trustworthiness using the trust game with the trustor's investment and the trustee's return of the investment as the two key parameters. We study this game on different networks, including the complete network, random and scale-free networks, and in the well-mixed limit. We show that in all but one case the network structure has little effect on the evolution of trust and trustworthiness. Specifically, for well-mixed populations, lattices, random and scale-free networks, we find that trust never evolves, while trustworthiness evolves with some probability depending on the game parameters and the updating dynamics. Only for the scale-free network with degree non-normalized dynamics, we find parameter values for which trust evolves but trustworthiness does not, as well as values for which both trust and trustworthiness evolve. We conclude with a discussion about mechanisms that could lead to the evolution of trust and outline directions for future work.

physics.soc-ph↗