相关论文: Generalized approach to the non-backtracking lace …
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted…
The density conjecture for activated random walk on the interval was recently resolved using a new tool called layer percolation. As a step towards understanding how layer percolation extends to activated random walk on more complex graphs,…
A recently developed lattice method for large numbers of strongly interacting nonrelativistic fermions exhibits a heavy tail in the distributions of correlators for large Euclidean time {\tau} and large number of fermions N, which only…
We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…
We study the problem of a random walk on a lattice in which bonds connecting nearest neighbor sites open and close randomly in time, a situation often encountered in fluctuating media. We present a simple renormalization group technique to…
Spatial self-similarity is a hallmark of critical phenomena. We study the dynamic process of percolation, in which bonds are incrementally added to an initially empty lattice until the system becomes fully occupied. By tracking the gap --…
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…
One of the most striking features of quantum theory is that it allows distant observers to share correlations that resist local hidden variable (classical) explanations, a phenomenon referred to as Bell nonlocality. Besides their…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
A straightforward analytical scheme is proposed for computing the long-time, asymptotic mean velocity and dispersivity (effective diffusivity) of a particle undergoing a discrete biased random walk on a periodic lattice amongst an array of…
We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…
The Localization Landscape Theory (LLT) provides a classical picture of Anderson localization by introducing an effective confining potential whose percolation is proposed to coincide with the mobility edge. Although this proposal shows…
The effect of the thickness of the dielectric boundary layer that connects a material of refractive index $n_1$ to another of index $n_2$ is considered for the propagation of an electromagnetic pulse. For very thin boundary layer the…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
We study the range $R_n$ of a random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ indexed by a random tree with $n$ vertices. Under the assumption that the random walk is centered and has finite fourth moments, we prove in dimension…
We study how to restore site percolation on a damaged square lattice with nearest neighbor (N$^2$) interactions. Two strategies are suggested for a density $x$ of destroyed sites by a random attack at $p_c$. In the first one, a density $y$…
In this paper, we investigate preference-based reinforcement learning (PbRL), which enables reinforcement learning (RL) agents to learn from human feedback. This is particularly valuable when defining a fine-grain reward function is not…
We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice $\mathbb{Z}^d$ in dimensions $d>4$, in the vicinity of the critical point, and prove an upper bound…
We have developed an improved algorithm that allows us to enumerate the number of site animals on the square lattice up to size 46. We also calculate the number of lattice trees up to size 44 and the radius of gyration of both lattice…