Related papers: Connectivity patterns in loop percolation I: the r…
A family of models for fluctuating loops in a two dimensional random background is analyzed. The models are formulated as O(n) spin models with quenched inhomogeneous interactions. Using the replica method, the models are mapped to the…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We solve the O(n) model, defined in terms of self- and mutually avoiding loops coexisting with voids, on a 3-simplex fractal lattice, using an exact real space renormalization group technique. As the density of voids is decreased, the model…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
Connectivity and reachability on temporal networks, which can describe the spreading of a disease, decimation of information or the accessibility of a public transport system over time, have been among the main contemporary areas of study…
This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…
Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present…
Much recent rigorous study of the classical ferromagnetic Ising model has been powered by its graphical representations, such as the random current and loop O(1) model (high temperature expansion). In this paper, we prove uniqueness of…
We consider a general random walk loop soup which includes, or is related to, several models of interest, such as the Spin O(N) model, the double dimer model and the Bose gas. The analysis of this model is challenging because of the…
A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…
For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…
The loop $O(n)$ model is a model for a random collection of non-intersecting loops on the hexagonal lattice, which is believed to be in the same universality class as the spin $O(n)$ model. It has been conjectured that both the spin and the…
A lattice model of critical dense polymers $O(0)$ is considered for the finite cylinder geometry. Due to the presence of non-contractible loops with a fixed fugacity $\xi$, the model is a generalization of the critical dense polymers solved…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
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 continuous relational structures with finite domain $[n] := \{1, \ldots, n\}$ and a many valued logic, $CLA$, with values in the unit interval and which uses continuous connectives and continuous aggregation functions. $CLA$…
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.…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…