arXiv subjects

Supriya Krishnamurthy

Publications and source records attributed to Supriya Krishnamurthy.

At least 37 records · Page 2Linked to original sources

arXiv2012

On the behaviour of random K-SAT on trees

We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over all realizations, for a fixed assignment of the surface variables. We find that different moments pick out different 'critical' values of d, below which they diverge as the total number of variables on the tree goes to infinity and above which they decay. We show that K-SAT on the random graph also behaves similarly. We also calculate exactly the fraction of instances that have solutions for all K. On the tree, this quantity decays to 0 (as the number of variables increases) for any d>1. However the recursion relations for this quantity have a non-trivial fixed-point solution which indicates the existence of a different transition in the interior of an infinite rooted tree.

cond-mat.stat-mech↗

arXiv2011

Non-equilibrium phase transitions in biomolecular signal transduction

We study a mechanism for reliable switching in biomolecular signal-transduction cascades. Steady bistable states are created by system-size cooperative effects in populations of proteins, in spite of the fact that the phosphorylation-state transitions of any molecule, by means of which the switch is implemented, are highly stochastic. The emergence of switching is a nonequilibrium phase transition in an energetically driven, dissipative system described by a master equation. We use operator and functional integral methods from reaction-diffusion theory to solve for the phase structure, noise spectrum, and escape trajectories and first-passage times of a class of minimal models of switches, showing how all critical properties for switch behavior can be computed within a unified framework.

q-bio.SC↗

arXiv2010

The Accuracy of Tree-based Counting in Dynamic Networks

Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn, however, node joins and failures can have complex global effects on the tree overlays, making analysis surprisingly subtle. To our knowledge, few prior analytic results for performance estimation of tree based protocols under churn are currently known. We study a simple Bellman-Ford-like protocol which performs network size estimation over a tree-shaped overlay. A continuous time Markov model is constructed which allows key protocol characteristics to be estimated, including the expected number of nodes at a given (perceived) distance to the root and, for each such node, the expected (perceived) size of the subnetwork rooted at that node. We validate the model by simulation, using a range of network sizes, node degrees, and churn-to-protocol rates, with convincing results.

cs.DC↗

arXiv2007

Circumspect descent prevails in solving random constraint satisfaction problems

We study the performance of stochastic local search algorithms for random instances of the $K$-satisfiability ($K$-SAT) problem. We introduce a new stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a problem instance by {\em never going upwards} in energy. ChainSAT is a \emph{focused} algorithm in the sense that it considers only variables occurring in unsatisfied clauses. We show by extensive numerical investigations that ChainSAT and other focused algorithms solve large $K$-SAT instances almost surely in linear time, up to high clause-to-variable ratios $α$; for example, for K=4 we observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space. The performance of ChainSAT is a surprise given that by design the algorithm gets trapped into the first local energy minimum it encounters, yet no such minima are encountered. We also study the geometry of the solution space as accessed by stochastic local search algorithms.

cs.DS↗

arXiv2007

Comparing Maintenance Strategies for Overlays

In this paper, we present an analytical tool for understanding the performance of structured overlay networks under churn based on the master-equation approach of physics. We motivate and derive an equation for the average number of hops taken by lookups during churn, for the Chord network. We analyse this equation in detail to understand the behaviour with and without churn. We then use this understanding to predict how lookups will scale for varying peer population as well as varying the sizes of the routing tables. We then consider a change in the maintenance algorithm of the overlay, from periodic stabilisation to a reactive one which corrects fingers only when a change is detected. We generalise our earlier analysis to underdstand how the reactive strategy compares with the periodic one.

cs.NI↗

arXiv2007

The stochastic behavior of a molecular switching circuit with feedback

Background: Using a statistical physics approach, we study the stochastic switching behavior of a model circuit of multisite phosphorylation and dephosphorylation with feedback. The circuit consists of a kinase and phosphatase acting on multiple sites of a substrate that, contingent on its modification state, catalyzes its own phosphorylation and, in a symmetric scenario, dephosphorylation. The symmetric case is viewed as a cartoon of conflicting feedback that could result from antagonistic pathways impinging on the state of a shared component. Results: Multisite phosphorylation is sufficient for bistable behavior under feedback even when catalysis is linear in substrate concentration, which is the case we consider. We compute the phase diagram, fluctuation spectrum and large-deviation properties related to switch memory within a statistical mechanics framework. Bistability occurs as either a first-order or second-order non-equilibrium phase transition, depending on the network symmetries and the ratio of phosphatase to kinase numbers. In the second-order case, the circuit never leaves the bistable regime upon increasing the number of substrate molecules at constant kinase to phosphatase ratio. Conclusions: The number of substrate molecules is a key parameter controlling both the onset of the bistable regime, fluctuation intensity, and the residence time in a switched state. The relevance of the concept of memory depends on the degree of switch symmetry, as memory presupposes information to be remembered, which is highest for equal residence times in the switched states. Reviewers: This article was reviewed by Artem Novozhilov (nominated by Eugene Koonin), Sergei Maslov, and Ned Wingreen.

q-bio.MN↗

arXiv2007

An Analytical Study of a Structured Overlay in the presence of Dynamic Membership

In this paper we present an analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a fluid model approach to describe steady-state or transient phenomena, and apply it to the Chord system. For any rate of churn and stabilization rates, and any system size, we accurately account for the functional form of the probability of network disconnection as well as the fraction of failed or incorrect successor and finger pointers. We show how we can use these quantities to predict both the performance and consistency of lookups under churn. All theoretical predictions match simulation results. The analysis includes both features that are generic to structured overlays deploying a ring as well as Chord-specific details, and opens the door to a systematic comparative analysis of, at least, ring-based structured overlay systems under churn.

cs.NI↗

arXiv2007

Clustering of solutions in hard satisfiability problems

We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarity between different solutions found on the same problem instance we show that the solution space is shrinking as a function of alpha. We consider chains of satisfiability problems, where clauses are added sequentially. In each such chain, the overlap distribution is first smooth, and then develops a tiered structure, indicating that the solutions are found in well separated clusters. On chains of not too large instances, all solutions are eventually observed to be in only one small cluster before vanishing. This condensation transition point is estimated to be alpha_c = 4.26. The transition approximately obeys finite-size scaling with an apparent critical exponent of about 1.7. We compare the solutions found by a local heuristic, ASAT, and the Survey Propagation algorithm up to alpha_c.

cond-mat.stat-mech↗

arXiv2005

A Statistical Theory of Chord under Churn

Most earlier studies of Distributed Hash Tables (DHTs) under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we present a complete analytical study of churn using a master-equation-based approach, used traditionally in non-equilibrium statistical mechanics to describe steady-state or transient phenomena. Simulations are used to verify all theoretical predictions. We demonstrate the application of our methodology to the Chord system. For any rate of churn and stabilization rates, and any system size, we accurately predict the fraction of failed or incorrect successor and finger pointers and show how we can use these quantities to predict the performance and consistency of lookups under churn. We also discuss briefly how churn may actually be of different 'types' and the implications this will have for the functioning of DHTs in general.

cs.NI↗

arXiv2003

Persistence properties of a system of coagulating and annihilating random walkers

We study a d-dimensional system of diffusing particles that on contact either annihilate with probability 1/(q-1) or coagulate with probability (q-2)/(q-1). In 1-dimension, the system models the zero temperature Glauber dynamics of domain walls in the q-state Potts model. We calculate P(m,t), the probability that a randomly chosen lattice site contains a particle whose ancestors have undergone exactly (m-1) coagulations. Using perturbative renormalization group analysis for d < 2, we show that, if the number of coagulations m is much less than the typical number M(t), then P(m,t) ~ m^(z/d) t^(-theta), with theta=d Q + Q(Q-1/2) epsilon + O(epsilon^2), z=(2Q-1) epsilon + (2 Q-1) (Q-1)(1/2+A Q) epsilon^2 +O(epsilon^3), where Q=(q-1)/q, epsilon =2-d and A =-0.006. M(t) is shown to scale as t^(d/2-delta), where delta = d (1 -Q)+(Q-1)(Q-1/2) epsilon+ O(epsilon^2). In two dimensions, we show that P(m,t) ~ ln(t)^(Q(3-2Q)) ln(m)^((2Q-1)^2) t^(-2Q) for m << t^(2 Q-1). The 1-dimensional results corresponding to epsilon=1 are compared with results from Monte Carlo simulations.

cond-mat.stat-mech↗

arXiv2002

Statistical theory of the continuous double auction

Most modern financial markets use a continuous double auction mechanism to store and match orders and facilitate trading. In this paper we develop a microscopic dynamical statistical model for the continuous double auction under the assumption of IID random order flow, and analyze it using simulation, dimensional analysis, and theoretical tools based on mean field approximations. The model makes testable predictions for basic properties of markets, such as price volatility, the depth of stored supply and demand vs. price, the bid-ask spread, the price impact function, and the time and probability of filling orders. These predictions are based on properties of order flow and the limit order book, such as share volume of market and limit orders, cancellations, typical order size, and tick size. Because these quantities can all be measured directly there are no free parameters. We show that the order size, which can be cast as a nondimensional granularity parameter, is in most cases a more significant determinant of market behavior than tick size. We also provide an explanation for the observed highly concave nature of the price impact function. On a broader level, this work suggests how stochastic models based on zero-intelligence agents may be useful to probe the structure of market institutions. Like the model of perfect rationality, a stochastic-zero intelligence model can be used to make strong predictions based on a compact set of assumptions, even if these assumptions are not fully believable.

cond-mat.stat-mech↗

arXiv2002

Shearing of loose granular materials: A statistical mesoscopic model

A two-dimensional lattice model for the formation and evolution of shear bands in granular media is proposed. Each lattice site is assigned a random variable which reflects the local density. At every time step, the strain is localized along a single shear-band which is a spanning path on the lattice chosen through an extremum condition. The dynamics consists of randomly changing the `density' of the sites only along the shear band, and then repeating the procedure of locating the extremal path and changing it. Starting from an initially uncorrelated density field, it is found that this dynamics leads to a slow compaction along with a non-trivial patterning of the system, with high density regions forming which shelter long-lived low-density valleys. Further, as a result of these large density fluctuations, the shear band which was initially equally likely to be found anywhere on the lattice, gets progressively trapped for longer and longer periods of time. This state is however meta-stable, and the system continues to evolve slowly in a manner reminiscent of glassy dynamics. Several quantities have been studied numerically which support this picture and elucidate the unusual system-size effects at play.

cond-mat.stat-mech↗

arXiv2002

Slow relaxation due to optimization and restructuring: Solution on a hierarchical lattice

Motivated by the large strain shear of loose granular materials we introduced a model which consists of consecutive optimization and restructuring steps leading to a self organization of a density field. The extensive connections to other models of statistical phyics are discussed. We investigate our model on a hierarchical lattice which allows an exact asymptotic renormalization treatment. A surprisingly close analogy is observed between the simulation results on the regular and the hierarchical lattices. The dynamics is characterized by the breakdown of ergodicity, by unusual system size effects in the development of the average density as well as by the age distribution, the latter showing multifractal properties.

cond-mat.stat-mech↗

arXiv2002

Kang-Redner Anomaly in Cluster-Cluster Aggregation

The large time, small mass, asymptotic behavior of the average mass distribution $\pb$ is studied in a $d$-dimensional system of diffusing aggregating particles for $1\leq d \leq 2$. By means of both a renormalization group computation as well as a direct re-summation of leading terms in the small reaction-rate expansion of the average mass distribution, it is shown that $\pb \sim \frac{1}{t^d} (\frac{m^{1/d}}{\sqrt{t}})^{e_{KR}}$ for $m \ll t^{d/2}$, where $e_{KR}=ε+O(ε^2)$ and $ε=2-d$. In two dimensions, it is shown that $\pb \sim \frac{\ln(m) \ln(t)}{t^2}$ for $ m \ll t/ \ln(t)$. Numerical simulations in two dimensions supporting the analytical results are also presented.

cond-mat.stat-mech↗

arXiv2002

Effect of spatial bias on the nonequilibrium phase transition in a system of coagulating and fragmenting particles

We examine the effect of spatial bias on a nonequilibrium system in which masses on a lattice evolve through the elementary moves of diffusion, coagulation and fragmentation. When there is no preferred directionality in the motion of the masses, the model is known to exhibit a nonequilibrium phase transition between two different types of steady states, in all dimensions. We show analytically that introducing a preferred direction in the motion of the masses inhibits the occurrence of the phase transition in one dimension, in the thermodynamic limit. A finite size system, however, continues to show a signature of the original transition, and we characterize the finite size scaling implications of this. Our analysis is supported by numerical simulations. In two dimensions, bias is shown to be irrelevant.

cond-mat.stat-mech↗

arXiv2000

Self-Quenched Dynamics

We introduce a model for the slow relaxation of an energy landscape caused by its local interaction with a random walker whose motion is dictated by the landscape itself. By choosing relevant measures of time and potential this self-quenched dynamics can be mapped on to the ``True'' Self-Avoiding Walk model. This correspondence reveals that the average distance of the walker at time $t$ from its starting point is $R(t)\sim\log(t)^γ$, where $γ=2/3$ for one dimension and 1/2 for all higher dimensions. Furthermore, the evolution of the landscape is similar to that in growth models with extremal dynamics.

cond-mat.stat-mech↗

arXiv2000

Self-organization, Localization of Shear Bands and Aging in Loose Granular Materials

We introduce a mesoscopic model for the formation and evolution of shear bands in loose granular media. Numerical simulations reveal that the system undergoes a non-trivial self-organization process which is governed by the motion of the shear band and the consequent restructuring of the material along it. High density regions are built up, progressively confining the shear bands in localized regions. This results in an inhomogeneous aging of the material with a very slow increase in the mean density, displaying an unusual glassy like system-size dependence.

cond-mat.stat-mech↗

arXiv2000

Phase Transition in the Takayasu Model with Desorption

We study a lattice model where particles carrying different masses diffuse, coalesce upon contact, and also unit masses adsorb to a site with rate $q$ or desorb from a site with nonzero mass with rate $p$. In the limit $p=0$ (without desorption), our model reduces to the well studied Takayasu model where the steady-state single site mass distribution has a power law tail $P(m)\sim m^{-τ}$ for large mass. We show that varying the desorption rate $p$ induces a nonequilibrium phase transition in all dimensions. For fixed $q$, there is a critical $p_c(q)$ such that if $p p_c(q)$, $P(m)\sim \exp(-m/m^*)$ for large $m$. The model is studied analytically within a mean field theory and numerically in one dimension.

cond-mat.stat-mech↗