activity
19982005
most citedStructure of large random hypergraphs

72 citations · 112 across the 2 of their papers we have counts for

collaborators

7 papers

math.PR200572 cited

Structure of large random hypergraphs

R. W. R. Darling, J. R. Norris

The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov proce…

math.PR200240 cited

Fluid Limits of Pure Jump Markov Processes: a Practical Guide

R. W. R. Darling

A rescaled Markov chain converges uniformly in probability to the solution of an ordinary differential equation, under carefully specified assumptions. The presentation is much sim…

math.PR2001

Structure of large random hypergraphs

R. W. R. Darling, J. R. Norris

The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump type Markov proce…

math.PR1998

The Repeated Solicitation Model

R. W. R. Darling

This paper presents a probabilistic analysis of what we call the "repeated solicitation model". To give a specific context, suppose B is a direct marketing company with a list of S…

math.PR1998

Geometrically Intrinsic Nonlinear Recursive Filters II: Foundations

R. W. R. Darling

This paper contains the technical foundations from stochastic differential geometry for the construction of geometrically intrinsic nonlinear recursive filters. A diffusion X on a…

math.OC1998

Geometrically Intrinsic Nonlinear Recursive Filters I: Algorithms

R. W. R. Darling

The Geometrically Intrinsic Nonlinear Recursive Filter, or GI Filter, is designed to estimate an arbitrary continuous-time Markov diffusion process X subject to nonlinear discrete-…