Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 98 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Kimi K2 210 tok/s Pro
2000 character limit reached

Network Robustness: Detecting Topological Quantum Phases (1408.1183v1)

Published 6 Aug 2014 in cond-mat.stat-mech and cond-mat.dis-nn

Abstract: Can the topology of a network that consists of many particles interacting with each other change in complexity when a phase transition occurs? The answer to this question is particularly interesting to understand the nature of phase transitions if the distinct phases do not break any symmetry, such as topological phase transitions. Here we present a novel theoretical framework established by complex network analysis for demonstrating that across a transition point of the topological superconductors, the network space experiences a homogeneous-heterogeneous transition invisible in real space. This transition is nothing but related to the robustness of a network to random failures. We suggest that the idea of the network robustness can be applied to characterizing various phase transitions whether or not the symmetry is broken.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)