SearcharxivSearch

arXiv subjects

Sourangshu Ghosh

Publications and source records attributed to Sourangshu Ghosh.

14 recordsLinked to original sources

On Higher-Order Geometric Refinements of Classical Covariance Asymptotics: An Approach via Intrinsic and Extrinsic Information Geometry

Classical Fisher-information asymptotics describe the covariance of regular efficient estimators through the local quadratic approximation of the log-likelihood, and thus capture first-order geometry only. In curved models, including mixtures, curved exponential families, latent-variable models, and manifold-constrained parameter spaces, finite-sample behavior can deviate systematically from these predictions. We develop a coordinate-invariant, curvature-aware refinement by viewing a regular parametric family as a Riemannian manifold \((Θ,g)\) with Fisher--Rao metric, immersed in \(L^2(μ)\) through the square-root density map. Under suitable regularity and moment assumptions, we derive an \(n^{-2}\) correction to the leading \(n^{-1}I(θ)^{-1}\) covariance term for score-root, first-order efficient estimators. The correction is governed by a tensor \(P_{ij}\) that decomposes canonically into three parts, an intrinsic Ricci-type contraction of the Fisher--Rao curvature tensor, an extrinsic Gram-type contraction of the second fundamental form, and a Hellinger discrepancy tensor encoding higher-order probabilistic information not determined by immersion geometry alone. The extrinsic term is positive semidefinite, the full correction is invariant under smooth reparameterization, and it vanishes identically for full exponential families. We then extend the picture to singular models, where Fisher information degenerates. Using resolution of singularities under an additive normal crossing assumption, we describe the resolved metric, the role of the real log canonical threshold in learning rates and posterior mean-squared error, and a curvature-based covariance expansion on the resolved space that recovers the regular theory as a special case. This framework also suggests geometric diagnostics of weak identifiability and curvature-aware principles for regularization and optimization.

math.ST

A nested hierarchy of second order upper bounds on system failure probability

For a coherent, binary system made up of binary elements, the exact failure probability requires knowledge of statistical dependence of all orders among the minimal cut sets. Since dependence among the cut sets beyond the second order is generally difficult to obtain, second order bounds on system failure probability have practical value. The upper bound is conservative by definition and can be adopted in reliability based decision making. In this paper we propose a new hierarchy of m-level second order upper bounds, Bm : the well-known Kounias-Vanmarcke-Hunter-Ditlevsen (KVHD) bound - the current standard for upper bounds using second order joint probabilities - turns out to be the weakest member of this family (m = 1). We prove that Bm is non-increasing with level m in every ordering of the cut sets, and derive conditions under which Bm+1 is strictly less than Bm for any m and any ordering. We also derive conditions under which the optimal level m bound is strictly less than the optimal level m + 1 bound, and show that this improvement asymptotically achieves a probability of 1 as long as the second order joint probabilities are only constrained by the pair of corresponding first order probabilities. Numerical examples show that our second order upper bounds can yield tighter values than previously achieved and in every case exhibit considerable less scatter across the entire n! orderings of the cut sets compared to KVHD bounds. Our results therefore may lead to more efficient identification of the optimal upper bound when coupled with existing linear programming and tree search based approaches.

math.PR

Equivalence of nonequilibrium ensembles: Two-dimensional turbulence with a dual cascade

We examine the conjecture of equivalence of nonequilibrium ensembles for turbulent flows in two-dimensions (2D) in a dual-cascade setup. We construct a formally time-reversible Navier-Stokes equations in 2D by imposing global constraints of energy and enstrophy conservation. A comparative study of the statistical properties of its solutions with those obtained from the standard Navier-Stokes equations clearly show that a formally time-reversible system is able to reproduce the features of a 2D turbulent flow. Statistical quantities based on one- and two-point measurements show an excellent agreement between the two systems, for the inverse- and direct cascade regions. Moreover, we find that the conjecture holds very well for 2D turbulent flows with both conserved energy and enstrophy at finite Reynolds number, which goes beyond the original conjecture for three-dimensional turbulence in the limit of infinite Reynolds number.

physics.flu-dyn

Calculating Cost Distributions of a Multiservice Loss System

Congestion pricing has received lots of attention in scientific discussion. Congestion pricing means that the operator increases prices at the time of congestion and the traffic demand are expected to decrease. In a certain sense, shadow prices are an optimal way of congestion pricing: users are charged shadow prices, i.e., the expectations of future losses because of blocked connections. The shadow prices can be calculated exactly from the Howard equation, but this method is difficult. The paper presents simple approximations to the solution of the Howard equation and a way to derive more exact approximations. If users do not react by lowering their demand, they will receive higher bills to pay. Many users do not react to increased prices but would want to know how the congestion pricing mechanism affects the bills. The distribution of the price of a connection follows from knowing the shadow prices and the probability of a congestion state. There is another interesting distribution. The network produces profit to the operator, or equivalently, blocked connections produce a cost to the operator. The average cost rate can be calculated from the Howard equation, but the costs have some distribution. The distribution gives the risk that the actual costs exceed the average costs, and the operator should include this risk in the prices. The main result of this paper shows how to calculate the distribution of the costs in the future for congestion pricing by shadow prices and for congestion pricing with a more simple pricing scheme that produces the same average costs.

math.OC

A Theorem of Congruent Primes

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter than existing proofs, but the method may be useful in other contexts. The proof of Theorem 1 tracks the set of solutions and this set branches as a binary tree. Conditions set to the theorem restricts the branches so that only one branch is left. Following this branch gives either a solution or a contradiction. In Theorem 1 it leads to a contradiction. The interest is in the proof method, which maybe can be generalized to non-primes.

math.NT

Rotating Binaries

This paper investigates the behaviour of rotating binaries. A rotation by $r$ digits to the left of a binary number $B$ exhibits in particular cases the divisibility $l\mid N_1(B)\cdot r+1$, where $l$ is the bit-length of $B$ and $N_1(B)$ is the Hamming weight of $B$, that is the number of ones in $B$. The integer $r$ is called the left-rotational distance. We investigate the connection between this rotational distance, the length and the Hamming weight of binary numbers. Moreover we follow the question under which circumstances the above mentioned divisibility is true. We have found out and will demonstrate that this divisibility occurs for $kn+c$ cycles.

math.NT

The Farey Sequence and the Mertens Function

Franel and Landau derived an arithmetic statement involving the Farey sequence that is equivalent to the Riemann hypothesis. Since there is a relationship between the Mertens function and the Riemann hypothesis, there should be a relationship between the Mertens function and the Farey sequence. Functions of subsets of the fractions in Farey sequences that are analogous to the Mertens function are introduced. Mikolas proved that the sum of certain Mertens function values is 1. Results analogous to Mikolas theorem are the defining property of these functions. A relationship between the Farey sequence and the Riemann hypothesis other than the Franel-Landau theorem is postulated. This conjecture involves a theorem of Mertens and the second Chebyshev function.

math.NT

Collatz Cycles and $3n+c$ Cycles

Halbeisen and Hungerbuhler determined optimal bounds for the length of rational Collatz cycles. Their methods are extended to $3n+c$ cycles. Another sequence having properties similar to those of Riemann zeta function zeros is introduced.

math.GM

Bounds of the Mertens Function

In this paper, we derive new properties of the Mertens function and discuss a likely upper bound of the absolute value of the Mertens function $\sqrt{\log{x!}}>|M(x)|$ when $x>1$. Using this likely bound we show that we have a sufficient condition to prove the Riemann Hypothesis.

math.GM

Sequences and Polynomial Congruence

In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their connection to polynomial congruence and then find out new relations between particular recurrence relation and the congruence of the sequences.

math.GM

The Basel Problem

Because of its relation to the distribution of prime numbers, the Riemann zeta function ζ (s) is one of the most important functions in mathematics. The zeta function is defined by the following formula for any complex number s with the real component greater than 1.Taking s=2, we see that ζ(2) is equal to the sum of the squares of reciprocals of all positive integers. This leads to the famous problem by Basel in mathematical analysis with important relevance to number theory, solved by Leonhard Euler in 1734. In this paper, we discuss some of the notable proofs given by mathematicians to the basal problem. Most of the theorems are very well known whereas some can be found as proofs of problems present in textbooks.We also give one new proof using the theory of calculus of residues.

math.GM

Lattices and the Geometry of Numbers

In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to study the properties of algebraic numbers. It has application on various other fields of mathematics especially the study of Diophantine equations, analysis of functional analysis etc. This paper will review all the major developments that have occurred in the field of geometry of numbers. In this paper we shall first give a broad overview of the concept of lattice and then discuss about the geometrical properties it has and its applications.

math.HO