Related papers: Borromean Hypergraph Formation in Dense Random Rec…
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
Different methods for creating Olympic gels are analyzed using computer simulations. First ideal reference samples are obtained from freely interpenetrating semi-dilute solutions and melts of cyclic polymers. The distribution of pairwise…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
We study bootstrap percolation (BP) on hyperbolic lattices obtained by regular tilings of the hyperbolic plane. Our work is motivated by the connection between the BP transition and the dynamical transition of kinetically constrained…
In this paper, we study the order of the largest connected component of a random graph having two sources of randomness: first, the graph is chosen randomly from all graphs with a given degree sequence, and then bond percolation is applied.…
In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…
Many biological tissues feature a heterogeneous network of fibers whose tensile and bending rigidity contribute substantially to these tissues' elastic properties. Rigidity percolation has emerged as a important paradigm for relating these…
In composite materials composed of soft polymer matrix and stiff, high-aspect-ratio particles, the composite undergoes a transition in mechanical strength when the inclusion phase surpasses a critical density. This phenomenon (rheological…
Link/knot invariants are series with integer coefficients, and it is a long-standing problem to get them positive and possessing cohomological interpretation. Constructing positive "superpolynomials" is not straightforward, especially for…
We study homotopy groups of spaces of long links in Euclidean space of codimension at least three. With multiple components, they admit split injections from homotopy groups of spheres. We show that, up to knotting, these account for all…
We perform large scale three-dimensional molecular dynamics simulations of unlinked and unknotted ring polymers diffusing through a background gel, here a three-dimensional cubic lattice. Taking advantage of this architecture, we propose a…
Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that arise in a range of domains, such as social network analysis, word-document clustering, the science of science,…
Percolation phenomena of homopolymer brushes on a planar substrate are simulated using the molecular Monte Carlo method in 3 dimensions. The grafted polymers are isolated from each other at extremely low grafting density, whereas a…
In this paper we present a classical construction of the Hyperbolic structure of the complement of a link in the sense of Thurston for the particular case of the Borromean rings link. As this is nothing new, the aim of this paper is to…
In this study, we present a method of pattern mining based on network theory that enables the identification of protein structures or complexes from synthetic volume densities, without the knowledge of predefined templates or human biases…
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…
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here,…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…