Related papers: Statistical mechanics of frustrated assemblies and…
Numerical simulations and observations show that galaxies are not uniformly distributed. In cosmology, the largest known structures in the universe are galaxy filaments formed from the hierarchical clustering of galaxies due to…
Graph learning from data represents a canonical problem that has received substantial attention in the literature. However, insufficient work has been done in incorporating prior structural knowledge onto the learning of underlying…
Frustration is a ubiquitous phenomenon in many-body physics that influences the nature of the system in a profound way with exotic emergent behavior. Despite its long research history, the analytical or numerical investigations on…
A model for traffic flow in street networks or material flows in supply networks is presented, that takes into account the conservation of cars or materials and other significant features of traffic flows such as jam formation, spillovers,…
Probabilistic graphical models combine the graph theory and probability theory to give a multivariate statistical modeling. They provide a unified description of uncertainty using probability and complexity using the graphical model.…
Quantum systems with geometrical frustration remain an outstanding challenge for numerical simulations due to the infamous numerical sign problem. Here, we overcome this obstruction via complex path integration in a geometrically frustrated…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
We develop a novel method based in the sparse random graph to account the interplay between geometric frustration and disorder in cluster magnetism. Our theory allows to introduce the cluster network connectivity as a controllable…
We use computational modeling to investigate the assembly thermodynamics of a particle-based model for geometrically frustrated assembly, in which the local packing geometry of subunits is incompatible with uniform, strain-free large-scale…
Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…
We consider three popular model glassformers, the Kob-Andersen and Wahnstr\"om binary Lennard-Jones models and weakly polydisperse hard spheres. Although these systems exhibit a range of fragilities, all feature a rather similar behaviour…
A framework for studying the behavior of a classically frustrated signed network in the process of random rewiring is developed. We describe jump probabilities for change in frustration and formulate a theoretical estimate in terms of the…
We present results from numerical studies of supervised learning operations in recurrent networks considered as graphs, leading from a given set of input conditions to predetermined outputs. Graphs that have optimized their output for…
For many graph-related problems, it can be essential to have a set of structurally diverse graphs. For instance, such graphs can be used for testing graph algorithms or their neural approximations. However, to the best of our knowledge, the…
We investigate the full phase diagram of a column of grains near jamming, as a function of varying levels of frustration. Frustration is modelled by the effect of two opposing fields on a grain, due respectively to grains above and below…
A key goal of unsupervised learning is to go beyond density estimation and sample generation to reveal the structure inherent within observed data. Such structure can be expressed in the pattern of interactions between explanatory latent…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
We study the dynamics of network-coupled phase oscillators in the presence of coupling frustration. It was recently demonstrated that in heterogeneous network topologies, the presence of coupling frustration causes perfect phase…
The amount of data that is being gathered about cities is increasing in size and specificity. However, despite this wealth of information, we still have little understanding of what really drives the processes behind urbanisation. In this…
Artificially engineered light-matter systems constitute a novel, versatile architecture for the quantum simulation of driven, dissipative phase transitions and non-equilibrium quantum many-body systems. Here, we review recent experimental…