Related papers: Discrete one-dimensional coverage process on a ren…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
In Neyman's original formulation, a 1-alpha confidence interval procedure is justified by its long-run coverage properties, and a single realized interval is to be described only by the slogan that it either covers the parameter or it does…
We revisit the problem of constructing predictive confidence sets for which we wish to obtain some type of conditional validity. We provide new arguments showing how ``split conformal'' methods achieve near desired coverage levels with high…
The satisfiability and optimization of finite-dimensional Boolean formulas are studied using percolation theory, rare region arguments, and boundary effects. In contrast with mean-field results, there is no satisfiability transition, though…
We study the dynamical properties of a collection of models for communication processes, characterized by a single parameter $\xi$ representing the relation between information load of the nodes and its ability to deliver this information.…
We consider models of directed polymers interacting with a one-dimensional defect line on which random charges are placed. More abstractly, one starts from renewal sequence on $\Z$ and gives a random (site-dependent) reward or penalty to…
Complex nonlinear dynamics are ubiquitous in many fields. Moreover, we rarely have access to all of the relevant state variables governing the dynamics. Delay embedding allows us, in principle, to account for unobserved state variables.…
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…
Discrete diffusion models are increasingly competitive for language modeling, yet it remains unclear how their denoising objectives organize learning. Although these objectives target the full data distribution, we show that the exact…
In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…
Random sequential adsorption with diffusional relaxation, of two by two square objects on the two-dimensional square lattice is studied by Monte Carlo computer simulation. Asymptotically for large lattice sizes, diffusional relaxation…
The paper deals with disorders detection in the multivariate stochastic process. We consider the multidimensional Poisson process or the multivariate renewal process. This class of processes can be used as a description of the distributed…
We study a random growth model on $\R^d$ introduced by Deijfen. This is a continuous first-passage percolation model. The growth occurs by means of spherical outbursts with random radii in the infected region. We aim at finding conditions…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We obtain complementary recurrence and transience criteria for processes $X=(X_n)_{n \ge 0}$ with values in $\mathbb R^d_+$ fulfilling a non-linear equation $X_{n+1}=MX_n+g(X_n)+ \xi_{n+1}$. Here $M$ denotes a primitive matrix having…
In the $R$-spread out, $d$-dimensional voter model, each site $x$ of $\mathbb{Z}^d$ has state (or 'opinion') 0 or 1 and, with rate 1, updates its opinion by copying that of some site $y$ chosen uniformly at random among all sites within…
We obtain tight thresholds for bond percolation on one-dimensional small-world graphs, and apply such results to obtain tight thresholds for the \emph{Independent Cascade} process and the \emph{Reed-Frost} process in such graphs. These are…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
The one-dimensional kinetic contact process with parallel update is introduced and studied by the mean-field approximation and Monte Carlo (MC) simulations. Contrary to a more conventional scenario with single active phase for 1d models…
We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation…