Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDetecting phase transitions in collective behavior using manifolds curvature
60
0
0.0
(
0
)
Added by
Kelum Gajamannage
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
If a given behavior of a multi-agent system restricts the phase variable to a invariant manifold, then we define a phase transition as change of physical characteristics such as speed, coordination, and structure. We define such a phase transition as splitting an underlying manifold into two sub-manifolds with distinct dimensionalities around the singularity where the phase transition physically exists. Here, we propose a method of detecting phase transitions and splitting the manifold into phase transitions free sub-manifolds. Therein, we utilize a relationship between curvature and singular value ratio of points sampled in a curve, and then extend the assertion into higher-dimensions using the shape operator. Then we attest that the same phase transition can also be approximated by singular value ratios computed locally over the data in a neighborhood on the manifold. We validate the phase transitions detection method using one particle simulation and three real world examples.
rate research
Read More
While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the mapping from the original high-dimensional space to the embedding space. Here, we propose an alternative approach that demands a two-dimensional embedding which topologically summarizes the high-dimensional data. In this sense, our approach is closely related to the construction of one-dimensional principal curves that minimize orthogonal error to data points subject to smoothness constraints. Specifically, we construct a two-dimensional principal manifold directly in the high-dimensional space using cubic smoothing splines, and define the embedding coordinates in terms of geodesic distances. Thus, the mapping from the high-dimensional data to the manifold is defined in terms of local coordinates. Through representative examples, we show that compared to existing nonlinear dimensionality reduction methods, the principal manifold retains the original structure even in noisy and sparse datasets. The principal manifold finding algorithm is applied to configurations obtained from a dynamical system of multiple agents simulating a complex maneuver called predator mobbing, and the resulting two-dimensional embedding is compared with that of a well-established nonlinear dimensionality reduction method.
Periodical equilibrium states of magnetization exist in chiral ferromagnetic films, if the constant of antisymmetric exchange (Dzyaloshinskii-Moriya interaction) exceeds some critical value. Here, we demonstrate that this critical value can be significantly modified in curved film. The competition between symmetric and antisymmetric exchange interactions in a curved film can lead to a new type of domain wall which is inclined with respect to the cylinder axis. The wall structure is intermediate between Bloch and Neel ones. The exact analytical solutions for phase boundary curves and the new domain wall are obtained.
Collective neutrino oscillations can potentially play an important role in transporting lepton flavor in astrophysical scenarios where the neutrino density is large, typical examples are the early universe and supernova explosions. It has been argued in the past that simple models of the neutrino Hamiltonian designed to describe forward scattering can support substantial flavor evolution on very short time scales $tapproxlog(N)/(G_Frho_ u)$, with $N$ the number of neutrinos, $G_F$ the Fermi constant and $rho_ u$ the neutrino density. This finding is in tension with results for similar but exactly solvable models for which $tapproxsqrt{N}/(G_Frho_ u)$ instead. In this work we provide a coherent explanation of this tension in terms of Dynamical Phase Transitions (DPT) and study the possible impact that a DPT could have in more realistic models of neutrino oscillations and their mean-field approximation.
Let $phi:Xto mathbb R$ be a continuous potential associated with a symbolic dynamical system $T:Xto X$ over a finite alphabet. Introducing a parameter $beta>0$ (interpreted as the inverse temperature) we study the regularity of the pressure function $betamapsto P_{rm top}(betaphi)$ on an interval $[alpha,infty)$ with $alpha>0$. We say that $phi$ has a phase transition at $beta_0$ if the pressure function $P_{rm top}(betaphi)$ is not differentiable at $beta_0$. This is equivalent to the condition that the potential $beta_0phi$ has two (ergodic) equilibrium states with distinct entropies. For any $alpha>0$ and any increasing sequence of real numbers $(beta_n)$ contained in $[alpha,infty)$, we construct a potential $phi$ whose phase transitions in $[alpha,infty)$ occur precisely at the $beta_n$s. In particular, we obtain a potential which has a countably infinite set of phase transitions.
Different types of malicious activities have been flagged in multiple permissionless blockchains such as bitcoin, Ethereum etc. While some malicious activities exploit vulnerabilities in the infrastructure of the blockchain, some target its users through social engineering techniques. To address these problems, we aim at automatically flagging blockchain accounts that originate such malicious exploitation of accounts of other participants. To that end, we identify a robust supervised machine learning (ML) algorithm that is resistant to any bias induced by an over representation of certain malicious activity in the available dataset, as well as is robust against adversarial attacks. We find that most of the malicious activities reported thus far, for example, in Ethereum blockchain ecosystem, behaves statistically similar. Further, the previously used ML algorithms for identifying malicious accounts show bias towards a particular malicious activity which is over-represented. In the sequel, we identify that Neural Networks (NN) holds up the best in the face of such bias inducing dataset at the same time being robust against certain adversarial attacks.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
