A theory of input–output architecture
E Oberfield - Econometrica, 2018 - Wiley Online Library
Individual producers exhibit enormous heterogeneity in many dimensions. This paper
develops a theory in which the network structure of production—who buys inputs from whom …
develops a theory in which the network structure of production—who buys inputs from whom …
[HTML][HTML] On generalized multiplicative cascades
Q Liu - Stochastic processes and their applications, 2000 - Elsevier
We consider a generalized Mandelbrot's martingale {Yn} and the associated Mandelbrot's
measure μω on marked trees. If the limit variable Z= lim Y n is not degenerate, we study the …
measure μω on marked trees. If the limit variable Z= lim Y n is not degenerate, we study the …
Fluctuation theory in continuous time
NH Bingham - Advances in Applied Probability, 1975 - cambridge.org
Our aim here is to give a survey of that part of continuous-time fluctuation theory which can
be approached in terms of functionals of Lévy processes, our principal tools being Wiener …
be approached in terms of functionals of Lévy processes, our principal tools being Wiener …
Asymptotic behaviour of continuous time, continuous state-space branching processes
DR Grey - Journal of Applied Probability, 1974 - cambridge.org
Results on the behaviour of Markov branching processes as time goes to infinity, hitherto
obtained for models which assume a discrete state-space or discrete time or both, are here …
obtained for models which assume a discrete state-space or discrete time or both, are here …
The impact of the service discipline on delay asymptotics
This paper surveys the M/G/1 queue with regularly varying service requirement distribution.
It studies the effect of the service discipline on the tail behavior of the waiting-time and/or …
It studies the effect of the service discipline on the tail behavior of the waiting-time and/or …
Fixed points of a generalized smoothing transformation and applications to the branching random walk
Q Liu - Advances in Applied Probability, 1998 - cambridge.org
Let {Ai: i≥ 1} be a sequence of non-negative random variables and let M be the class of all
probability measures on [0,∞]. Define a transformation T on M by letting Tμ be the …
probability measures on [0,∞]. Define a transformation T on M by letting Tμ be the …
Waiting-time tail probabilities in queues with long-tail service-time distributions
J Abate, GL Choudhury, W Whitt - Queueing systems, 1994 - Springer
We consider the standard GI/G/1 queue with unlimited waiting room and the first-in first-out
service discipline. We investigate the steady-state waiting-time tail probabilities P (W> x) …
service discipline. We investigate the steady-state waiting-time tail probabilities P (W> x) …
Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
PR Jelenković - The Annals of Applied Probability, 1999 - projecteuclid.org
Consider a finite list of items $ n= 1, 2,\dots, N $, that are requested according to an iid
process. Each time an item is requested it is moved to the front of the list. The associated …
process. Each time an item is requested it is moved to the front of the list. The associated …
Sojourn time asymptotics in processor-sharing queues
Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal
of attention in the queueing literature. While the PS paradigm emerged in the sixties as an …
of attention in the queueing literature. While the PS paradigm emerged in the sixties as an …