相关论文: Analysis of the loop length distribution for the n…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from…
Pair density waves (PDW) are novel forms of superconducting states that exhibit periodically modulated pairing. A remaining challenge is to elucidate how intrinsic PDW order can emerge robustly in strongly correlated electrons. Here we…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…
We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover Problem in which the frequency of every…
We give a full account of the Numerical Stochastic Perturbation Theory method for Lattice Gauge Theories. Particular relevance is given to the inclusion of dynamical fermions, which turns out to be surprisingly cheap in this context. We…
We investigate energy propagation in a one-dimensional stub lattice in the presence of both disorder and nonlinearity. In the periodic case, the stub lattice hosts two dispersive bands separated by a flat band; however, we show that…
We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
We study the effects of adding loops to a critical percolation cluster on the diffusional, and equivalently, (scalar) elastic properties of the fractal network. From the numerical calculations of the eigenspectrum of the transition…
The self averaging properties of conductance $g$ are explored in random resistor networks with a broad distribution of bond strengths $P(g)\simg^{\mu-1}$. Distributions of equivalent conductances are estimated numerically on hierarchical…
We perform a comprehensive perturbative study of the operator spectrum in multi-scalar theories with hypercubic global symmetry. This includes working out symmetry representations and their corresponding tensor structures. These structures…
We propose a weighted planar stochastic lattice (WPSL) formed by the random sequential partition of a plane into contiguous and non-overlapping blocks and find that it evolves following several non-trivial conservation laws, namely…
We investigate the \emph{minimum weight cycle (MWC)} problem in the $\mathsf{CONGEST}$ model of distributed computing. For undirected weighted graphs, we design a randomized algorithm that achieves a $(k+1)$-approximation, for any…
Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…
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…
We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…
Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph, and use it to develop a continuum perturbation expansion for the MST on…
A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…