Concept

Trivial topology

Related publications (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Co-Design Optimisation of Morphing Topology and Control of Winged Drones

Dario Floreano, Valentin Wüest, Fabio Bergonti

The design and control of winged aircraft and drones is an iterative process aimed at identifying a compromise of mission-specific costs and constraints. When agility is required, shape-shifting (morphing) drones represent an efficient solution. However, m ...

2024

Type-I antiferromagnetic Weyl semimetal InMnTi2

Nicola Marzari, Davide Grassano, Luca Binci

Topological materials have been a main focus of studies in the past decade due to their protected properties that can be exploited for the fabrication of new devices. Among them, Weyl semimetals are a class of topological semimetals with nontrivial linear ...

College Pk2024

Seeding and Emergence of Composite Skyrmions in a van der Waals Magnet

Klaus Kern, Marko Burghard, Lukas Powalla

Topological charge plays a significant role in a range of physical systems. In particular, observations of real-space topological objects in magnetic materials have been largely limited to skyrmions - states with a unitary topological charge. Recently, mor ...

WILEY-V C H VERLAG GMBH2023

Real space and reciprocal space investigations of the spin dynamics in skyrmion-hosting materials

Le Yu

Magnetic skyrmions are whirl-like spin configurations with particle-like properties protected by non-trivial topology. Due to their unique spin structures and dynamical properties, they have attracted tremendous interests over the past decade, from fundame ...

EPFL2022

Atomic subgraphs and the statistical mechanics of networks

Sofia Charlotta Olhede

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 for the generation of graphs with extens ...

2021

Stability of time-sensitive networks: strategies for partial regulation

Nicolò Dal Fabbro

In time-sensitive networks, regulators can be used to reshape traffic, and their usage may be necessary to guarantee stability by providing worst-case delay bounds. In this project, I study partial regulation of time-sensitive networks with cyclic dependen ...

2020

Graph Learning Under Partial Observability

Ali H. Sayed, Augusto José Rabelo Almeida Santos

Many optimization, inference, and learning tasks can be accomplished efficiently by means of decentralized processing algorithms where the network topology (i.e., the graph) plays a critical role in enabling the interactions among neighboring nodes. There ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Magnetoresistance from Fermi surface topology

Oleg Yazyev, Quansheng Wu, Shengnan Zhang

Extremely large nonsaturating magnetoresistance has recently been reported for a large number of both topologically trivial and nontrivial materials. Different mechanisms have been proposed to explain the observed magnetotransport properties, yet without a ...

2019

Dynamic Clustering and Control for Large Scale Urban Networks

Mohammadreza Saeedmanesh

Traffic congestion is a significant issue in all urban areas with concentration of activities for various city topologies and distribution of population and land use around the world. Developing realistic models that are able to replicate congestion spread ...

EPFL2018

Multidimensional Persistence and Noise

Martina Scolamiero

In this paper, we study multidimensional persistence modules (Carlsson and Zomorodian in Discrete Comput Geom 42(1):71-93, 2009; Lesnick in Found Comput Math 15(3):613-650, 2015) via what we call tame functors and noise systems. A noise system leads to a p ...

Springer2017