相关论文: Mean-field behavior of the negative-weight percola…
By means of numerical simulations we investigate the geometric properties of loops on hypercubic lattice graphs in dimensions d=2 through 7, where edge weights are drawn from a distribution that allows for positive and negative weights. We…
This article proposes a new way of deriving mean-field exponents for the weakly self-avoiding walk model in dimensions $d>4$. Among other results, we obtain up-to-constant estimates for the full-space and half-space two-point functions in…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
By means of numerical simulations we investigate the configurational properties of densely and fully packed configurations of loops in the negative-weight percolation (NWP) model. In the presented study we consider 2d square, 2d honeycomb,…
We consider the negative weight percolation (NWP) problem on hypercubic lattice graphs with fully periodic boundary conditions in all relevant dimensions from d=2 to the upper critical dimension d=6. The problem exhibits edge weights drawn…
We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of…
This article proposes a new way of deriving mean-field exponents for sufficiently spread-out Bernoulli percolation in dimensions $d>6$. We obtain an upper bound for the full-space and half-space two-point functions in the critical and…
We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…
The statistics of equally weighted random paths (ideal polymer) is studied in $2$ and $3$ dimensional percolating clusters. This is equivalent to diffusion in the presence of a trapping environment. The number of $N$ step walks follows a…
We study the weight and length of the minimum mean-weight cycle in the stochastic mean-field distance model, i.e., in the complete graph on $n$ vertices with edges weighted by independent exponential random variables. Mathieu and Wilson…
We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
Diffusion is a key element of a large set of phenomena occurring on natural and social systems modeled in terms of complex weighted networks. Here, we introduce a general formalism that allows to easily write down mean-field equations for…
The random Lorentz gas (RLG) is a minimal model for transport in disordered media. Despite the broad relevance of the model, theoretical grasp over its properties remains weak. For instance, the scaling with dimension d of its localization…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
False-vacuum eternal inflation can be described as a random walk on the network of vacua of the string landscape. In this paper we show that the problem can be mapped naturally to a problem of directed percolation. The mapping relies on two…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…