Related papers: Graph similarity drives zeolite diffusionless tran…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
A graph is a powerful concept for representation of relations between pairs of entities. Data with underlying graph structure can be found across many disciplines and there is a natural desire for understanding such data better. Deep…
The first goal of this article is to study the validity of the Zwanzig model for liquid crystals to predict transitions to inhomogeneous phases (like smectic and columnar) and the way polydispersity affects these transitions. The second…
Modelling rock-fluid interaction requires solving a set of partial differential equations (PDEs) to predict the flow behaviour and the reactions of the fluid with the rock on the interfaces. Conventional high-fidelity numerical models…
Zeolites, as representative porous materials, possess intricate three-dimensional frameworks that endow them with high surface areas and remarkable catalytic properties. There are a few factors that give a huge influence on the catalytic…
Graph diffusion models have emerged as state-of-the-art techniques in graph generation; yet, integrating domain knowledge into these models remains challenging. Domain knowledge is particularly important in real-world scenarios, where…
The discovery of inorganic crystal structures with targeted properties is a significant challenge in materials science. Generative models, especially state-of-the-art diffusion models, offer the promise of modeling complex data…
We constructed a simple but effective model to predict the layered intergrowth structures by combining the self-assembly phenomenon in confined space and the sandwich configuration of layered materials. In this model, a two-dimensional…
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
Multiplex graphs, characterised by their layered structure, exhibit informative interdependencies within layers that are crucial for understanding complex network dynamics. Quantifying the interaction and shared information among these…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
Much of our understanding of complex structures is based on simplification: for example, metal-organic frameworks are often discussed in the context of "nodes" and "linkers", allowing for a qualitative comparison with simpler inorganic…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
We use a combined phase-field/lattice-Boltzmann scheme [D. Medvedev, K. Kassner, Phys. Rev. E {\bf 72}, 056703 (2005)] to simulate non-facetted crystal growth from an undercooled melt in external flows. Selected growth parameters are…
Graph generation has emerged as a critical task in fields ranging from drug discovery to circuit design. Contemporary approaches, notably diffusion and flow-based models, have achieved solid graph generative performance through constructing…
Modeling the spontaneous evolution of morphology in natural systems and its preservation by proportionate growth remains a major scientific challenge. Yet, it is conceivable that if the basic mechanisms of growth and the coupled kinetic…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
Transition graphs capture the memory and sequential response of multistable media, by specifying their evolution under external driving. Microscopically, collections of bistable elements, or hysterons, provide a powerful model for these…
Data with geometric structure is ubiquitous in machine learning often arising from fundamental symmetries in a domain, such as permutation-invariance in graphs and translation-invariance in images. Group-convolutional architectures, which…