default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariana Olvera-Cravioto
Person information
- affiliation: University of North Carolina at Chapel Hill, NC, USA
- affiliation (former): Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c4]Sayan Banerjee, Prabhanka Deka, Mariana Olvera-Cravioto:
PageRank Nibble on the Sparse Directed Stochastic Block Model. WAW 2023: 147-163- 2022
- [j7]Mariana Olvera-Cravioto
:
Strong couplings for static locally tree-like random graphs. J. Appl. Probab. 59(4): 1261-1285 (2022) - [c3]Michael Conroy, Mariana Olvera-Cravioto:
Efficient Rare Event Estimation for Maxima of Branching Random Walks. WSC 2022: 145-155 - [i3]Nicolas Fraiman, Tzu-Chi Lin, Mariana Olvera-Cravioto:
Opinion dynamics on directed complex networks. CoRR abs/2209.00969 (2022) - 2021
- [j6]Mariana Olvera-Cravioto, Octavio Ruiz Lacedelli:
Stationary Waiting Time in Parallel Queues with Synchronization. Math. Oper. Res. 46(1): 1-27 (2021) - 2020
- [j5]Junyu Cao, Mariana Olvera-Cravioto, Zuo-Jun Max Shen:
Last-Mile Shared Delivery: A Discrete Sequential Packing Approach. Math. Oper. Res. 45(4): 1466-1497 (2020) - [j4]Junyu Cao, Mariana Olvera-Cravioto:
Connectivity of a general class of inhomogeneous random digraphs. Random Struct. Algorithms 56(3): 722-774 (2020)
2010 – 2019
- 2017
- [j3]Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto:
Generalized PageRank on directed configuration networks. Random Struct. Algorithms 51(2): 237-274 (2017) - 2015
- [c2]Ningyuan Chen, Mariana Olvera-Cravioto:
Efficient simulation for branching linear recursions. WSC 2015: 2716-2727 - 2014
- [c1]Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto:
PageRank in Scale-Free Random Graphs. WAW 2014: 120-131 - 2013
- [j2]Predrag R. Jelenkovic, Mariana Olvera-Cravioto:
Convergence Rates in the Implicit Renewal Theorem on Trees. J. Appl. Probab. 50(4): 1077-1088 (2013) - 2011
- [j1]Mariana Olvera-Cravioto, Peter W. Glynn:
Uniform approximations for the M/G/1 queue with subexponential processing times. Queueing Syst. Theory Appl. 68(1): 1-50 (2011) - 2010
- [i2]Predrag R. Jelenkovic, Mariana Olvera-Cravioto:
Implicit Renewal Theory and Power Tails on Trees. CoRR abs/1006.3295 (2010)
2000 – 2009
- 2009
- [i1]Predrag R. Jelenkovic, Mariana Olvera-Cravioto:
Information Ranking and Power Laws on Trees. CoRR abs/0905.1738 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
