Related papers: Large deviation principle for the streams and the …
Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…
We consider the so-called frog model with random initial configurations. The dynamics of this model is described as follows: Some particles are randomly assigned on any site of the multidimensional cubic lattice. Initially, only particles…
Recently, Einsiedler and the authors provided a bound in terms of escape of mass for the amount by which upper-semicontinuity for metric entropy fails for diagonal flows on homogeneous spaces $\Gamma\backslash G$, where $G$ is any connected…
We establish large deviation principles for the largest eigenvalue of large random matrices with variance profiles. For $N \in \mathbb N$, we consider random $N \times N$ symmetric matrices $H^N$ which are such that…
We study non-random fluctuation in the first passage percolation on $\mathbb{Z}^d$ and show that it diverges for any dimension. We also prove the divergence of the non-random shape fluctuation, which was conjectured in [Yu Zhang. The…
For first passage percolation (FPP) on Euclidean lattices $\mathbb{Z}^d$ with $d\ge 2$, it is expected that the variance of the first passage time between two points grows sublinearly in the distance with a universal exponent strictly…
In the graph stream model of computation, an algorithm processes the edges of an input graph in one or more sequential passes while using a memory sublinear in the input size. This model poses significant challenges for constructing long…
In this article we establish a large deviation principle for the family {\nu_{\epsilon}:\epsilon \in (0,1)} of distributions of the scaled stochastic processes {P_{-\log\sqrt{\epsilon}}Z_t}_{t\leq 1}, where (Z_t)_{t\in \lbrack 0,1]} is a…
Motivated by metastability in the zero-range process, we consider i.i.d.\ random variables with values in $\N_0$ and Weibull-like (stretched exponential) law $\mathbb P(X_i =k) = c \exp( - k^\alpha)$, $\alpha \in (0,1)$. We condition on…
We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving cut-off boundary at location n. Conditional on the sum being large at scale n, we show that a finite number of…
We study the detection and the reconstruction of a large very dense subgraph in a social graph with $n$ nodes and $m$ edges given as a stream of edges, when the graph follows a power law degree distribution, in the regime when $m=O(n. \log…
The gradient flow equation in the 2D $O(N)$ nonlinear sigma model with lattice regularization is solved in the leading order of the $1/N$ expansion. By using this solution, we analytically compute the thermal expectation value of a lattice…
Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we…
We present a large deviation principle at speed N for the largest eigenvalue of some additively deformed Wigner matrices. In particular this includes Gaussian ensembles with full-rank general deformation. For the non-Gaussian ensembles, the…
We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…
A variational principle is derived for two-dimensional incompressible rotational fluid flow with a free surface in a moving vessel when both the vessel and fluid motion are to be determined. The fluid is represented by a stream function and…
The dispersion of a diffusive scalar in a fluid flowing through a network has many applications including to biological flows, porous media, water supply and urban pollution. Motivated by this, we develop a large-deviation theory that…
Considering the first significant digits (noted d) in data sets of dissipation for turbulent flows, the probability to find a given number (d=1 or 2 or... 9) would be 1/9 for an uniform distribution. Instead the probability closely follows…
We study the maximum matching problem in the random-order semi-streaming setting. In this problem, the edges of an arbitrary $n$-vertex graph $G=(V, E)$ arrive in a stream one by one and in a random order. The goal is to have a single pass…
We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K_n$ are embedded in the $d$-dimensional torus $\mathbb…