相关论文: Borromean Hypergraph Formation in Dense Random Rec…
The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly-connected ``links'' and multiply-connected ``blobs.'' Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block…
Hyperentanglement, defined as the entanglement in several degrees of freedom (DOFs) of a quantum system, has attracted much attention recently. Here we investigate the possibility of concentrating the two-photon four-qubit systems in…
In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…
The last decades witnessed the emergence of the field of correlated disordered media, a great challenge offering a large panel of new perspectives for applications in theoretical modelling and material fabrication. The efficient design of…
Simulating percolation and critical phenomena of labelled species inside films composed of single-component linear homogeneous macromolecules using molecular Monte Carlo method in 3 dimensions, we study dependence of these conducting…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
We study the magneto-elastic coupling behavior of paramagnetic chains in soft polymer gels exposed to external magnetic fields. To this end, a laser scanning confocal microscope is used to observe the morphology of the paramagnetic chains…
We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…
Three disjoint rays in euclidean 3-space form Borromean rays provided their union is knotted, but the union of any two components is unknotted. We construct infinitely many Borromean rays, uncountably many of which are pairwise…
We describe some problems, observations, and conjectures concerning thickness and packing density of knots and links in $\sp^3$ and $\R^3$. We prove the thickness of a nontrivial knot or link in $\sp^3$ is no more than $\frac{\pi}{4}$, the…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
Polymer architecture plays critical roles in both bulk rheological properties and microscale macromolecular dynamics in entangled polymer solutions and composites. Ring polymers, in particular, have been the topic of much debate due to the…
Connectedness percolation phenomena in the two-dimensional (2D) packing of binary mixtures of disks with different diameters were studied numerically. The packings were produced using random sequential adsorption (RSA) model with…
Recent 2D-to-3D human pose estimation works tend to utilize the graph structure formed by the topology of the human skeleton. However, we argue that this skeletal topology is too sparse to reflect the body structure and suffer from serious…
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…
We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as \emph{online sprinkling}. As an illustrative application of this method, we show that for any fixed integer $k\geq 3$, the binomial…
DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on…
Geometric and structural constraints greatly restrict the selection of folds adapted by protein backbones, and yet, folded proteins show an astounding diversity in functionality. For structure to have any bearing on function, it is thus…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
We study one-loop bulk entanglement entropy in even spacetime dimensions using the heat kernel method, which captures the universal piece of entanglement entropy, a logarithmically divergent term in even dimensions. In four dimensions, we…