Related papers: An improved decoupling inequality for random inter…
The aim of this note is to give an alternative construction of interlacements - as introduced by Sznitman - which makes use of classical probabilistic potential theory. In particular, we outline that the intensity measure of an…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…
We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…
Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…
Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…
We prove a shape theorem for the internal (graph) distance on the interlacement set $\mathcal{I}^u$ of the random interlacement model on $\mathbb Z^d$, $d\ge 3$. We provide large deviation estimates for the internal distance of distant…
The main idea of nested sampling is to substitute the high-dimensional likelihood integral over the parameter space $\Omega$ by an integral over the unit line $[0,1]$ by employing a push-forward with respect to a suitable transformation.…
In this paper the following result, which allows one to decouple U-Statistics in tail probability, is proved in full generality. Theorem 1. Let $X_i$ be a sequence of independent random variables taking values in a measure space $S$, and…
In this paper, we consider classic randomized low diameter decomposition procedures for planar graphs that obtain connected clusters which are cohesive in that close-by pairs of nodes are assigned to the same cluster with high probability.…
Nested nonparametric processes are vectors of random probability measures widely used in the Bayesian literature to model the dependence across distinct, though related, groups of observations. These processes allow a two-level clustering,…
This paper studies probabilistic rates of convergence for consensus+innovations type of algorithms in random, generic networks. For each node, we find a lower and also a family of upper bounds on the large deviations rate function, thus…
The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size $N$ is varied; the scaling curve depends on the graph model. A…
We study the effect of quenched random field disorder on a driven elastic interface close to the depinning transition at the upper critical dimension d_{c}=4 using the functional renormalization group. We have found that the displacement…
We introduce random interlacements for transient vertex-reinforced jump processes on a general graph $G$. Using increasing finite subgraphs $G_n$ of $G$ with wired boundary conditions, we show convergence of the vertex-reinforced jump…
For N=1,2,..., let S_N be a simple random sample of size n=n_N from a population A_N of size N, where 0<=n<=N. Then with f_N=n/N, the sampling fraction, and 1_A the inclusion indicator that A is in S_N, for any H a subset of A_N of size k>=…
We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…
We study point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the extremes of these random walks. We show convergence of the maximum random walk to the Gumbel distribution under the…
In this paper we study random graphs with independent and identically distributed degrees of which the tail of the distribution function is regularly varying with exponent $\tau\in (2,3)$. The number of edges between two arbitrary nodes,…
A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…