The Index Distribution of Gaussian Random Matrices

We compute analytically, for large N, the probability distribution of the number of positive eigenvalues (the index N_{+}) of a random NxN matrix belonging to Gaussian orthogonal (\beta=1), unitary (\beta=2) or symplectic (\beta=4) ensembles. The distribution of the fraction of positive eigenvalues c=N_{+}/N scales, for large N, as Prob(c,N)\simeq\exp[-\beta N^2 \Phi(c)] where the rate function \Phi(c), symmetric around c=1/2 and universal (independent of $\beta$), is calculated exactly. The distribution has non-Gaussian tails, but even near its peak at c=1/2 it is not strictly Gaussian due to an unusual logarithmic singularity in the rate function.Comment: 4 pages Revtex, 4 .eps figures include

The statistical mechanics of combinatorial optimization problems with site disorder

We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite temperature traveling salesman problem on several different domains and various problems in one dimension such as the so called descent problem. We first motivate our method by analyzing these problems using the annealed approximation, then the limit of a large number of points we develop a formalism to carry out the quenched calculation. This formalism does not require the replica method and its predictions are found to agree with Monte Carlo simulations. In addition our method reproduces an exact mathematical result for the Maximum traveling salesman problem in two dimensions and suggests its generalization to higher dimensions. The general approach may provide an alternative method to study certain systems with quenched disorder.Comment: 21 pages RevTex, 8 figure

Statistics of the Number of Zero Crossings : from Random Polynomials to Diffusion Equation

We consider a class of real random polynomials, indexed by an integer d, of large degree n and focus on the number of real roots of such random polynomials. The probability that such polynomials have no real root in the interval [0,1] decays as a power law n^{-\theta(d)} where \theta(d)>0 is the exponent associated to the decay of the persistence probability for the diffusion equation with random initial conditions in space dimension d. For n even, the probability that such polynomials have no root on the full real axis decays as n^{-2(\theta(d) + \theta(2))}. For d=1, this connection allows for a physical realization of real random polynomials. We further show that the probability that such polynomials have exactly k real roots in [0,1] has an unusual scaling form given by n^{-\tilde \phi(k/\log n)} where \tilde \phi(x) is a universal large deviation function.Comment: 4 pages, 3 figures. Minor changes. Accepted version in Phys. Rev. Let

Exact Asymptotic Results for a Model of Sequence Alignment

Finding analytically the statistics of the longest common subsequence (LCS) of a pair of random sequences drawn from c alphabets is a challenging problem in computational evolutionary biology. We present exact asymptotic results for the distribution of the LCS in a simpler, yet nontrivial, variant of the original model called the Bernoulli matching (BM) model which reduces to the original model in the large c limit. We show that in the BM model, for all c, the distribution of the asymptotic length of the LCS, suitably scaled, is identical to the Tracy-Widom distribution of the largest eigenvalue of a random matrix whose entries are drawn from a Gaussian unitary ensemble. In particular, in the large c limit, this provides an exact expression for the asymptotic length distribution in the original LCS problem.Comment: 4 pages Revtex, 2 .eps figures include

Unusual heavy landing of Decapterus spp. at Visakhapatnam

The Indian scad, Decapterus russelli locally known as pillodugu forms an important seasonal fishing in the small mechanical trawlers of Visakhapatnam contributing about 0.6 to 8.2% of the total catch during the period from 1998 to 2002

Bethe Ansatz in the Bernoulli Matching Model of Random Sequence Alignment

For the Bernoulli Matching model of sequence alignment problem we apply the Bethe ansatz technique via an exact mapping to the 5--vertex model on a square lattice. Considering the terrace--like representation of the sequence alignment problem, we reproduce by the Bethe ansatz the results for the averaged length of the Longest Common Subsequence in Bernoulli approximation. In addition, we compute the average number of nucleation centers of the terraces.Comment: 14 pages, 5 figures (some points are clarified

The Local Time Distribution of a Particle Diffusing on a Graph

We study the local time distribution of a Brownian particle diffusing along the links on a graph. In particular, we derive an analytic expression of its Laplace transform in terms of the Green's function on the graph. We show that the asymptotic behavior of this distribution has non-Gaussian tails characterized by a nontrivial large deviation function.Comment: 8 pages, two figures (included

On the strike bt seafood exporters at Visakhapatnam fisheries harbour in Andhra Pradesh

Visakhapatnam Fisheries Harbour Is one of the major fisheries harbours in India. Every day about 275 to 300 small mechanised boats, 150 to 175 Sona boats and 150 to 200 Mini and Mexican trawlers go out for fishing from this harbour. About 300 to 350 fish traders including local fisherwomen depend completely on this fish business for their livelihood. Each trader gets atleast Rs. 200/- per day

Exact Solution of a Drop-push Model for Percolation

Motivated by a computer science algorithm known as `linear probing with hashing' we study a new type of percolation model whose basic features include a sequential `dropping' of particles on a substrate followed by their transport via a `pushing' mechanism. Our exact solution in one dimension shows that, unlike the ordinary random percolation model, the drop-push model has nontrivial spatial correlations generated by the dynamics itself. The critical exponents in the drop-push model are also different from that of the ordinary percolation. The relevance of our results to computer science is pointed out.Comment: 4 pages revtex, 2 eps figure