Related papers: Cluster size distributions of discrete random fiel…
We introduce a generic scheme to perform non-perturbative linked cluster expansions in long-range ordered quantum phases. Clusters are considered to be surrounded by an ordered reference state leading to effective edge-fields in the exact…
We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
We have obtained some upper bounds for the probability distribution of extremes of a self-similar Gaussian random field with stationary rectangular increments that are defined on the compact spaces. The probability distributions of extremes…
Maximum likelihood estimates (MLEs) are asymptotically normally distributed, and this property is used in meta-analyses to test the heterogeneity of estimates, either for a single cluster or for several sub-groups. More recently, MLEs for…
The independence clustering problem is considered in the following formulation: given a set $S$ of random variables, it is required to find the finest partitioning $\{U_1,\dots,U_k\}$ of $S$ into clusters such that the clusters…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
The analysis of spatial extremes requires the joint modeling of a spatial process at a large number of stations and max-stable processes have been developed as a class of stochastic processes suitable for studying spatial extremes. Spatial…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
This paper studies the limits of a spatial random field generated by uniformly scattered random sets, as the density $\lambda$ of the sets grows to infinity and the mean volume $\rho$ of the sets tends to zero. Assuming that the volume…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
An unsupervised classification method for point events occurring on a network of lines is proposed. The idea relies on the distributional flexibility and practicality of random partition models to discover the clustering structure featuring…
The distribution-dependent stochastic differential equations (DDSDEs) describe stochastic systems whose evolution is determined by both the microcosmic site and the macrocosmic distribution of the particle. The density function associated…
We consider a correlated site percolation problem on a cubic lattice of size $L^3$, with $16\le L\le 512$. The sites of an initially full lattice are removed by a random walk of ${\cal N}=uL^3$ steps. When the parameter $u$ crosses a…
The article describes the limiting distribution of the extremes of observations that arrive in clusters. We start by studying the tail behaviour of an individual cluster and then we apply the developed theory to determine the limiting…
The impact of an extreme climate event depends strongly on its geographical scale. Max-stable processes can be used for the statistical investigation of climate extremes and their spatial dependencies on a continuous area. Most existing…
We consider random rectangles in $\mathbb{R}^2$ that are distributed according to a Poisson random measure, i.e., independently and uniformly scattered in the plane. The distributions of the length and the width of the rectangles are…
This work presents a technique for particle size generation and placement in arbitrary closed domains. Its main application is the simulation of granular media described by disks. Particle size generation is based on the statistical…
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power…
Motivated by the papers of Mladenovc and Piterbarg (2006), Krajka (2011) and Pereira and Tan (2017), we study the limit properties for the maxima from nonstationary random fields subject to missing observations and obtain the weakly…