相关论文: Rigidity percolation in a field

We perform combined resistivity and compressibility studies of two-dimensional hole and electron systems which show the apparent metal-insulator transition - a crossover in the sign of dR/dT with changing density. No thermodynamic anomalies…

We study the low-energy physics of the critical (2+1)-dimensional random transverse-field Ising model. The one-dimensional version of the model is a paradigmatic example of a system governed by an infinite-randomness fixed point, for which…

We revisit the phase transition for percolation on randomly stretched lattices. Starting with the usual square grid, keep all vertices untouched while erasing edges according as follows: for every integer $i$, the entire column of vertical…

Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and…

We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…

Jammed granular media and glasses exhibit spatial long-range correlations as a result of mechanical equilibrium. However, the existence of such correlations in the flowing matter, where the mechanical equilibrium is unattainable, has…

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…

A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_1$ and $S_2$, the states of the edges in $S_1$ are independent of the…

Network geometry is currently a topic of growing scientific interest as it opens the possibility to explore and interpret the interplay between structure and dynamics of complex networks using geometrical arguments. However the field is…

I use a previously introduced mapping between the continuum percolation model and the Potts fluid to derive a mean field theory of continuum percolation systems. This is done by introducing a new variational principle, the basis of which…

Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…

The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…

Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…

Our object of study is the asymptotic growth of heaviest paths in a charged (weighted with signed weights) complete directed acyclic graph. Edge charges are i.i.d. random variables with common distribution $F$ supported on $[-\infty,1]$…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

We prove that the phase transition for the Gaussian free field (GFF) is sharp. In comparison to a previous argument due to Rodriguez in 2017 which characterized a $0-1$ law for the Massive Gaussian Free Field by analyzing crossing…

Many non-equilibrium systems display dynamic phase transitions from active to absorbing states, where fluctuations cease entirely. Based on a field theory representation of the master equation, the critical behavior can be analyzed by means…

In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…

In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…

Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…