Related papers: Sharpness of the phase transition for constrained-…
We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
We analyse the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We derive new tighter deterministic and probabilistic bounds that we use to…
The singular values of a product of $M$ independent Ginibre matrices of size $N\times N$ form a determinantal point process. Near the soft edge, as both $M$ and $N$ go to infinity in such a way that $M/N\to \alpha$, $\alpha>0$, a scaling…
We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet.…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We consider general continuum percolation models obeying sparseness, translation invariance, and spatial decorrelation. In particular, this includes models constructed on general point sets other than the standard Poisson point process or…
We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a…
We compare lattice QCD determinations of topological susceptibility using a gluonic definition from the gradient flow and a fermionic definition from the spectral projector method. We use ensembles with dynamical light, strange and charm…
We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…
We prove that random-cluster models with q larger than 1 on a variety of planar lattices have a sharp phase transition, that is that there exists some parameter p_c below which the model exhibits exponential decay and above which there…
We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that…
We show that the local weak limit of a sequence of finite expander graphs with uniformly bounded degree is an ergodic (or extremal) unimodular random graph. In particular, the critical probability of percolation of the limiting random graph…
We study a random graph model with preferential edge attachment and detachment through the embedding into a generalized Yule model. We show that the in-degree distribution of a vertex chosen uniformly at random follows a power law in the…
In conventional site percolation, all lattice sites are occupied with the same probability. For a bipartite lattice, sublattice-selective percolation instead involves two independent occupation probabilities, depending on the sublattice to…
Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…
Mitra et al. [Phys. Rev. E 99 (2019) 012117] proposed a new percolation model that includes distortion in the square lattice and concluded that it may belong to the same universality class as the ordinary percolation. But the conclusion is…