skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Sigman, K."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, Queueing systems)
    We develop a general framework for stationary marked point processes in discrete time. We start with a careful analysis of the sample paths. Our initial representation is a sequence {(tj,kj) :j∈Z} of times tj∈Z and marks kj∈K, with batch arrivals (i.e.,tj=tj+1) allowed. We also define alternative interarrival time and sequence representations and show that the three different representations are topologically equivalent. Then, we develop discrete analogs of the familiar stationary stochastic constructs in continuous time: time-stationary and point-stationary random marked point processes, Palm distributions, inversion formulas and Campbell’s theorem with an application to the derivation of a periodic-stationary Little’s law. Along the way,we provide examples to illustrate interesting features of the discrete-time theory. 
    more » « less
    Full Text Available