Related papers: Lower large deviations and laws of large numbers f…
First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…
By studying the statistics of recurrence intervals, $\tau$, between volatilities of Internet traffic rate changes exceeding a certain threshold $q$, we find that the probability distribution functions, $P_{q}(\tau)$, for both byte and…
We construct a new finite difference method for the flow of ideal viscous isentropic gas in one spatial dimension. For the continuity equation, the method is a standard upwind discretization. For the momentum equation, the method is an…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
We consider the branching random walk $\{\mathcal R^N_z: z\in V_N\}$ with Gaussian increments indexed over a two-dimensional box $V_N$ of side length $N$, and we study the first passage percolation where each vertex is assigned weight…
We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the Z^d lattice. We consider the maximum flows through the edges of two disjoint sets, that is from a…
We provide sufficient conditions for mathematically rigorous proofs of the third order universal laws capturing the energy flux to large scales and enstrophy flux to small scales for statistically stationary, forced-dissipated 2d…
We derive hydrodynamics of a prototypical one dimensional model, having variable-range hopping, which mimics passive diffusion and ballistic motion of active, or self-propelled, particles. The model has two main ingredients - the hardcore…
We say that a convergence law holds for a sequence of random combinatorial objects if, for any first-order sentence $\varphi$, the proportion of objects satisfying $\varphi$ converges to a limiting value as the size of the objects tends to…
We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive…
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…
Isoperimetric profile describes the minimal boundary size of a set with a prescribed volume. Itai Benjamini conjectured that the isoperimetric profile of the giant component in supercritical percolation experiences an averaging effect and…
Velocity distribution functions link the micro- and macro-level theories of fluid flow through porous media. Here we study them for the fluid absolute velocity and its longitudinal and lateral components relative to the macroscopic flow…
This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (two-node) tandem queue, fed by a large number of Gaussian…
We consider a (one-dimensional) branching Brownian motion process with a general offspring distribution having at least two moments, and in which all particles have a drift towards the origin where they are immediately absorbed. It is…
We prove a strong law of large numbers for directed last passage times in an independent but inhomogeneous exponential environment. Rates for the exponential random variables are obtained from a discretisation of a speed function that may…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…
We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…
We consider two different objects on super-critical Bernoulli percolation on $\mathbb{Z}^d$ : the time constant for i.i.d. first-passage percolation (for $d\geq 2$) and the isoperimetric constant (for $d=2$). We prove that both objects are…