Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Mariana Olvera-Cravioto"'
Autor:
Mariana Olvera-Cravioto, Ningyuan Chen
Publikováno v:
Stochastic Systems, Vol 3, Iss 1, Pp 147-186 (2013)
Given two distributions F and G on the nonnegative integers wepropose an algorithm to construct in- and out-degree sequences fromsamples of i.i.d. observations from F and G, respectively, thatwith high probability will be graphical, that is, from whi
Externí odkaz:
https://doaj.org/article/2b43a7e4c02147e09b20ba3a1c50676b
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031322952
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5eaed7fe311471ab94f88497a7ee1b97
https://doi.org/10.1007/978-3-031-32296-9_10
https://doi.org/10.1007/978-3-031-32296-9_10
Publikováno v:
2022 Winter Simulation Conference (WSC).
Publikováno v:
The Annals of Applied Probability. 32
Publikováno v:
Mathematics of Operations Research. 46:1-27
Motivated by database locking problems in today’s massive computing systems, we analyze a queueing network with many servers in parallel (files) to which jobs (writing access requests) arrive according to a Poisson process. Each job requests simult
Publikováno v:
Mathematics of Operations Research. 45:1466-1497
We propose a model for optimizing the last-mile delivery of n packages from a distribution center to their final recipients, using a strategy that combines the use of ride-sharing platforms (e.g., Uber or Lyft) with traditional in-house van delivery
Autor:
Mariana Olvera-Cravioto, Junyu Cao
Publikováno v:
Random Structures & Algorithms. 56:722-774
Autor:
Mariana Olvera-Cravioto, Jiung Lee
Publikováno v:
Stochastic Processes and their Applications. 130:2312-2348
We study the typical behavior of a generalized version of Google's PageRank algorithm on a large family of inhomogeneous random digraphs. This family includes as special cases directed versions of classical models such as the Erd\"os-R\'enyi model, t
Autor:
Mariana Olvera–Cravioto
Publikováno v:
The Annals of Applied Probability. 31
The focus of this work is the asymptotic analysis of the tail distribution of Google’s PageRank algorithm on large scale-free directed networks. In particular, the main theorem provides the convergence, in the Kantorovich–Rubinstein metric, of th
Autor:
Mariana Olvera-Cravioto
We provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton–Watson process. This class includes in particular the conf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c57ee5d26574b6d5421fade7a9660ce
http://arxiv.org/abs/2102.10673
http://arxiv.org/abs/2102.10673