18 citations · 71 across the 23 of their papers we have counts for
28 papers
Opinion dynamics on non-sparse networks with community structure
Panagiotis Andreou, Mariana Olvera-Cravioto
We study the evolution of opinions on a directed network with community structure. Individuals update their opinions synchronously based on a weighted average of their neighbors' o…
PageRank Nibble on the sparse directed stochastic block model
Sayan Banerjee, Prabhanka Deka, Mariana Olvera-Cravioto
We present new results on community recovery based on the PageRank Nibble algorithm on a sparse directed stochastic block model (dSBM). Our results are based on a characterization…
Local weak limits for collapsed branching processes with random out-degrees
Sayan Banerjee, Prabhanka Deka, Mariana Olvera-Cravioto
We obtain local weak limits in probability for Collapsed Branching Processes (CBP), which are directed random networks obtained by collapsing random-sized families of individuals i…
Opinion dynamics on directed complex networks
Nicolas Fraiman, Tzu-Chi Lin, Mariana Olvera-Cravioto
We propose and analyze a mathematical model for the evolution of opinions on directed complex networks. Our model generalizes the popular DeGroot and Friedkin-Johnsen models by all…
Strong couplings for static locally tree-like random graphs
Mariana Olvera-Cravioto
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits…
PageRank Asymptotics on Directed Preferential Attachment Networks
Sayan Banerjee, Mariana Olvera-Cravioto
We characterize the tail behavior of the distribution of the PageRank of a uniformly chosen vertex in a directed preferential attachment graph and show that it decays as a power la…
Stochastic recursions on directed random graphs
Nicolas Fraiman, Tzu-Chi Lin, Mariana Olvera-Cravioto
For a directed graph on the vertices , we study the distribution of a Markov chain on such that…
Importance sampling for maxima on trees
Bojan Basrak, Michael Conroy, Mariana Olvera-Cravioto +1
We consider the distributional fixed-point equation: where the are i.i.d.~copies of , in…
PageRank's behavior under degree-degree correlations
Mariana Olvera-Cravioto
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 pro…
Last-mile shared delivery: A discrete sequential packing approach
Junyu Cao, Mariana Olvera-Cravioto, Zuo-Jun Shen
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…
On a general class of inhomogeneous random digraphs
Junyu Cao, Mariana Olvera-Cravioto
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of th…
Likelihood Ratio Gradient Estimation for Steady-State Parameters
Peter W. Glynn, Mariana Olvera-Cravioto
We consider a discrete-time Markov chain on a general state-space , whose transition probabilities are parameterized by a real-valued vector .…
PageRank on inhomogeneous random digraphs
Jiung Lee, Mariana Olvera-Cravioto
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 dire…
Convergence of the Population Dynamics algorithm in the Wasserstein metric
Mariana Olvera-Cravioto
We study the convergence of the population dynamics algorithm, which produces sample pools of random variables having a distribution that closely approximates that of the {\em spec…
Typical distances in the directed configuration model
Pim van der Hoorn, Mariana Olvera-Cravioto
We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model, in the supercritical regime.…
Efficient Simulation for Branching Linear Recursions
Ningyuan Chen, Mariana Olvera-Cravioto
We consider a linear recursion of the form where is a real-valued random vector with $N\in\…
Parallel queues with synchronization
Mariana Olvera-Cravioto, Octavio Ruiz-Lacedelli
Motivated by the growing interest in today's massive parallel computing capabilities we analyze a queueing network with many servers in parallel to which jobs arrive a according to…
Coupling on weighted branching trees
Ningyuan Chen, Mariana Olvera-Cravioto
This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of c…
PageRank in scale-free random graphs
Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto
We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of…
Maximums on Trees
Predrag R. Jelenkovic, Mariana Olvera-Cravioto
We study the minimal/endogenous solution to the maximum recursion on weighted branching trees given by …
Directed random graphs with given degree distributions
Ningyuan Chen, Mariana Olvera-Cravioto
Given two distributions F and G on the nonnegative integers we propose an algorithm to construct in- and out-degree sequences from samples of i.i.d. observations from F and G, resp…
Tail behavior of solutions of linear recursions on trees
Mariana Olvera-Cravioto
Consider the linear nonhomogeneous fixed point equation R =_d sum_{i=1}^N C_i R_i + Q, where (Q,N,C_1,...,C_N) is a random vector with N in{0,1,2,3,...}U{infty}, {C_i}_{i=1}^N >= 0…
Asymptotics for Weighted Random Sums
Mariana Olvera-Cravioto
Let be a sequence of independent identically distributed random variables with an intermediate regularly varying (IR) right tail . Let be a…
Implicit Renewal Theorem for Trees with General Weights
Predrag R. Jelenkovic, Mariana Olvera-Cravioto
Consider distributional fixed point equations of the form R =d f(C_i, R_i, 1 <= i <= N), where f(.) is a possibly random real valued function, N in {0, 1, 2, 3,...} U {infty}, {C_i…