Scholar iON
Academic Synthesis
The collection of scholarly papers spans diverse topics within the mathematical domain, addressing key issues in pedigree inference, entropy, phase transitions, and portfolio selection. Kirkpatrick's work highlights the challenges of non-identifiability in pedigree likelihoods and proposes a Bayesian solution to distinguish pedigrees, which is particularly significant for health and forensic applications. Ruskai's commentary on entropy contributes to refining the understanding of entropy subadditivity by leveraging the monotonicity of relative entropy. Franzosi et al.'s exploration of topology in phase transitions underscores the essential role of topological considerations in understanding physical phenomena. Aghapour et al.'s study on dynamic portfolio selection introduces a model-free approach using diffusion models, offering innovative methods for financial optimization that outperform traditional models. Collectively, these works emphasize the broad applicability of mathematical concepts to solve complex problems across various fields, from biology and physics to finance.
Some methods aim to correct or test for relationships or to reconstruct the pedigree, or family tree. We show that these methods cannot resolve ties for correct relationships due to identifiability of the pedigree likelihood which is the probability of inheriting the data under the pedigree model. This means that no likelihood-based method can produce a correct pedigree inference with high probability. This lack of reliability is critical both for health and forensics applications.
In this paper we present the first discussion of multiple typed individuals in non-isomorphic pedigrees, $\mathcal{P}$ and $\mathcal{Q}$, where the likelihoods are non-identifiable, $Pr[G~|~\mathcal{P},ΞΈ] = Pr[G~|~\mathcal{Q},ΞΈ]$, for all input data $G$ and all recombination rate parameters $ΞΈ$. While there were previously known non-identifiable pairs, we give an example having data for multiple individuals.
Additionally, deeper understanding of the general discrete structures driving these non-identifiability examples has been provided, as well as results to guide algorithms that wish to examine only identifiable pedigrees. This paper introduces a general criteria for establishing whether a pair of pedigrees is non-identifiable and two easy-to-compute criteria guaranteeing identifiability. Finally, we suggest a method for dealing with non-identifiable likelihoods: use Bayes rule to obtain the posterior from the likelihood and prior. We propose a prior guaranteeing that the posterior distinguishes all pairs of pedigrees.
Shortened version published as: B. Kirkpatrick. Non-identifiable pedigrees and a Bayesian solution. Int. Symp. on Bioinformatics Res. and Appl. (ISBRA), 7292:139-152 2012.
We show how recent results of Lieb and Seiringer [math-ph/0412009; Phys. Rev. A 71, 062329 (2005)] can be obtained from repeated use of the monotonicity of relative entropy under partial traces, and explain how to use their approach to obtain tighter bounds in many situations.
An emended and improved version of the present paper has been archived in math-ph/0505057, and a preliminary account of its content has been published in Phys.Rev.Lett. 92, 60601, (2004). Moreover, in order to prove the relevance of topology for phase transition phenomena in a broad domain of physically interesting cases, we have proved another theorem which is reported in math-ph/0505058 and which is crucially based on the result of the paper archived in math-ph/0505057.
In this paper, we tackle the dynamic mean-variance portfolio selection problem in a {\it model-free} manner, based on (generative) diffusion models. We propose using data sampled from the real model $\mathbb P$ (which is unknown) with limited size to train a generative model $\mathbb Q$ (from which we can easily and adequately sample). With adaptive training and sampling methods that are tailor-made for time series data, we obtain quantification bounds between $\mathbb P$ and $\mathbb Q$ in terms of the adapted Wasserstein metric $\mathcal A W_2$. Importantly, the proposed adapted sampling method also facilitates {\it conditional sampling}. In the second part of this paper, we provide the stability of the mean-variance portfolio optimization problems in $\mathcal A W _2$. Then, combined with the error bounds and the stability result, we propose a policy gradient algorithm based on the generative environment, in which our innovative adapted sampling method provides approximate scenario generators. We illustrate the performance of our algorithm on both simulated and real data. For real data, the algorithm based on the generative environment produces portfolios that beat several important baselines, including the Markowitz portfolio, the equal weight (naive) portfolio, and S\&P 500.
In this lecture I discuss some aspects of MKM, Mathematical Knowledge Management, with particuar emphasis on information storage and information retrieval.
We comment on the validity of Noether's theorem and on the conclusions of [J. Math. Phys. 61 (2020), no. 11, 113502].
We define a general mathematical framework for studying post-translational
modification processes under the assumption of mass action kinetics.
This work aims at showing the relevance and the applications possibilities of the Fibonacci sequence, and also its q-deformed or quantum extension, in the study of the genetic code(s). First, after the presentation of a new formula, an indexed double Fibonacci sequence, comprising the first six Fibonacci numbers, is shown to describe the 20 amino acids multiplets and their degeneracy as well as a characteristic pattern for the 61 meaningful codons. Next, the twenty amino acids, classified according to their increasing atom-number (carbon, nitrogen, oxygen and sulfur), exhibit several Fibonacci sequence patterns. Several mathematical relations are given, describing various atom-number patterns. Finally, a q-Fibonacci simple phenomenological model, with q a real deformation parameter, is used to describe, in a unified way, not only the standard genetic code, when q=1, but also all known slight variations of this latter, when q~1, as well as the case of the 21st amino acid (Selenocysteine) and the 22nd one (Pyrrolysine), also when q~1. As a by-product of this elementary model, we also show that, in the limit q=0, the number of amino acids reaches the value 6, in good agreement with old and still persistent claims stating that life, in its early development, could have used only a small number of amino acids.
In this addendum we strengthen the results of math-ph/0002010 in the case of polynomial phases. We prove that Cesaro means of the pair correlation functions of certain integrable quantum maps on the 2-sphere at level N tend almost always to the Poisson (uniform limit). The quantum maps are exponentials of Hamiltonians which have the form a p(I) + b I, where I is the action, where p is a polynomial and where a,b are two real numbers. We prove that for any such family and for almost all a,b, the pair correlation tends to Poisson on average in N. The results involve Weyl estimates on exponential sums and new metric results on continued fractions. They were motivated by a comparison of the results of math-ph/0002010 with some independent results on pair correlation of fractional parts of polynomials by Rudnick-Sarnak.
The mathematical model describing the stationary natural pH-gradient arising under the action of an electric field in an aqueous solution of ampholytes (amino acids) is constructed and investigated. The model is a part of a more general model of the isoelectrofocusing process. Investigation is based on the approximation of a weak solution by the piecewise continuous non-smooth functions. The method can be used for solving classes of problems for ODEs with a small parameter at higher derivatives and the turning points.