Interarrival time is the amount of time between one event and the next. In Intro to Statistics, it is usually modeled with the exponential distribution when arrivals happen randomly at a steady average rate.
Interarrival time is the waiting time between consecutive events in a process. In Intro to Statistics, that usually means the time from one arrival to the next, like the minutes between customers entering a shop or the hours between bus arrivals.
The idea shows up when events happen one at a time and you care about timing, not just counts. If a problem asks how long until the next call, the next machine failure, or the next person shows up, you are working with interarrival time.
This term is tied to the exponential distribution. If events follow a Poisson process with a constant average arrival rate, then the interarrival times are exponential. That means short waits are more common than long waits, but long waits can still happen.
The rate parameter, usually written as lambda, tells you the average number of arrivals per unit of time. A larger lambda means shorter average interarrival times. The average interarrival time is the reciprocal of the arrival rate, so if customers arrive at 3 per hour, the mean time between arrivals is 1/3 of an hour, or 20 minutes.
A big feature of interarrival time is the memoryless property. If you have already waited 10 minutes for the next arrival, the exponential model treats the remaining wait as if you were starting over. That can feel weird at first, but it is exactly what makes the model mathematically clean in statistics problems.
A common mistake is confusing interarrival time with service time. Interarrival time is about how long you wait for the next event to occur. Service time is how long it takes to handle that event once it arrives. In queueing problems, those are separate pieces of the system, and you often need both.
Interarrival time gives you the timing side of random event models in Intro to Statistics. If you only count how many events happen, you miss the structure of waiting. Once you start measuring time between events, you can use the exponential distribution to answer questions like, “What is the probability the next customer arrives within 5 minutes?” or “How long do we expect to wait until the next failure?”
This concept also connects directly to how statisticians model uncertainty in real systems. Queueing problems, call centers, website visits, and reliability questions all depend on whether arrivals happen randomly at a steady average rate. Interarrival time is the bridge between the count model and the waiting-time model.
It also gives you a practical way to interpret lambda. Instead of treating the rate parameter as a formula symbol, you can read it as the average pace of arrivals and translate it into a mean waiting time. That makes exponential probability questions much easier to set up and check for reasonableness.
In class, this term often shows up when you compare counts to waiting times, read a graph or density curve, or decide whether the exponential model fits a situation. If you know what interarrival time means, you can keep those problems straight instead of mixing up arrivals, waiting, and service.
Keep studying Intro to Statistics Unit 5
Visual cheatsheet
view galleryPoisson Process
Interarrival time is usually defined inside a Poisson process. The Poisson process models random arrivals over time, and one of its main assumptions is that the waiting times between arrivals are independent. If the arrivals are Poisson, then the interarrival times follow an exponential distribution, which is why the two ideas are taught together.
Exponential Distribution
The exponential distribution is the probability model for interarrival time when arrivals happen at a constant average rate. In problems, you use it to find probabilities about waiting times, not counts. If the question asks about the time until the next event, exponential is usually the distribution you reach for.
Arrival Rate
Arrival rate tells you how many events happen per unit time, while interarrival time tells you how much time passes between events. They are reciprocal ideas, so a higher arrival rate means shorter gaps between arrivals. This relationship is one of the fastest ways to check whether your answer makes sense.
Memoryless Property
The memoryless property says that past waiting time does not change the distribution of the remaining wait. For interarrival time, that means if you have already waited a while, the exponential model still treats the next wait as fresh. This is a defining feature of the model and a common source of confusion.
A quiz or problem-set question usually gives you an arrival rate or a waiting-time scenario and asks you to compute a probability, mean wait, or interpret the model. Your job is to recognize that the quantity is a time between arrivals, not a count of arrivals, and then use the exponential distribution setup correctly.
If the question says customers arrive at an average of 4 per hour, you convert that into a rate and then work with waiting time in hours, minutes, or seconds as needed. A common move is finding the probability that the next arrival happens before a certain time or after a certain time using the exponential formula or the CDF.
You may also need to explain whether the memoryless assumption makes sense in a situation. If arrivals are roughly random and independent, the exponential model is a good fit. If the arrival pattern has rush hours, schedules, or clustering, you should be cautious about using interarrival time as if it were exponential.
Interarrival time is the gap between arrivals, while service time is the amount of time spent handling an arrival after it occurs. In a queue, these are separate random variables. A customer can arrive every 2 minutes on average, but still take 8 minutes to be served.
Interarrival time is the time between one event and the next, not the number of events.
In Intro to Statistics, interarrival time is usually modeled with the exponential distribution when arrivals happen at a constant average rate.
The arrival rate and the mean interarrival time are reciprocals, so a faster rate means shorter waiting gaps.
The memoryless property means the remaining wait does not depend on how long you have already waited.
Do not mix up interarrival time with service time, because they describe different parts of a queue or random process.
Interarrival time is the time between consecutive arrivals or events. In Intro to Statistics, it usually appears in exponential distribution problems where you are modeling how long you wait for the next event. The focus is on timing, not on how many events happen.
If arrivals follow a Poisson process, the interarrival times follow an exponential distribution. That means the waiting time between events has a constant average rate, and shorter waits are more likely than long ones. This is why exponential models are used for random arrival timing.
Interarrival time measures the gap between arrivals, while service time measures how long it takes to handle an arrival once it gets there. In queueing problems, you often analyze both. Mixing them up leads to the wrong probability setup.
You identify the waiting time between events, convert the rate into the right units, and then use the exponential distribution to find a probability or expected wait. For example, if a problem gives arrivals per hour, you can find the chance the next arrival happens within a certain number of minutes. The big check is whether the question asks about time until an event.