Related papers: A random walk approach to high-dimensional critica…

For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the…

We investigate spectral functions in the vicinity of the critical temperature of a second-order phase transition. Since critical phenomena in quantum field theories are governed by classical dynamics, universal properties can be computed…

We consider large deviations for nearest-neighbor random walk in a uniformly elliptic i.i.d. environment on $\mathbb{Z}^d$. There exist variational formulae for the quenched and averaged rate functions $I_q$ and $I_a$, obtained by…

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

We study the asymptotic behavior of the critical density of the activated random walk model as the sleep rate $\lambda$ tends to $0$ and $\infty$. For large $\lambda$, we prove new lower bounds in dimensions 1 and 2, showing that in one…

We consider self-avoiding walk and percolation in $\Zd$, oriented percolation in $\Zd\times\Zp$, and the contact process in $\Zd$, with $p D(\cdot)$ being the coupling function whose range is denoted by $L<\infty$. For percolation, for…

We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…

We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt…

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…

In this note, we establish a functional central limit theorem for the capacity of the range for a class of $\alpha$-stable random walks on the integer lattice $\mathbb{Z}^d$ with $d > 5\alpha/2$. Using similar methods, we also prove an…

We consider a branching random walk in a random space-time environment of disasters where each particle is killed when meeting a disaster. This extends the model of the "random walk in a disastrous random environment" introduced by [15]. We…

We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…

The conditions $(T)_\gamma,$ $\gamma \in (0,1),$ which have been introduced by Sznitman in 2002, have had a significant impact on research in random walk in random environment. Among others, these conditions entail a ballistic behaviour as…

Subcritical catalytic branching random walk on d-dimensional lattice is studied. New theorems concerning the asymptotic behavior of distributions of local particles numbers are established. To prove the results different approaches are used…

We study the critical and off-critical (Griffiths-McCoy) regions of the random transverse-field Ising spin chain by analytical and numerical methods and by phenomenological scaling considerations. Here we extend previous investigations to…

Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…

We study in-network computation on general network topologies. Specifically, we are given the description of a function, and a network with distinct nodes at which the operands of the function are made available, and a designated sink where…

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

We establish a second-order almost sure limit theorem for the minimal position in a one-dimensional super-critical branching random walk, and also prove a martingale convergence theorem which answers a question of Biggins and Kyprianou [9].…