Related papers: Directed negative-weight percolation
In strictly one-dimensional systems, repulsive interactions tend to reduce particle mobility on a lattice. Therefore, the Drude weight, controlling the divergence at zero-frequency of optical conductivities in perfect conductors, is lower…
Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
We investigate the non-equilibrium stationary state of a translationally invariant one-dimensional driven lattice gas with short-range interactions. The phase diagram is found to exhibit a line of continuous transitions from a disordered…
The directed percolation process in the vicinity of non-equilibrium phase transition is studied by the means of field theoretic methods. It will be assumed that percolation takes place in a compressible environment, which will be generated…
A law of the iterated logarithm is established for the last passage times of directed percolation on rectangles in the plane over exponential or geometric independent random variables, rescaled to converge to the Tracy-Widom distribution.…
In this work a theory is developed for unifying large classes of nonlinear discrete-time dynamical systems obeying a superposition of a weighted maximum or minimum type. The state vectors and input-output signals evolve on nonlinear spaces…
We study the contact process on spatially embedded networks, consisting of a regular square lattice with long-range connections. To generate the networks, a long-range connection is randomly added to each node $i$ of a square lattice,…
We study subcritical two-dimensional oriented percolation seen from its rightmost point on the set of infinite configurations which are bounded above. This a Feller process whose state space is not compact and has no invariant measures. We…
The contact model for the spread of disease may be viewed as a directed percolation model on $\ZZ \times \RR$ in which the continuum axis is oriented in the direction of increasing time. Techniques from percolation have enabled a fairly…
We consider a class of simple, non-trivial models of evolving weighted scale-free networks. The network evolution in these models is determined by attachment of new vertices to ends of preferentially chosen weighted edges. Resulting…
Given a graph and a pair of terminals $s$, $t$, the next-to-shortest path problem asks for an $s\!\to \!t$ (simple) path that is shortest among all not shortest $s\!\to \!t$ paths (if one exists). This problem was introduced in 1996, and…
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erd\H{o}s-R\'enyi…
We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond…
Percolation is the simplest fundamental model in statistical mechanics that exhibits phase transitions signaled by the emergence of a giant connected component. Despite its very simple rules, percolation theory has successfully been applied…
Approaches to finite baryon density lattice QCD usually suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We test a method - sign reweighting - that works directly at finite chemical potential and…
We have generalized the idea of backbend in a nearest-neighbor oriented bond percolation process by considering a backbend sequence $\beta : \mathbb{Z}_+ \to \mathbb{Z}_+ \cup \{\infty\}$, and defining a $\beta$-backbend path from the…
We consider a maximum entropy edge weight model for shortest path networks that allows for negative weights. Given a graph $G$ and possible weights $\mathcal{W}$ typically consisting of positive and negative values, the model selects edge…
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
We study the model of Directed Polymers in Random Environment in 1+1 dimensions, where the distribution at a site has a tail which decays regularly polynomially with power \alpha, where \alpha \in (0,2). After proper scaling of temperature…