Related papers: Borromean Hypergraph Formation in Dense Random Rec…
Polymer rings in solution are either permanently entangled or not. Permanent topological restrictions give rise to additional entropic interactions apart from the ones arising due to mere chain flexibility or excluded volume. Conversely,…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
Hypergraphs, increasingly utilised to model complex and diverse relationships in modern networks, have gained significant attention for representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery…
We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
Network analysis was used to study the structure and time evolution of driven three-dimensional complex plasma clusters. The clusters were created by suspending micron-size particles in a glass box placed on top of the rf electrode in a…
Entanglement in high-dimensional quantum systems, where one or more degrees of freedom of light are involved, offers increased information capacities and enables new quantum protocols. Here, we demonstrate a functional source of…
Hypergraphs provide a natural representation for many-to-many relationships in data-intensive applications, yet their scalability is often hindered by high memory consumption. While prior work has improved computational efficiency, reducing…
Let integer $n \ge 3$ and integer $r = r(n) \ge 3$. Define the binomial random $r$-uniform hypergraph $H_r(n, p)$ to be the $r$-uniform graph on the vertex set $[n]$ such that each $r$-set is an edge independently with probability $p$. A…
Motivated by the bootstrap percolation process for graphs, we define a new, high-order generalisation to $k$-uniform hypergraphs, in which we infect $j$-sets of vertices for some integer $1\le j \le k-1$. We investigate the smallest…
Hypergraphs are powerful mathematical structures that can model complex, high-order relationships in various domains, including social networks, bioinformatics, and recommender systems. However, generating realistic and diverse hypergraphs…
We present an extension to the iterative Boltzmann inversion method to generate coarse-grained models with three-body intramolecular potentials that can reproduce correlations in structural distribution functions. The coarse-grained…
In this thesis the formation and properties of a polymer gel on and at a surface are investigated. The gel under investigation is defined as a three-dimensional network of "phantom" macromolecules that form permanent links with one another…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
Using the theory of elasticity of polymer gels we show that large-scale cross-link density patterns written into the structure of the network in the melt state, can be revealed upon swelling by monitoring the monomer density patterns. We…
In \cite{Sz17-2} we considered hyperball packings in $3$-dimensional hyperbolic space. We developed a decomposition algorithm that for each saturated hyperball packing provides a decomposition of $\HYP$ into truncated tetrahedra. In order…
We discuss the behaviour of holographic entanglement entropy following a local quench in 2+1 dimensional strongly coupled CFTs. The entanglement generated by the quench propagates along an emergent light-cone, reminiscent of the…
The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined…
The volume density of a hyperbolic link is defined as the ratio of hyperbolic volume to crossing number. We study its properties and a closely-related invariant called the determinant density. It is known that the sets of volume densities…