相关论文: Characterization of the critical values of branchi…

Characterizing the occupation statistics of a radiation flow through confined geometries is key to such technological issues as nuclear reactor design and medical diagnosis. This amounts to assessing the distribution of the travelled length…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

Conditions for almost sure extinction are studied in discrete time branching processes with an infinite number of types. It is not assumed that the expected number of children is a bounded function of the parent's type. There might also be…

We study the distribution of the maximal displacement of particles positions for the whole time of the population existence in the model of critical and subcritical catalytic branching random walk on Z. In particular, we prove that in the…

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

This paper demonstrates a new regeneration processes technology making use of positive stable distributions. We study the asymptotic behavior of branching processes with a randomly controlled migration component. Using the new method, we…

Under mild non-degeneracy assumptions on branching rates in each generation, we provide a criterion for almost-sure extinction of a multi-type branching process with time-dependent branching rates. We also provide a criterion for the total…

The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…

By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for…

We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In particular, we show that this point process has a surprising…

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…

It is known that maximal entropy random walks and partition functions that count long paths on graphs tend to become localized near nodes with a high degree. Here, we revisit the simplest toy model of such a localization: a regular tree of…

We consider the critical Galton-Watson process with overlapping generations stemming from a single founder. Assuming that both the variance of the offspring number and the average generation length are finite, we establish the convergence…

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

Exploration and trapping properties of random walkers that may evanesce at any time as they walk have seen very little treatment in the literature, and yet a finite lifetime is a frequent occurrence, and its effects on a number of random…

The edge-reinforced random walk (ERRW) is a random process on the vertices of a graph that is more likely to cross the edges it has visited in the past. Depending on the strength of the reinforcement, the ERRW of a single particle can…