Dynamic Infinity Mapping Framework (DIMF): An Adaptive Oncology Dosing Reinforcement Learning Approach Author- Shrishti Rastogi Abstract Dynamic Infinity Mapping Framework (DIMF) is a new computational paradigm to manage the stochastic evolution of subpopulations of cancer cells under therapeutic pressure. DIMF combines Markov Decision Processes (MDP), Dynamic Graph Neural Networks (GNNs), and Reinforcement Learning (RL) to offer a powerful framework for optimising the dosage of multiple drugs adaptively. This report outlines the mathematical modelling of state transitions, algorithmic implementation of the RL agent and an empirical calibration using quantitative interaction and toxicity data from the large clinical trials. Our framework shows better ability to cross the balance line between therapeutic effect and total toxicity than static modelling methods. Introduction New challenges for modern oncology are the emergence of acquired resistan...
Understanding Delta Function Approximations: Lorentzian Delta Sequence (Cauchy Kernel)
- Get link
- X
- Other Apps
Delta-Convergent Sequences — Refined Blog with SageMath Symbolics, Physics Insights, and Cleaner Code
The Dirac delta function isn’t a “normal” function — it’s an idealization used to represent a point source. It's infinitely narrow, infinitely tall, and yet integrates to 1. We approximate it using delta-convergent sequences: real functions depending on a parameter that becomes increasingly peaked at zero as the parameter vanishes.
This post explores the three most common delta-approximating sequences using SageMath, including plots, integration checks, and real-world meaning.
Why Study These Approximations?
Delta functions are central in many fields:
- Signal Processing: Ideal impulse, filter response
- Physics: Point charges/masses, Green's functions
- Spectral Theory: Lorentzian profiles in resonance
- Diffusion Models: Gaussians arise from the heat equation
- Numerics: Regularizing singular integrals
Each kernel has a story to tell.
Lorentzian Delta Sequence
Formula \[ f_{\epsilon}(x) = \frac{1}{\pi}. \frac{\epsilon}{x^2+ {\epsilon}^2} \]
- Sharp peak at 𝑥=0
- Always integrates to 1
- Smooth and rational
# Check the Function Definition
var('x epsilon')
f_lorentz(x, epsilon) = (1/pi) * (epsilon / (x^2 + epsilon^2))
f_lorentz(x, epsilon)
# Check Symbolic Integration
var('xi')
assume(epsilon > 0) # Ensure SageMath understands epsilon is positive
integral(f_lorentz(xi, epsilon), xi, -oo, oo).simplify_full()
#Check Limit at x → 0
limit(f_lorentz(x, epsilon), epsilon=0)
# Integral Test (Distributional Behavior)
var('a b')
assume(a < 0, b > 0) # Ensure a < 0 < b to match delta behavior
integral(f_lorentz(xi, epsilon), xi, a, b).simplify_full()
# Numerical Evaluation
# To see how the integral converges to 1 as ( \epsilon \to 0 ), run:
import numpy as np
import matplotlib.pyplot as plt
import sage.all as sage
def lorentzian_integral(epsilon, a=-1, b=1):
return (np.arctan(b/epsilon) - np.arctan(a/epsilon)) / np.pi
# Test for different epsilon values
epsilons = np.logspace(-3, 0, 50) # Log-spaced values from 0.001 to 1
integral_values = [lorentzian_integral(eps) for eps in epsilons]
# Plotting
plt.figure(figsize=(8, 5))
plt.plot(epsilons, integral_values, marker='o', linestyle='-', color='blue')
plt.axhline(y=1, color='r', linestyle='--', label="Expected Limit (1)")
plt.xscale("log")
plt.xlabel(r"$\epsilon$")
plt.ylabel(r"Integral Value")
plt.title("Numerical Verification: Lorentzian Integral Convergence")
plt.legend()
plt.grid(True)
plt.show()
# Lorentzian delta approximation
var('x epsilon xi')
assume(epsilon > 0) # Ensure epsilon is positive for proper symbolic handling
f_lorentz(x, epsilon) = (1/pi) * (epsilon / (x^2 + epsilon^2))
# Symbolic normalization check
integral(f_lorentz(xi, epsilon), xi, -oo, oo).simplify_full()
# Limit at x = 0 to verify δ-behavior
limit(f_lorentz(x, epsilon), epsilon=0)
# Plot Lorentzian for different ε
p1 = plot(f_lorentz(x, 0.5), (x, -5, 5), color='red', legend_label='ε = 0.5') + \
plot(f_lorentz(x, 0.2), (x, -5, 5), color='blue', legend_label='ε = 0.2') + \
plot(f_lorentz(x, 0.05), (x, -5, 5), color='green', legend_label='ε = 0.05')
p1.show(title='Lorentzian Approximation to δ(x)', ymin=0, ymax=3)
# Numerical Limits Instead of Symbolic
epsilon_vals = [0.1, 0.01, 0.001, 0.0001]
[f_lorentz(0, eps).n() for eps in epsilon_vals]
# Check Symbolic Integration
# Confirm normalization:
var('xi')
assume(epsilon > 0) # Ensure SageMath understands epsilon is positive
integral(f_lorentz(xi, epsilon), xi, -oo, oo).simplify_full()
# First & Second Derivative Computation
f_lorentz_prime(x, epsilon) = diff(f_lorentz(x, epsilon), x)
f_lorentz_double_prime(x, epsilon) = diff(f_lorentz_prime(x, epsilon), x)
f_lorentz_prime(x, epsilon), f_lorentz_double_prime(x, epsilon)
#Plot First & Second Derivative
p1 = plot(f_lorentz_prime(x, 0.5), (x, -5, 5), color='red', legend_label="ε=0.5") + \
plot(f_lorentz_prime(x, 0.2), (x, -5, 5), color='blue', legend_label="ε=0.2") + \
plot(f_lorentz_prime(x, 0.05), (x, -5, 5), color='green', legend_label="ε=0.05")
p1.show(title="First Derivative of Lorentzian Approximation")
p2 = plot(f_lorentz_double_prime(x, 0.5), (x, -5, 5), color='red', legend_label="ε=0.5") + \
plot(f_lorentz_double_prime(x, 0.2), (x, -5, 5), color='blue', legend_label="ε=0.2") + \
plot(f_lorentz_double_prime(x, 0.05), (x, -5, 5), color='green', legend_label="ε=0.05")
p2.show(title="Second Derivative of Lorentzian Approximation")
#Integration of the Lorentzian Sequence
# Compute symbolic integral
var('a b')
assume(a < 0, b > 0)
integral(f_lorentz(x, epsilon), x, a, b).simplify_full()
p1=plot(integral(f_lorentz(x, 0.1), x, -5, 5), (x, -5, 5), color='blue', legend_label="Lorentzian")
p1.show(title="Integrated Delta Approximations")
# Plotting the Integrated Sequences
# To visualize how the cumulative integrals approach step-like functions:
p1=plot(integral(f_lorentz(x, 0.1), x, -5, 5), (x, -5, 5), color='blue', legend_label="Lorentzian")
p1.show(title="Integrated Delta Approximations")
💡 Try It Yourself! Now You can copy and paste directly into here Run SageMath Code Here
Physics Note
Used in resonance and spectral line broadening (e.g. Lorentzian profile in spectroscopy).
- Get link
- X
- Other Apps
Popular posts from this blog
Understanding the Laplacian of 1/r and the Dirac Delta Function Mathematical Foundations & SageMath Insights
Unmasking the Laplacian: How Mathematics, Physics & AI Use This Powerful Operator Unveiling the Laplacian's Secrets: A Look at 1/r with SageMath Engage & Explore! Before we dive into the math, ask yourself: What does it mean when a function explodes to infinity at a point? Leave your thoughts in the comments below. We'll revisit this after exploring the Dirac delta function! Why Is the Laplacian of \( \frac{1}{r} \) Important? The function \( \frac{1}{r} \) frequently appears in physics to describe potentials like gravity and electrostatics, which depend inversely on distance. Understanding its Laplacian reveals the nature of sources concentrated at singular points. Mathematical Foundation: What Is the Laplacian and a Harmonic Function? The Laplacian operat...
Heuristic Computation and the Discovery of Mersenne Primes
Heuristic Computation and the Discovery of Mersenne Primes Heuristic Computation and the Discovery of Mersenne Primes “Where Strategy Meets Infinity: The Quest for Mersenne Primes” Introduction: The Dance of Numbers and Heuristics Mersenne primes are not just numbers—they are milestones in the vast landscape of mathematics. Defined by the formula: \[ M_p = 2^p - 1 \] where \( p \) is itself prime, these giants challenge our computational limits and inspire new methods of discovery. But why are these primes so elusive? As \( p \) grows, the numbers become astronomically large, making brute-force testing impossible. This is where heuristic computation steps in—guiding us with smart, experience-driven strategies. “In the infinite sea of numbers, heuristics are our compass.” Let’s explore how heuristics and algorithms intertwine to unveil these mathematical treasures. 1. Mersenne Primes — Giants of Number Theory Definition: Numbers of the form \( M_p = 2^p - 1 \...
Neural Network Generalization in the Over-Parameterization Regime: Mechanisms, Benefits, and Limitations
Neural Network Generalization in the Over-Parameterization Regime: Mechanisms, Benefits, and Limitations Neural Network Generalization in the Over-Parameterization Regime: Mechanisms, Benefits, and Limitations Introduction Over the past decade, deep neural networks (DNNs) have risen to prominence across a range of machine learning applications, achieving remarkable performance in domains such as computer vision, natural language processing, and reinforcement learning. A striking and counter-intuitive feature of modern DNNs is their propensity for over-parameterization: models often contain many more parameters than training samples, far exceeding the classical regime where statistical learning theory would predict rampant overfitting and poor generalization. Yet, these highly over-parameterized models not only fit the training data perfectly but also display outstanding generalization to unseen test data—often improving as the number of paramete...
Comments
Post a Comment
If you have any queries, do not hesitate to reach out.
Unsure about something? Ask away—I’m here for you!