Feedback topology and XOR-dynamics in Boolean networks with varying input structure

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.

We consider a class of parabolic stochastic PDEs on bounded domains D c Rd that includes the stochastic heat equation but with a fractional power gamma of the Laplacian. Viewing the solution as a process with values in a scale of fractional Sobolev spaces ...

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

We use numerical bootstrap techniques to study correlation functions of traceless sym-metric tensors of O(N) with two indices ti j. We obtain upper bounds on operator dimen-sions for all the relevant representations and several values of N. We discover sev ...

The adaptive social learning paradigm helps model how networked agents are able to form opinions on a state of nature and track its drifts in a changing environment. In this framework, the agents repeatedly update their beliefs based on private observation ...

Machine learning has paved the way for the real-time monitoring of complex infrastructure and industrial systems. However, purely data-driven methods have not been able to learn the underlying dynamics and generalize them to operating conditions that have ...

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories. Existing ...

In data-parallel optimization of machine learning models, workers collaborate to improve their estimates of the model: more accurate gradients allow them to use larger learning rates and optimize faster. In the decentralized setting, in which workers commu ...

Motivated by the experimental observation of a quantized 5/2 thermal conductance at filling nu = 5/2, a result incompatible with both the Pfaffian and the anti-Pfaffian states, we have pushed the expansion of the effective Hamiltonian of the 5/2-quantized ...

In this work, we develop a new framework for dynamic network flow pro-blems based on optimal transport theory. We show that the dynamic multicommodity minimum-cost network flow problem can be formulated as a multimarginal optimal transport problem, where t ...

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

Chattez avec Graph Search

Power variations in fractional Sobolev spaces for a class of parabolic stochastic PDEs

Equilibria in Network Constrained Energy Markets

Bootstrapping traceless symmetric O(N) scalars

Discovering Influencers in Opinion Formation Over Social Graphs

Graph neural networks for dynamic modeling of roller bearings

Better Trees for Santa Claus

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Beyond Spectral Gap: The Role of the Topology in Decentralized Learning

Possible restoration of particle-hole symmetry in the 5/2-quantized Hall state at small magnetic field

Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport