相关论文: Duality in percolation via outermost boundaries I:…
Upper bound limit analysis allows one to evaluate directly the ultimate load of structures without performing a cumbersome incremental analysis. In order to numerically apply this method to thin plates in bending, several authors have…
An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong chromatic index of bipartite outerplanar graphs. Further, we…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation…
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…
For a certain class of two-dimensional lattices, lattice-dual pairs are shown to have the same bond percolation critical exponents. A computational proof is given for the martini lattice and its dual to illustrate the method. The result is…
We examine the effects of introducing a wall or edge into a directed percolation process. Scaling ansatzes are presented for the density and survival probability of a cluster in these geometries, and we make the connection to surface…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
Uniformly star superparacompactness, which is a topological property between compactness and completeness, can be characterized using finite-component covers and a measure of strong local compactness. Using these finite-component covers and…
Geometric representations provide a useful perspective on critical phenomena in the Ising model. In a recent study [Phys. Rev. E 112, 034118 (2025)], we found that the two-dimensional critical Ising model exhibits two consecutive…
We investigate several related measures of peripherality and centrality for vertices and edges in networks, including the Mostar index which was recently introduced as a measure of peripherality for both edges and networks. We refute a…
We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most $r$ in a graph are called $r$-adjacent. The least number of colours…
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…
We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…
The more exact upper estimate of the percolation threshold for the {\it site problem} on the quadratic lattice ${\Bbb Z}^2$ have been found on the basis of the cluster decomposition. It is done by the number estimate of cycles on ${\Bbb…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
Centre-vortex surfaces are mapped out in four dimensions within the framework of SU(3) lattice gauge theory to understand the role of secondary loops that develop in three-dimensional visualisations of centre-vortex structure, appearing…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
We observed a phase transition-like behavior that is marked by the onset of the realization of the connectivity between two sites on a two-dimensional cross-section of a three-dimensional percolation cluster. This was found using…
Consider random sequential adsorption on a chequerboard lattice with arrivals at rate $1$ on light squares and at rate $\lambda$ on dark squares. Ultimately, each square is either occupied, or blocked by an occupied neighbour. Colour the…