Related papers: On the Time Constant in a Dependent First Passage …
Motivated by the dynamics of resonant neurons we discuss the properties of the first passage time (FPT) densities for nonmarkovian differentiable random processes. We start from an exact expression for the FPT density in terms of an…
In a recent paper hep-lat/9704020 we investigated Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The models displayed first order…
We consider the standard first passage percolation on $\mathbb{Z}^{d}$: with each edge of the lattice we associate a random capacity. We are interested in the maximal flow through a cylinder in this graph. Under some assumptions Kesten…
In this work, we investigate the temporal evolution of the degree of a given vertex in a network by mapping the dynamics into a random walk problem in degree space. We analyze when the degree approximates a pre-established value through a…
We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…
The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…
In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the $d$-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of…
The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…
This paper presents the first end-to-end network for exemplar-based video colorization. The main challenge is to achieve temporal consistency while remaining faithful to the reference style. To address this issue, we introduce a recurrent…
We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent $\tau\in (2,3)$. In this model two colors spread with a fixed and…
We study the effects of time and space correlations of an external additive colored noise on the steady-state behavior of a Time-Dependent Ginzburg-Landau model. Simulations show the existence of nonequilibrium phase transitions controlled…
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…
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 consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…
One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
In this paper, we show that the first passage time in the frog model on $\Z^d$ with $d\geq 2$ has a sublinear variance. This implies that the central limit theorem does not holds at least with the standard diffusive scaling. The proof is…
The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces…
We consider time correlation for KPZ growth in 1+1 dimensions in a neighborhood of a characteristics. We prove convergence of the covariance with droplet, flat and stationary initial profile. In particular, this provides a rigorous proof of…
We consider first-passage percolation with positive, stationary-ergodic weights on the square lattice $\mathbb{Z}^d$. Let $T(x)$ be the first-passage time from the origin to a point $x$ in $\mathbb{Z}^d$. The convergence of the scaled…