Actuarial statistics Created 2026-10-06 Updated 2026-10-13
Actuarial statistics uses probability theory and statistical inference to quantify insurance claims, premiums, and the uncertainty of future losses. Aggregate claims model describes portfolios, reinsurance redistributes losses, and the Bühlmann model combines experience with population information.
Almost sure equality Created 2026-09-24 Updated 2026-11-05
random variables and are almost surely equal when . Probability theory conventionally identifies random variables that differ only on a null event.
Analysis of Boolean functions Created 2026-09-24 Updated 2026-09-24
Analysis of Boolean functions studies real-valued functions on a Boolean hypercube using Fourier analysis, probability theory, and combinatorics.
Arnab Sen 2026-11-05
Arnab Sen is a mathematician working in probability theory and mathematical physics. His own biography identifies a Berkeley doctorate completed in 2010, subsequent research at Cambridge, and work at the University of Minnesota. His research includes random graphs, random matrices and disordered models in statistical physics.[ref]
With Nathanaël Berestycki and Christophe Garban, he developed a new state space and topology for the coalescing Brownian flow and proved an probabilistic invariance principle for coalescing random walks under a finite-variance assumption. The theorem connects discrete particle systems with a continuum stochastic flow.[ref]
Coalescing Brownian flows: A new approach by Nathanaël Berestycki and others. Abstract and Introduction: new state space, topology and finite-variance invariance principle
Bertrand paradox (probability) Created 2026-10-14 Updated 2026-11-05
Different precise measures on random chords give different probabilities; the phrase “random chord” does not select a unique probability distribution. In a circle of radius , a chord exceeds the side of an inscribed equilateral triangle exactly when its midpoint distance from the center is below . Uniform midpoint area gives probability , independent uniform endpoints give , and uniform midpoint distance gives . The difference is in the sampling laws, not a contradiction in probability theory.
Blaise Pascal Created 2026-10-13 Updated 2026-11-05
Blaise Pascal was a mathematician and natural philosopher whose scientific work covered projective geometry, probability theory and hydrostatics. His correspondence with Pierre de Fermat in 1654 helped establish methods for calculating chances and dividing the stakes of an interrupted game. He also studied atmospheric pressure and developed a mechanical calculating machine.[ref]
https://mathshistory.st-andrews.ac.uk/Biographies/Pascal/. Biography, Fermat correspondence, pressure experiments and calculator
The Pascal triangle connects these interests through binomial coefficients: its addition rule counts choices according to whether a specified object is selected. The same coefficients describe the distribution of the number of successes in repeated independent trials with a fixed success probability.Portrait of Blaise Pascal
. Paul Prieur, portrait; photograph Anna Danielsson / Nationalmuseum, Stockholm. Creative Commons Attribution-ShareAlike 4.0 International., via Wikimedia Commons. Source. Christophe Garban 2026-11-05
Christophe Garban is a mathematician whose research connects probability theory with statistical physics. His institutional and personal pages identify work on percolation, phase transitions and scaling limits, with a professorship at Lyon 1 beginning in 2014.[ref]
His work with collaborators constructs limiting measures for pivotal sites, clusters and interfaces in critical planar percolation. A pivotal site is a location whose state can change a macroscopic connectivity event. Counting such locations requires a scale-dependent normalization before a nontrivial continuum limit emerges. The resulting measures make sensitivity to microscopic changes part of the limiting geometry.[ref]
Pivotal, cluster and interface measures for critical planar percolation by Christophe Garban and others. Abstract and Introduction: pivotal measures, conformal covariance and cluster/interface measures
With Nathanaël Berestycki and Arnab Sen, he also constructed a state-space description yielding convergence from coalescing random walks to a coalescing Brownian flow with only finite variance of the increments. This connects his study of continuum random geometry with interacting stochastic paths.[ref]
Coalescing Brownian flows: A new approach by Nathanaël Berestycki and others. Abstract: finite-variance invariance principle and topology motivated by planar percolation
Coding theory Created 2026-09-24 Updated 2026-10-18
Coding theory studies representations of messages that make decoding efficient, reliable, or compact. In channel coding, messages are mapped to separated codewords, so a corrupted word can still be recognized as coming from one particular message. In lossless source coding, a prefix code instead assigns short descriptions to frequent symbols. The objectives differ, but both exploit structure in the set of allowed words.
The simplest error-correction example sends as and as . If the receiver sees , at most one bit flip is consistent with , whereas two flips would be needed to obtain it from . A repetition code therefore recovers the original by taking the majority function of the received bits. The Hamming distance between the valid codewords is three: the spaces of one-error outputs around them do not overlap. This turns error correction into geometry in a discrete space.
The central tradeoff is between code rate and minimum distance. Additional separation makes correction possible but leaves fewer words available for messages at a fixed length. The Hamming bound counts disjoint error neighborhoods, while linear codes turn encoding and error detection into computations with matrices over finite fields. These connections explain why combinatorics, linear algebra, and probability theory all enter the subject.
Richard W. Hamming's Error Detecting and Error Correcting Codes appeared in the Bell System Technical Journal in April 1950, pp. 147–160. Its introduction motivates automatic correction through failures in digital computing, and its constructions go beyond detecting an error to identifying and correcting its location.[ref]
https://zoo.cs.yale.edu/classes/cs323/doc/Hamming.pdf. Hamming, Error Detecting and Error Correcting Codes, 1950
Consistent histories Created 2026-10-20 Updated 2026-11-05
An approach assigning probabilities to compatible families of time-ordered quantum alternatives. A decoherence functional measures interference between histories; when its relevant cross-terms vanish, coarse-grained probabilities add as in probability theory. Different incompatible families must not be combined as if they were one classical history space. The formalism does not require a fundamental external measurement apparatus.
Craig L. Zirbel 2026-11-05
Craig L. Zirbel is a mathematician whose research connects probability theory with applications including RNA geometry and stochastic fluid motion. Bowling Green State University's faculty page identifies him as professor emeritus in mathematics and statistics and lists random measures, mass transport, and RNA structure and sequence variability among his interests.[ref]
Craig L. Zirbel, portrait supplied on his university faculty page
. With Jesse Stombaugh, Eric Westhof and Neocles B. Leontis, he coauthored the 2009 study Frequency and isostericity of RNA base pairs by Jesse Stombaugh and others. It introduces the RNA IsoDiscrepancy Index and uses structural comparisons to investigate which base-pair substitutions preserve local geometry. This connects geometric annotation with comparisons of sequence variation, rather than treating nucleotide identities alone as a complete structural description.[ref]
Frequency and isostericity of RNA base pairs by Jesse Stombaugh and others. Abstract; definition and validation of the index
One mathematical task in that study is choosing an observed representative from several instances of a base-pair type. The authors compare instances and select the row with the smallest sum of discrepancies. An original miniature example uses the symmetric comparison-cost matrixIts row sums are 5, 4 and 7, so the second instance is the representative minimizing total comparison cost. These are chosen teaching values, not reported measurements of an RNA structure. The rule selects an observed instance; it does not require constructing an average set of atomic coordinates.[ref]
Frequency and isostericity of RNA base pairs by Jesse Stombaugh and others. Methods, selection of base-pair exemplars using the minimum row sum
Such a geometric representative is not necessarily the lowest-free energy structure, nor does a small discrepancy prove identical biological function. The example shows how an explicit comparison rule turns structural data into a reproducible choice, while leaving the physical interpretation to the measurement and molecular context.
Dan Romik Created 2026-10-18 Updated 2026-11-05
Dan Romik works in number theory, combinatorics and probability theory.[ref] His Complex Analysis Lecture Notes by Dan Romik also develops holomorphic functions, contour integrals and the geometry of the Riemann sphere, providing an expository connection between complex analysis and geometry.
Identity source: www.math.ucdavis.edu/people/general-profile?fac_id=romik
Davar Khoshnevisan 2026-11-05
Davar Khoshnevisan is a mathematician whose work concerns probability theory, particularly random fields and stochastic partial differential equations. His institutional page lists research on long-time behavior and well-posedness of randomly forced equations, as well as geometric properties of their solutions.[ref]
His Topics in Probability: Lévy Processes by Davar Khoshnevisan develops how processes with stationary independent increments are decomposed and described by their exponents. For instance, the notes distinguish increasing jump processes through the Laplace exponent of a subordinator of a subordinator, connecting an abstract stochastic process to an explicitly computable transform.[ref]
Topics in Probability: Lévy Processes by Davar Khoshnevisan. Lectures 7–8, compound Poisson component and Laplace exponent
David Aldous 2026-11-05
David Aldous studies probability theory and random combinatorial structures. His random-walk construction of a uniform spanning tree keeps the first-entrance edge for each newly visited vertex of a finite connected graph.[ref]
Those edges necessarily form a tree, but their uniform distribution requires a separate argument. The construction permits properties of random trees—degrees, leaves and diameter—to be studied through random walks. Its running time is tied to the walk's cover time, giving a direct link between a stochastic exploration process and a combinatorial sampling algorithm.[ref]
The nine-page University of Oxford Computer Science Prelims paper dated 20 June 2013. The public released examination archive contains the original scan as
4223-1.pdf. Printed pages 2–4 cover discrete mathematics, pages 5–6 cover calculus and ordinary differential equations, and pages 7–9 cover probability theory. Question 8(c)(i) introduces the two-roll model without asking for a separate calculation; Question 8(c)(v) allows the trivial independence of an impossible event unless the values are restricted to the two marginal supports. Dmitry Beliaev Created 2026-10-24 Updated 2026-11-05
Dmitry Beliaev works at the interface of analysis and probability theory. His research studies the geometry of random functions, including their level sets and connections with percolation. Such questions ask how local random fluctuations produce connected structures on larger spatial scales.[ref]
https://people.maths.ox.ac.uk/belyaev/. Author homepage, Research interests and Smooth Gaussian fields and percolation publication description
Homepage: people.maths.ox.ac.uk/belyaev/
Exponential limit 2026-10-31
For fixed real , the base is positive for sufficiently large . Applying Taylor's theorem to the natural logarithm at one gives . Continuity of the exponential function then proves the displayed limit. In particular for fixed , a basic source of exponential distribution limits in probability theory.
Frank Kelly 2026-11-05
Frank Kelly works on probability theory, stochastic networks and the mathematical organization of shared resources. His research connects queueing theory with optimization: local decisions about service, admission or price can determine a network's aggregate performance. His institutional research record describes these interests.[ref]
With Elena Yudovina, Kelly wrote Stochastic Networks by Frank Kelly and Elena Yudovina. Its treatment of loss networks shows how detailed balance can produce an explicit equilibrium occupancy law, while congestion control uses resource prices to coordinate competing demands. These are complementary uses of mathematics: predicting congestion and designing rules that improve it.[ref]
Stochastic Networks by Frank Kelly and Elena Yudovina. Sections 1.3 and 3.1 on loss occupancy; chapter 7 on congestion control
Galyna V. Livshyts 2026-11-05
Galyna V. Livshyts studies convex geometry, analysis and high-dimensional probability theory. Her research page connects these areas through geometric inequalities and properties of convex sets.[ref]
Her course Topics in Concentration of Measure and Convexity by Galyna V. Livshyts develops concentration of measure, isoperimetric inequalities and Steiner symmetrization. Replacing each parallel fibre of a set by a centred interval of the same length preserves volume while increasing symmetry, making some inequalities easier to prove. The course page credits the written notes to students, with editing by Livshyts.[ref]
Topics in Concentration of Measure and Convexity by Galyna V. Livshyts. Definition 3.1 and Claim 3.2, p. 28; course-page authorship credit
Gamma function Created 2026-09-24 Updated 2026-10-20
The Gamma function extends factorials to a continuous argument. Its defining Gamma integral iswhere uses the real natural logarithm for . The Gamma function recurrence gives its meromorphic continuation to the complex plane, with simple poles at and no zeros. See Gamma function residue at a nonpositive integer and Gamma function has no zeros for proof outlines.[ref]
For nonnegative integers , the factorial identity has a shift of one:Thus for positive integers . Half-integer arguments supply a different familiar constant:The first value follows from the Gaussian integral; the second follows from the Gamma function recurrence.[ref]
The Gamma function on the positive real axis passes through the factorial values 0! through 5! at arguments 1 through 6
. Details. The plot shows only positive real arguments; the gamma function also accepts complex numbers away from its poles. Matching the factorials alone does not select a unique interpolation, even if the Gamma function recurrence is imposed: has the same positive-integer values and the same recurrence relation. The Bohr-Mollerup theorem supplies the extra condition that selects the gamma function.
The useful idea is to replace a discrete product of numbers by an integral whose exponent varies continuously. The Gamma integral then evaluates whole families of integrals at once, provides the normalizing constant for the Gamma distribution in probability theory, and appears in physics, for example in the Bose integral. Its large-positive-argument growth reconnects this continuous description to factorials through Stirling's formula.[ref]
Historically, Leonhard Euler studied the interpolation of factorials in his paper E19, written in 1729 and published in 1738. His integral over becomes the Gamma integral after a change of variables, with the same one-step shift in the argument.[ref]
https://scholarlycommons.pacific.edu/euler-works/19/. Euler Archive, E19: original-paper record, dates, and integral construction
George Pólya Created 2026-10-14 Updated 2026-11-05
George Pólya was a mathematician whose research spanned probability theory, analysis, combinatorics and geometry. He also became an influential writer about mathematical discovery, emphasizing the search for analogies, simpler cases and useful auxiliary constructions.[ref]
https://mathshistory.st-andrews.ac.uk/Biographies/Polya/. Biography, research areas and approach to mathematical discovery
His work on random walks gives a striking example of dimension changing a qualitative answer: a simple symmetric random walk on the integer lattice returns to its starting point with probability one in dimensions one and two, while in dimension three that probability is less than one. The distinction connects local random steps with the distinction between recurrent graphs and transient graphs.Portrait of George Pólya
. Photograph identified on the named portrait page. Source.




