Related papers: Scale-free percolation mixing time
We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…
We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…
We study the mixing time of a non-Markovian process, the step-reinforced random walk (SRRW) on a finite group. This process differs from a classical random walk in that at each integer time, with probability $\alpha$ the next step is chosen…
Direct numerical simulations are carried out to investigate scalar mixing in an isotropic turbulent flow with a time-periodic forcing. For high amplitudes of the modulation, it is shown that the average mixing rate is negatively affected at…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these…
We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
We consider a random partition of the vertex set of an arbitrary graph that can be sampled using loop-erased random walks stopped at a random independent exponential time of parameter $q>0$, that we see as a tuning parameter.The related…
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…
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
We study mixing for a divergence-free passive vector field $u$ transported by another divergence-free vector field $U$, where $u$ evolves according to $ \partial_t u + (U \cdot \nabla) u + \nabla p = 0.$ In recent years, a lot of attention…
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregular graphs, let $G$ be a random graph on $n$ vertices with…
We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…