相关论文: Cover levels and random interlacements
Dealing with compound renewal process with generally distributed jump sizes and inter-renewal intervals, we focus on the approximation for the fixed-probability level, which is the core of inverse level crossing problem. We are developing…
The main focus of this article concerns the strongly percolative regime of the vacant set of random interlacements on $ \mathbb{Z}^d$, with $d \ge 3$. We investigate the occurrence in a large box of an excessive fraction of sites that get…
We derive necessary and sufficient conditions for epi-convergence in distribution of normal integrands. As a basic tool for the proof a new characterisation for distributional convergence of random closed sets is used. Our approach via the…
A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
The nearest-neighbor level spacing distribution is numerically investigated by directly diagonalizing disordered Anderson Hamiltonians for systems of sizes up to 100 x 100 x 100 lattice sites. The scaling behavior of the level statistics is…
In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}^u \subset \mathbb{Z}^d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint…
We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce…
In this paper we define a class of coverage processes with infinitely divisible finite dimensional distributions and a particular type of correlation structure that can be thought of as generalizations of the classical Ornstein--Uhlenbeck…
We study the random sequential adsorption of $k$-mers on the fully-connected lattice with $N=kn$ sites. The probability distribution $T_n(s,t)$ of the time $t$ needed to cover the lattice with $s$ $k$-mers is obtained using a generating…
The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric.…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
We generalize standard credal set models for imprecise probabilities to include higher order credal sets -- confidences about confidences. In doing so, we specify how an agent's higher order confidences (credal sets) update upon observing…
A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
This Letter introduces a generalization of known duplication-divergence models for growing random graphs. This general duplication-divergence model includes a new coupled divergence asymmetry rate, which allows to obtain the structure of…
We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…
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 reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…
This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…