Dynamical dimer correlations at bipartite and non-bipartite Rokhsar-Kivelson points

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Diffusion is one of the most important phenomena studied in science ranging from physics to biology and, in abstract form, even in social sciences. In the field of materials science, diffusion in crystalline solids is of particular interest as it plays a p ...

The high zinc and iron contents of electric arc furnace (EAF) dust in the forms of zinc ferrite (ZnFe2O4) and magnetite (Fe3O4) make it a valuable secondary source of these metals. ZnFe2O4 and Fe3O4 are known to form a solid solution at all compositions, a ...

We present a novel technique of neutron noise detection and experimental data interpretation developed during the EU H2020 project CORTEX aiming to improve the capabilities for identification and localization of neutron noise sources. The experimental data ...

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal e ...

We approach the graph generation problem from a spectral perspective by first generating the dominant parts of the graph Laplacian spectrum and then building a graph matching these eigenvalues and eigenvectors. Spectral conditioning allows for direct model ...

Graph neural networks take node features and graph structure as input to build representations for nodes and graphs. While there are a lot of focus on GNN models, understanding the impact of node features and graph structure to GNN performance has received ...

Although W. L. Bragg's law can be easily derived for beginners in the field of crystallography, its interpretation however seems to cause some difficulties which lies essentially in the relation between the concept of lattice planes and the unit cell const ...

We study the elliptic curves given by y(2) = x(3) + bx + t(3n+1) over global function fields of characteristic 3 ; in particular we perform an explicit computation of the L-function by relating it to the zeta function of a certain superelliptic curve u(3) ...

Polynomial neural networks (PNNs) have been recently shown to be particularly effective at image generation and face recognition, where high-frequency information is critical. Previous studies have revealed that neural networks demonstrate a spectral bias ...

Dynamical dimer correlations at bipartite and non-bipartite Rokhsar-Kivelson points

Chattez avec Graph Search

Atomic scale volume and grain boundary diffusion elucidated by in situ STEM

Enhanced Leaching of Zinc Ferrite by the Formation of a Solid Solution With Magnetite in Hydrochloric Acid Solution

Characterization of High Harmonic Frequencies in Reactor Noise Experiments Within the CORTEX Project

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Space-Efficient Representations of Graphs

Generalised Implicit Neural Representations

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks

An elementary treatment on the diffraction of crystalline structures

On the Mordell-Weil lattice of y(2) = x(3) + bx plus t(3n+1) in characteristic 3

The spectral bias of polynomial neural networks