Searcharxiv⌕ Search

arXiv subjects

Sumit Mukherjee

Publications and source records attributed to Sumit Mukherjee.

81 records · Page 5Linked to original sources

Universality of the mean-field for the Potts model

We consider the Potts model with $q$ colors on a sequence of weighted graphs with adjacency matrices $A_n$, allowing for both positive and negative weights. Under a mild regularity condition the mean-field prediction for the log partition function of the Potts model on a sequence of matrices $A_n$ is asymptotically correct, whenever $\text{tr}(A_n^2)=o(n)$. In particular, our results are applicable for the Ising and the Potts models on any sequence of graphs with average degree going to $+\infty$. Using this, we establish the universality of the limiting log partition function of the ferromagnetic Potts model for a sequence of asymptotically regular graphs, and that of the Ising model for bi-regular bipartite graphs in both ferromagnetic and anti-ferromagnetic domain. We also derive a large deviation principle for the empirical measure of the colors for the Potts model on asymptotically regular graphs.

math.PR↗

Estimation in exponential families on permutations

Asymptotics of the normalizing constant is computed for a class of one parameter exponential families on permutations which includes Mallows model with Spearmans's Footrule and Spearman's Rank Correlation Statistic. The MLE, and a computable approximation of the MLE are shown to be consistent. The pseudo-likelihood estimator of Besag is shown to be $\sqrt{n}$-consistent. An iterative algorithm (IPFP) is proved to converge to the limiting normalizing constant. The Mallows model with Kendall's Tau is also analyzed to demonstrate flexibility of the tools of this paper.

math.PR↗

Degree Sequence of Random Permutation Graphs

In this paper we study the degree sequence of the permutation graph $G_{π_n}$ associated with a sequence $π_n\in S_n$ of random permutations. Joint limiting distributions of the degrees are established using results from graph and permutation limit theories. In particular, for the uniform random permutation, the joint distribution of the degrees of the vertices labelled $\lceil nr_1 \rceil, \lceil nr_2 \rceil, \ldots, \lceil nr_s \rceil$ converges (after scaling by $n$) to independent random variables $D_1, D_2, \ldots, D_s$, where $D_i\sim \text{Unif}(r_i, 1-r_i)$, for $r_i\in [0,1]$ and $i\in \{1, 2, \ldots, s\}$. Moreover, the degree of the mid-vertex (the vertex labelled $n/2$) has a central limit theorem, and the minimum degree converges to a Rayleigh distribution after appropriate scalings. Finally, the limiting degree distribution of the permutation graph associated with a Mallows random permutation is determined, and interesting phase transitions are observed. Our results extend to other exponential measures on permutations.

math.PR↗

No zero-crossings for random polynomials and the heat equation

Consider random polynomial $\sum_{i=0}^na_ix^i$ of independent mean-zero normal coefficients $a_i$, whose variance is a regularly varying function (in $i$) of order $α$. We derive general criteria for continuity of persistence exponents for centered Gaussian processes, and use these to show that such polynomial has no roots in $[0,1]$ with probability $n^{-b_α+o(1)}$, and no roots in $(1,\infty)$ with probability $n^{-b_0+o(1)}$, hence for $n$ even, it has no real roots with probability $n^{-2b_α-2b_0+o(1)}$. Here, $b_α=0$ when $α\le-1$ and otherwise $b_α\in(0,\infty)$ is independent of the detailed regularly varying variance function and corresponds to persistence probabilities for an explicit stationary Gaussian process of smooth sample path. Further, making precise the solution $ϕ_d({\mathbf{x}},t)$ to the $d$-dimensional heat equation initiated by a Gaussian white noise $ϕ_d({\mathbf{x}},0)$, we confirm that the probability of $ϕ_d({\mathbf{x}},t)\neq0$ for all $t\in[1,T]$, is $T^{-b_α+o(1)}$, for $α=d/2-1$.

math.PR↗

Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with the same birthday?). It is shown that if the number of colors grows to infinity, the asymptotic distribution is either a Poisson mixture or a Normal depending solely on the limiting behavior of the ratio of the number of edges in the graph and the number of colors. This result holds for any graph sequence, deterministic or random. On the other hand, when the number of colors is fixed, a necessary and sufficient condition for asymptotic normality is determined. Finally, using some results from the emerging theory of dense graph limits, the asymptotic (non-normal) distribution is characterized for any converging sequence of dense graphs. The proofs are based on moment calculations which relate to the results of Erd\H os and Alon on extremal subgraph counts. As a consequence, a simpler proof of a result of Alon, estimating the number of isomorphic copies of a cycle of given length in graphs with a fixed number of edges, is presented.

math.PR↗

Phase transition in the two star Exponential Random Graph Model

This paper gives a way to simulate from the two star probability distribution on the space of simple graphs via auxiliary variables. Using this simulation scheme, the model is explored for various domains of the parameter values, and the phase transition boundaries are identified, and shown to be similar as that of the Curie-Weiss model of statistical physics. Concentration results are obtained for all the degrees, which further validate the phase transition predictions.

math.ST↗

Continuous Order Identification of PHWR Models Under Step-back for the Design of Hyper-damped Power Tracking Controller with Enhanced Reactor Safety

In this paper, discrete time higher integer order linear transfer function models have been identified first for a 500 MWe Pressurized Heavy Water Reactor (PHWR) which has highly nonlinear dynamical nature. Linear discrete time models of the nonlinear nuclear reactor have been identified around eight different operating points (power reduction or step-back conditions) with least square estimator (LSE) and its four variants. From the synthetic frequency domain data of these identified discrete time models, fractional order (FO) models with sampled continuous order distribution are identified for the nuclear reactor. This enables design of continuous order Proportional-Integral-Derivative (PID) like compensators in the complex w-plane for global power tracking at a wide range of operating conditions. Modeling of the PHWR is attempted with various levels of discrete commensurate-orders and the achievable accuracies are also elucidated along with the hidden issues, regarding modeling and controller design. Credible simulation studies are presented to show the effectiveness of the proposed reactor modeling and power level controller design. The controller pushes the reactor poles in higher Riemann sheets and thus makes the closed loop system hyper-damped which ensures safer reactor operation at varying dc-gain while making the power tracking temporal response slightly sluggish; but ensuring greater safety margin.

math.OC↗

Comparative Studies on Decentralized Multiloop PID Controller Design Using Evolutionary Algorithms

Decentralized PID controllers have been designed in this paper for simultaneous tracking of individual process variables in multivariable systems under step reference input. The controller design framework takes into account the minimization of a weighted sum of Integral of Time multiplied Squared Error (ITSE) and Integral of Squared Controller Output (ISCO) so as to balance the overall tracking errors for the process variables and required variation in the corresponding manipulated variables. Decentralized PID gains are tuned using three popular Evolutionary Algorithms (EAs) viz. Genetic Algorithm (GA), Evolutionary Strategy (ES) and Cultural Algorithm (CA). Credible simulation comparisons have been reported for four benchmark 2x2 multivariable processes.

eess.SY↗

Identification of Nonlinear Systems From the Knowledge Around Different Operating Conditions: A Feed-Forward Multi-Layer ANN Based Approach

The paper investigates nonlinear system identification using system output data at various linearized operating points. A feed-forward multi-layer Artificial Neural Network (ANN) based approach is used for this purpose and tested for two target applications i.e. nuclear reactor power level monitoring and an AC servo position control system. Various configurations of ANN using different activation functions, number of hidden layers and neurons in each layer are trained and tested to find out the best configuration. The training is carried out multiple times to check for consistency and the mean and standard deviation of the root mean square errors (RMSE) are reported for each configuration.

eess.SY↗