Related papers: Scale-Free Percolation in Continuum Space
A disordered medium is often constructed by $N$ points independently and identically distributed in a $d$-dimensional hyperspace. Characteristics related to the statistics of this system is known as the random point problem. As $d \to…
In this work we consider five different lattice models which exhibit continuous phase transitions into absorbing states. By measuring certain universal functions, which characterize the steady state as well as the dynamical scaling…
A marked lattice is a $d$-dimensional Euclidean lattice, where each lattice point is assigned a mark via a given random field on ${\mathbb Z}^d$. We prove that, if the field is strongly mixing with a faster-than-logarithmic rate, then for…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
The dichotomy between noise-stable and (completely) noise-sensitive stochastic models is of recent interest in probability theory. Of particular interest is the study of lattice models coming from statistical physics. The Fourier transform…
We study the diffusion phenomena on the negatively curved surface made up of congruent heptagons. Unlike the usual two-dimensional plane, this structure makes the boundary increase exponentially with the distance from the center, and hence…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
We use a recently developed lattice model to study the percolation of particles of different sizes and shapes in the presence of a polymer matrix. The polymer is modeled as an infinitely long semiflexible chain. We study the effects of the…
The notions of self-organised criticality (SOC) and turbulence are traditionally considered to be applicable to disjoint classes of phenomena. Nevertheless, scale-free burst statistics is a feature shared by turbulent as well as…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
We show that not only preferential attachment but also preferential depletion leads to scale-free networks. The resulting degree distribution exponents is typically less than two (5/3) as opposed to the case of the growth models studied…
Scale-free and non-computable characteristics of natural networks are found to result from the least-time dispersal of energy. To consider a network as a thermodynamic system is motivated since ultimately everything that exists can be…
We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…
Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we…
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…
Social Network Analysis is a way of studying agents embedded in contexts. In about 1998, physicists discovered social networks as representations of complex systems. Small-world and scale-free networks are the paradigmatic models of this…
In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the $d$-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
The ranges of transmission of the mobiles in a Mobile Ad-hoc Network are not uniform in reality. They are affected by the temperature fluctuation in air, obstruction due to the solid objects, even the humidity difference in the environment,…