Related papers: Mapping functions and critical behavior of percola…
In this paper, the notion of dimension preserving approximation for real-valued bivariate continuous functions, defined on a rectangular domain $\rectangle$, has been introduced and several results, similar to well-known results of…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We study gradient percolation for site percolation on the triangular lattice. This is a percolation model where the percolation probability depends linearly on the location of the site. We prove the results predicted by physicists for this…
The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. For most concentrations of the scatterers the trajectories close…
We investigate the probability distribution $p(g)$ of the conductance $g$ in anisotropic two-dimensional systems. The scaling procedure applicable to mapping the conductance distributions of localized anisotropic systems to the…
We construct the uniform infinite planar map (UIPM), obtained as the n \to \infty local limit of planar maps with n edges, chosen uniformly at random. We then describe how the UIPM can be sampled using a "peeling" process, in a similar way…
We investigate finite size scaling in percolating widthless stick systems with variable aspect ratios in an extensive Monte Carlo simulation study. A generalized scaling function is introduced to describe the scaling behavior of the…
We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
We consider the directed percolation process as a prototype of systems displaying a nonequilibrium phase transition into an absorbing state. The model is in a critical state when the activation probability is adjusted at some precise value…
We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…
Second-order variational properties have been shown to play important theoretical and numerical roles for different classes of optimization problems. Among such properties, twice epi-differentiability has a special place because of its…
We present a fast method for estimating the cosmic microwave background polarization power spectra using unbiased estimates of heuristically-weighted correlation functions. This extends the O(N_pix^(3/2)) method of Szapudi et al. (2001) to…
This work presents an initial analysis of using bijective mappings to extend the Theory of Functional Connections to non-rectangular two-dimensional domains. Specifically, this manuscript proposes three different mappings techniques: a)…
Recently it was conjectured that nodal domains of random wave functions are adequately described by critical percolation theory. In this paper we strengthen this conjecture in two respects. First, we show that, though wave function…
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice in the critical region are investigated. We study numerically two scaling functions:…
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…