Stochastic Process Semantics for Dynamical Grammar Syntax: An Overview
Eric Mjolsness
Abstract
We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is mapped to semantics given in terms of a ring of operators, so that grammatical composition corresponds to operator addition or multiplication. The operators are generators for the time-evolution of stochastic processes. Within this modeling framework one can express data clustering models, logic programs, ordinary and stochastic differential equations, graph grammars, and stochastic chemical reaction kinetics. This mathematical formulation connects these apparently distant fields to one another and to mathematical methods from quantum field theory and operator algebra.
Create a lesson
Related papers
WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution
Liyan Tang, Cyrus Rashtchian, Chun-Sung Ferng et al.
Mechanistic Reaction Prediction via Discrete Flow Matching on Graph-Structured Electron Occupation
Nguyen Xuan-Vu, Octavian Susanu, Daniel Armstrong et al.
Learning a Continuous Sepsis Severity Score Without Hour-by-Hour Supervision: A Two-Site Retrospective Study
Kevin Zhu, Ryan Zhang, Baraa Abed et al.
CorporateBench: Large-Scale Q&A Benchmarking with Temporal Knowledge Bases
Sil Hamilton, Albert Yu Sun, Oscar J. Romero et al.
Sophistication in GenAI Use: Field Evidence from a Large Firm
Nicholas J. Hallman, Zachary T. Kowaleski, Anu Puvvada et al.
Not All Eval-Awareness Is Equal: Capabilities Framing Predicts Compliance
Allison Zhuang, Santiago Aranguri