Related papers: Dependence and phase changes in random $m$-ary sea…
We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…
Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…
The exact large time and distance behavior of the field-field correlators has been computed for one-dimensional impenetrable anyons at finite temperatures. The result reproduces known asymptotics for impenetrable bosons and free fermions in…
We study the statistics of height and balanced height in the binary search tree problem in computer science. The search tree problem is first mapped to a fragmentation problem which is then further mapped to a modified directed polymer…
We observed the conformation of threads that free released from different altitudes. We also explore the effect of wetting liquid on the conformation developed. When released from an altitude, the thread conformation changes when free…
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
In order to obtain the full asymptotic expansion for Polya trees, i.e. rooted unlabelled and non-plane trees, Flajolet and Sedgewick observed that their specification could be seen as a slight disturbance of the functional equation…
The phase diagram of a system of monodispersed hard rectangles of size $m\times m k$ on a square lattice is numerically determined for $m=2,3$ and aspect ratio $k= 1,2,\ldots, 7$. We show the existence of a disordered phase, a nematic phase…
We solve an adaptive search model where a random walker or L\'evy flight stochastically resets to previously visited sites on a $d$-dimensional lattice containing one trapping site. Due to reinforcement, a phase transition occurs when the…
We study the asymptotic tail probability of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior…
Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…
Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where new vertices entering the system need to make decisions…
We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…
We examine bootstrap percolation on a regular (b+1)-ary tree with initial law given by Bernoulli(p). The sites are updated according to the usual rule: a vacant site becomes occupied if it has at least theta occupied neighbors, occupied…
We explicitly calculate the distance dependent correlation functions in a maximal entropy ensemble of random trees. We show that correlations remain disassortative at all distances and vanish only as a second inverse power of the distance.…
The paper studies the asymptotic behaviour of weighted functionals of long-range dependent data over increasing observation windows. Various important statistics, including sample means, high order moments, occupation measures can be given…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
The asymptotic behavior of an extended family of integral geometric random functionals, including spatiotemporal Minkowski functionals under moving levels, is analyzed in this paper. Specifically, sojourn measures of spatiotemporal…
We study preferential attachment (PA) trees with general attachment functions. PA suggests an intuitive monotonicity: if high-degree vertices are rewarded more strongly, then the resulting tree should become shallower. We examine this…