Related papers: Local weak limits for collapsed branching processe…
We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…
We establish general sufficient conditions for a sequence of controlled branching processes to converge weakly on the Skorokhod space. We focus on a class of controlled random variables that extends previous results by considering them as a…
Consider compound Poisson processes with negative drift and no negative jumps, which converge to some spectrally positive L\'evy process with non-zero L\'evy measure. In this paper we study the asymptotic behavior of the local time process,…
Logic-Based Benders Decomposition (LBBD) and its Branch-and-Cut variant, namely Branch-and-Check, enjoy an extensive applicability on a broad variety of problems, including scheduling. Although LBBD offers problem-specific cuts to impose…
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…
We consider continuous state branching processes (CSBP) with additional multiplicative jumps modeling dramatic events in a random environment. These jumps are described by a L\'evy process with bounded variation paths. We construct a…
Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this paper, we develop a new worst-case bound on the expected…
We consider the critical branching processes in correlated random environment which is positively associated and study the probability of survival up to the n-th generation. Moreover, when the environment is given by fractional Brownian…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…
In many cases of attacks or failures, memory effects play a significant role. Therefore, we present a model that not only considers the dependencies between nodes but also incorporates the memory effects of attacks. Our research…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
To disentangle the complex non-stationary dependence structure of precipitation extremes over the entire contiguous U.S., we propose a flexible local approach based on factor copula models. Our sub-asymptotic spatial modeling framework…
In this paper we establish spatial central limit theorems for a large class of supercritical branching Markov processes with general spatial-dependent branching mechanisms. These are generalizations of the spatial central limit theorems…
The local behavior of typical solutions of random constraint satisfaction problems (CSP) describes many important phenomena including clustering thresholds, decay of correlations, and the behavior of message passing algorithms. When the…
In modern data center networks, thousands of hosts contend for shared link capacity; the scale of these systems makes centralized scheduling impractical. This article models such scheduling as a bipartite matching problem under…
We consider a class of Crump-Mode-Jagers processes with interaction, constructed by removing a newly born offspring with a probability that depends on the age structure of the population at its birth time. We prove a law of large numbers…
Quenched randomness can have a dramatic effect on the dynamics of isolated 1D quantum many-body systems, even for systems that thermalize. This is because transport, entanglement, and operator spreading can be hindered by `Griffiths' rare…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…