Continuous-Time Markov Chains
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Convergence Rates of Continuous-Time Random Walks to Time-Fractional Diffusions with Unbounded Coefficients
arXiv:2605.31471v1 Announce Type: cross Abstract: We investigate uniform weak convergence rates for probabilistic numerical methods applied to backward time-fractional diffusion equations whose dynamics are driven by diffusions with possibly unbounded coefficients, such as the Geometric Brownian Motion. The fractional structure is represented through a random time-change by the inverse of a stable subordinator. To approximate the underlying fractional dynamics, we combine discrete Markov...
EndoTwin-W: glycodelin-A and CA-125 as non-invasive biomarkers of endometrial receptivity derived from a multiscale computational digital twin
Endometrial receptivity assessment currently requires invasive tissue biopsy, yet recent randomized trials have questioned the clinical utility of biopsy-based approaches. Here we present EndoTwin-W, a four-layer mechanistic computational model that simulates human endometrial remodeling from hormone inputs through receptor binding, pathway scoring, and continuous-time Markov chain cell-state transitions across 17 cell states. Transition rates were optimized against scRNA-seq and microarray...
Unsupervised Diffusion Solver for Combinatorial Optimization via Combinatorial Adjoint Matching
Announce Type: new Abstract: Diffusion-based neural solvers have shown strong promise for combinatorial optimization (CO), but existing methods typically rely on supervised training with large collections of near-optimal solutions. In this work, we extend adjoint-based trajectory optimization methods to discrete combinatorial domains. We formulate diffusion-based CO as a stochastic control problem over Continuous-Time Markov Chains and introduce discrete adjoint dynamics for propagating...
Predictive Coding with Bayesian Priors via Proximal Gradients
Announce Type: new Abstract: We recast predictive coding as continuous-time proximal gradient descent applied to a regularized maximum-a-posteriori (MAP) objective. We study first a single-level problem and then a multi-level hierarchy. For the single-level problem, we show that proximal gradient descent is precisely a leaky firing-rate network: the membrane leak, the effective recurrent matrix, the local synaptic drive, and the static nonlinearity all follow from one optimization principle,...
Temporally Encoded Double DQN for Proactive PRB Allocation in O-RAN Enabled Industrial Networks
arXiv:2605.30630v1 Announce Type: new Abstract: Fifth-generation (5G) wireless systems are increasingly adopted in smart manufacturing to support heterogeneous industrial workloads through services such as enhanced Mobile Broadband (eMBB) and Ultra-Reliable Low-Latency Communication (URLLC). However, industrial traffic is inherently process-driven and temporally correlated. So, static or reactive schedulers in the Open Radio Access Network (O-RAN) are inadequate for such non-stationary...