相关论文: Borromean Hypergraph Formation in Dense Random Rec…

Geometric constraints impact the formation of a broad range of spatial networks, from amino acid chains folding to proteins structures to rearranging particle aggregates. How the network of interactions dynamically self-organizes in such…

We study a general class of percolation models in Euclidean space including long-range percolation, scale-free percolation, the weight-dependent random connection model and several other previously investigated models. Our focus is on the…

Binding of particles through weak (non-covalent) interactions plays a central role in multiple modern disciplines, from Cooper pairing of electrons in superconductivity to formation of supramolecules in biochemistry. Optical solitons, which…

A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…

We propose a network for semantic mapping called the Dense Dilated Convolutions Merging Network (DDCM-Net) to provide a deep learning approach that can recognize multi-scale and complex shaped objects with similar color and textures, such…

Polymer melts undergoing large deformation by uniaxial elongation are studied by molecular dynamics simulations of bead-spring chains in melts. Applying a primitive path analysis to strongly deformed polymer melts, the role of topological…

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…

Ring polymers are characterized by topology-specific entanglements called threadings. In the limit of large rings, it is conjectured that a "topological glass" should emerge due to the proliferation of threadings. In this study, we used…

We demonstrate formation of hierarchical structures in two-dimensional systems with multiple length scales in the inter-particle interaction. These include states such as clusters of clusters, concentric rings, clusters inside a ring, and…

In the right conditions, removing one particle from a multipartite bound state can make it fall apart. This feature, known as the "Borromean property", has been recently demonstrated experimentally in Efimov states. One could expect that…

We describe a new family of $k$-uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of minimum degree $2$, even when the edge density (number of edges…

Optical links and knots have attracted growing attention owing to their exotic topologic features and promising applications in next-generation information transfer and storage. However, current protocols for optical topology realization…

We study bond percolation of $N$ non-interacting Gaussian polymers of $\ell$ segments on a 2D square lattice of size $L$ with reflecting boundaries. Through simulations, we find the fraction of configurations displaying {\em no} connected…

We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…

An elegant bootstrap percolation result on the hyperrectangle graph was proved by Balogh, Bollob\'as, Morris, and Riordan using a linear algebric method in 2012. This paper studies the same problem by purely combinatorial means. The base…

We study the effect of assortative and disassortative mixing on the robustness of networks under random node failures. For ordinary (dyadic) networks, by using the generating function technique and stochastic simulations, we show that the…

We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…

Edge states protected by bulk topology of photonic crystals show robustness against short-range disorder, making robust information transfer possible. Here, topological photonic crystals under long-range deformations are investigated.…