text large_stringlengths 7 3.02k |
|---|
To characterize the dynamical features of seismicity as a complex phenomenon, the seismic data is mapped to a growing random graph, which is a small-world scale-free network. Here, hierarchical and mixing properties of such a network are studied. |
Super-cooled liquids are characterized by their fragility: the slowing down of the dynamics under cooling is more sudden and the jump of specific heat at the glass transition is generally larger in fragile liquids than in strong ones. Despite the importance of this quantity in classifying liquids, explaining what aspe... |
We studied the single-particle Anderson localization problem for non-Hermitian systems on directed graphs. Random regular graph and various undirected standard random graph models were modified by controlling reciprocity and hopping asymmetry parameters. |
We consider statistical-mechanical models for spin systems built on hierarchical structures, which provide a simple example of non-mean-field framework. We show that the coupling decay with spin distance can give rise to peculiar features and phase diagrams much richer that their mean-field counterpart. |
In this Letter we study numerically the Anderson model on partially disordered random regular graphs (RRG) considered as the toy model for a Hilbert space of interacting disordered many-body system. The protected subsector of zero-energy states in a many-body system corresponds to clean nodes in RRG ensemble. |
We develop an instanton approach to the non-equilibrium dynamics in one-dimensional random environments. The long time behavior is controlled by rare fluctuations of the disorder potential and, accordingly, by the tail of the distribution function for the time a particle needs to propagate along the system (the delay ... |
We use confocal microscopy to study the motions of particles in concentrated colloidal systems. Near the glass transition, diffusive motion is inhibited, as particles spend time trapped in transient ``cages'' formed by neighboring particles. |
We investigate theoretically the slow non-exponential relaxation dynamics of the electron glass out of equilibrium, where a sudden change in carrier density reveals interesting memory effects. The self-consistent model of the dynamics of the occupation numbers in the system successfully recovers the general behavior f... |
The dynamics of non-equilibrium Ising model with parallel updates is investigated using a generalized mean field approximation that incorporates multiple two-site correlations at any two time steps, which can be obtained recursively. The proposed method shows significant improvement in predicting local system properti... |
The dielectric constant of amorphous solids at low temperatures is governed by the dynamics of tunneling systems, small groups of atoms which tunnel between quasi equivalent potential minima. Recent experiments showed that at temperatures below 20 mK various glasses exhibit memory for a previously applied electric bia... |
We study two models having an infinite-disorder critical point --- the zero temperature random transverse-field Ising model and the random contact process --- on a star-like network composed of $M$ semi-infinite chains connected to a common central site. By the strong disorder renormalization group method, the scaling... |
We have determined the magnetoresistance of RuO_2-based resistors (Scientific Instruments RO-600) between 0.05 K and 0.3 K in magnetic fields up to 8 T. The magnetoresistance is negative around 0.5 T and then becomes positive at larger fields. The magnitude of the negative magnetoresistance increases rapidly as the te... |
We apply a general theory describing the dynamics of supervised learning in layered neural networks in the regime where the size p of the training set is proportional to the number of inputs N, as developed in a previous paper, to several choices of learning rules. In the case of (on-line and batch) Hebbian learning, ... |
We study in Ising spin glasses the finite-size effects near the spin-glass transition in zero field and at the de Almeida-Thouless transition in a field by Monte Carlo methods and by analytical approximations. In zero field, the finite-size scaling function associated with the spin-glass susceptibility of the Sherring... |
Nonlinear effects are omnipresent in thin films of ion conducting materials showing up as a significant increase of the conductivity. For a disordered hopping model general physical mechanisms are identified giving rise to the occurrence of positive or negative nonlinear effects, respectively. |
We study the statistical features of magnetic noise accompanying the dynamic fracture of steel samples during mixed type fracture, where the overall ductile character of crack propagation is interrupted by a sudden brittle jump. The structure of the voltage time series is investigated by identifying discrete peaks whi... |
A machine learning technique to obtain the ground states of quantum few-body systems using artificial neural networks is developed. Bosons in continuous space are considered and a neural network is optimized in such a way that when particle positions are input into the network, the ground-state wave function is output... |
In ref. <a href="https://arxiv.org/abs/cond-mat/0005372" data-arxiv-id="cond-mat/0005372" class="link-https">cond-mat/0005372</a>, Sastry studies by numerical simulations the phase diagram of a simple fragile glass-forming liquid, presenting very interesting and clear results. |
We investigate the two-dimensional four-color Ashkin-Teller model by means of large-scale Monte-Carlo simulations. We demonstrate that the first-order phase transition of the clean system is destroyed by random disorder introduced via site dilution. |
We report results of molecular dynamics simulations of liquid water at the temperature T=277 K for a range of high pressure. One aim of the study was to test the model Amoeba potential for description of equilibrium structural properties and dynamical processes in liquid water. |
A quantum particle propagates subdiffusively on a strongly disordered chain when it is coupled to itinerant hard-core bosons. We establish a generalized Einstein relation (GER) that relates such subdiffusive spread to an unusual time-dependent drift velocity, which appears as a consequence of a constant electric field... |
Locality imposes stringent constraints on the spreading of information in nonrelativistic quantum systems, which is reminiscent of a "light-cone," a casual structure arising in their relativistic counterparts. Long-range interactions can potentially soften such constraints, allowing almost instantaneous long j... |
Directed complex network of two-state model neurons linked by synapses which can be blocked or activated stochastically in time undergoes phase transition between the quiescent phase with zero activity and the active one with persistent activity. Avalanches of activity appear in the quiescent phase after occasional ex... |
Motivated by the many-body localization (MBL) phase in generic interacting disordered quantum systems, we develop a model simulating the same eigenstate structure like in MBL, but in the random-matrix setting. Demonstrating the absence of energy level repulsion (Poisson statistics), this model carries non-ergodic eige... |
In this paper, we study the thermodynamic properties of a system of $D$-components classical Heisenberg spins lying on the vertices of a random regular graph, with an unconventional first neighbor non-random interaction $J(\mathbf{S}_i\cdot \mathbf{S}_k)^2$. We can consider this model as a continuum version of anti-fe... |
Using the techniques of Neural Networks (NN), we study the three-dimensional (3D) 5-state ferromagnetic Potts model on the cubic lattice as well as the two-dimensional (2D) 3-state antiferromagnetic Potts model on the square lattice. Unlike the conventional approach, here we follow the idea employed in Ann. |
A central theoretical issue at the core of the current research on many-body localization (MBL) consists in characterizing the statistics of rare long-range resonances in many-body eigenstates. This is of paramount importance to understand: |
We show that a system with competing interactions on different length scales, as relevant for the formation of stripes in doped Mott insulators, undergoes a self-generated glass transition which is caused by the frustrated nature of the interactions and not related to the presence of quenched disorder. An exponentiall... |
We calculate the short-range contributions $C^{(1)}$ and $C^{(10)}$ to the angular intensity correlation function for the scattering of s-polarized light from a one-dimensional random interface between two dielectric media. The calculations are carried out on the basis of a new approach that separates out explicitly t... |
Local integrals of motion play a central role in the understanding of many-body localization in many-body quantum systems in one dimension subject to a random external potential, but the question of how these local integrals of motion change in a deterministic quasiperiodic potential is one that has received significan... |
Random linear systems over the Galois Field modulo 2 have an interest in connection with problems ranging from computational optimization to complex networks. They are often approached using random matrices with Poisson-distributed or finite column/row-sums. |
Approximating marginals of a graphical model is one of the fundamental problems in the theory of networks. In a recent paper a method was shown to construct a variational free energy such that the linear response estimates, and maximum entropy estimates (for beliefs) are in agreement, with implications for direct and ... |
The Brillouin zone of the clean Weyl semimetal contains points at which the density of states (DoS) vanishes. Previous work suggested that below a certain critical concentration of impurities this features is preserved including in the presence of disorder. |
We study kinetics of electrons, scattered by heavy particles undergoing slow diffusive motion. In a three-dimensional space we claim the existence of the crossover region (on the energy axis), which separates the states with fast diffusion and the states with slow diffusion; the latter is determined by the dephasing t... |
We present analytical results for the distribution of first hitting times of random walks (RWs) on random regular graphs (RRGs) of degree $c \ge 3$ and a finite size $N$. Starting from a random initial node at time $t=1$, at each time step $t \ge 2$ an RW hops randomly into one of the $c$ neighbors of its previous nod... |
Glasses are amorphous solids whose constituent particles are caged by their neighbors and thus cannot flow. This sluggishness is often ascribed to the free energy landscape containing multiple minima (basins) separated by high barriers. |
Variable-range hopping conductivity has long been understood in terms of a canonical prescription for relating the single-particle density of states to the temperature-dependent conductivity. Here we demonstrate that this prescription breaks down in situations where a large and long-ranged random potential develops. |
Generative models show great promise for the inverse design of molecules and inorganic crystals, but remain largely ineffective within more complex structures such as amorphous materials. Here, we present a diffusion model that reliably generates amorphous structures up to 1000 times faster than conventional simulatio... |
The stability of the TAP mean field equations is reanalyzed with the conclusion that the exclusive reason for the breakdown at the spin glass instability is an inconsistency for the value of the local susceptibility. A new alternative approach leads to modified equations which are in complete agreement with the origin... |
We discuss the spin excitations in systems with hopping electron conduction and strong position disorder. We focus on the problem in a strong magnetic field when the spin Hamiltonian can be reduced to the effective single-particle Hamiltonian and treated with conventional numerical technics. |
Systems undergoing an equilibrium phase transition from a liquid state to an amorphous solid state exhibit certain universal characteristics. Chief among these are the fraction of particles that are randomly localized and the scaling functions that describe the order parameter and (equivalently) the statistical distri... |
Different weighted scale-free networks show weights-topology correlations indicated by the non linear scaling of the node strength with node connectivity. In this paper we show that networks with and without weight-topology correlations can emerge from the same simple growth dynamics of the node connectivities and of ... |
We consider the stochastic dynamics near zero-temperature of the random ferromagnetic Ising model on a Cayley tree of branching ratio $K$. We apply the Boundary Real Space Renormalization procedure introduced in our previous work (C. |
Low temperature scanning tunneling spectroscopy of HfNiSn shows a V^m(m < 1) zero bias anomaly around the Fermi level. This local density of states with a fractional power law shape is well known to be a consequence of electronic correlations. |
Deep learning methods relying on multi-layered networks have been actively studied in a wide range of fields in recent years, and deep Boltzmann machines(DBMs) is one of them. In this study, a model of DBMs with some properites of weight parameters obtained by learning is studied theoretically by a statistical-mechani... |
We show that the distribution of the time delay for one-dimensional random potentials is universal in the high energy or weak disorder limit. Our analytical results are in excellent agreement with extensive numerical simulations carried out on samples whose sizes are large compared to the localisation length (localise... |
The presence of frozen uncorrelated random on-site potential in interacting quantum systems can induce a transition from an ergodic phase to a localized one, the so-called many-body localization. Here we numerically study the effects of auto-correlated disorder on the static and dynamical properties of a one-dimension... |
We examine numerically the time-dependent properties of nonlinear bistable multilayer structures for constant wave illumination. We find that our system exhibits both steady-state and self-pulsing solutions. |
We consider eager-push epidemic dissemination in a complete graph. Time is divided into synchronous stages. |
The numba-mpi package offers access to the Message Passing Interface (MPI) routines from Python code that uses the Numba just-in-time (JIT) compiler. As a result, high-performance and multi-threaded Python code may utilize MPI communication facilities without leaving the JIT-compiled code blocks, which is not possible... |
The licas (lightweight Internet-based communication for autonomic services) system is a Java-based open source framework for building service-based networks, similar to what you would use a Cloud or SOA platform for. The framework comes with a server for running the services on, mechanisms for adding services to the s... |
Modern educational institutions widely used virtual laboratories and cloud technologies. In practice must deal with security, processing speed and other tasks. |
Distributed Stream Processing (DSP) engines analyze continuous data via queries expressed as a graph of operators. Auto-scalers adjust the number of parallel instances of these operators to support a target rate. |
Matrix factorization (MF) discovers latent features from observations, which has shown great promises in the fields of collaborative filtering, data compression, feature extraction, word embedding, etc. While many problem-specific optimization techniques have been proposed, alternating least square (ALS) remains popul... |
Scientific problems that depend on processing large amounts of data require overcoming challenges in multiple areas: managing large-scale data distribution, controlling co-placement and scheduling of data with compute resources, and storing, transferring, and managing large volumes of data. Although there exist multip... |
In this paper we give a robust logical and computational characterisation of peer-to-peer database systems. We first define a pre- cise model-theoretic semantics of a peer-to-peer system, which allows for local inconsistency handling. |
Big Data applications suffer from unpredictable and unacceptably high pause times due to Garbage Collection (GC). This is the case in latency-sensitive applications such as on-line credit-card fraud detection, graph-based computing for analysis on social networks, etc. |
Contextual bandit algorithms are commonly used in recommender systems, where content popularity can change rapidly. These algorithms continuously learn latent mappings between users and items, based on contexts associated with them both. |
Nowadays, a computing cluster in a typical data center can easily consist of hundreds of thousands of commodity servers, making component/ machine failures the norm rather than exception. A parallel processing job can be delayed substantially as long as one of its many tasks is being assigned to a failing machine. |
Grid computing infrastructures need to provide traceability and accounting of their users" activity and protection against misuse and privilege escalation. A central aspect of multi-user Grid job environments is the necessary delegation of privileges in the course of a job submission. |
We consider robust resource allocation of services in Clouds. More specifically, we consider the case of a large public or private Cloud platform that runs a relatively small set of large and independent services. |
We consider the problem of distributed statistical machine learning in adversarial settings, where some unknown and time-varying subset of working machines may be compromised and behave arbitrarily to prevent an accurate model from being learned. This setting captures the potential adversarial attacks faced by Federat... |
Data processing on convolutional neural networks (CNNs) places a heavy burden on energy-constrained mobile platforms. This work optimizes energy on a mobile client by partitioning CNN computations between in situ processing on the client and offloaded computations in the cloud. |
Edge computing has been getting a momentum with ever-increasing data at the edge of the network. In particular, huge amounts of video data and their real-time processing requirements have been increasingly hindering the traditional cloud computing approach due to high bandwidth consumption and high latency. |
We study the inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-known replication approach. |
Grid computing has emerged as an effective means of facilitating the sharing of distributed heterogeneous resources, enabling collaboration in large scale environments. However, the nature of Grid systems, coupled with the overabundance and fragmentation of information, makes it difficult to monitor resources, service... |
Emerging hybrid memory systems that comprise technologies such as Intel's Optane DC Persistent Memory, exhibit disparities in the access speeds and capacity ratios of their heterogeneous memory components. This breaks many assumptions and heuristics designed for traditional DRAM-only platforms. |
Message Passing Interface (MPI) plays a crucial role in distributed memory parallelization across multiple nodes. However, parallelizing MPI code manually, and specifically, performing domain decomposition, is a challenging, error-prone task. |
Routing in Wireless Sensor Network (WSN) aims to interconnect sensor nodes via single or multi-hop paths. The routes are established to forward data packets from sensor nodes to the sink. |
To efficiently scale large model (LM) training, researchers transition from data parallelism (DP) to hybrid parallelism (HP) on GPU clusters, which frequently experience hardware and software failures. Existing works introduce in-memory checkpointing optimizations that snapshot parameters to device memory for rapid fa... |
Blockchain, like any other complex technology, needs a strong testing methodology to support its evolution in both research and development contexts. Setting up meaningful tests for permissionless blockchain technology is a notoriously complex task for several reasons: software is complex, large number of nodes are in... |
We study expansion and information diffusion in dynamic networks, that is in networks in which nodes and edges are continuously created and destroyed. We consider information diffusion by {\em flooding}, the process by which, once a node is informed, it broadcasts its information to all its neighbors. |
The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas critical sections belonging to different sessions must be execut... |
This article aims to describe and explain the theoretical foundations of concurrent and set concurrent algorithms, considering an asynchronous shared memory system where any number of processes can crash. Verification of concurrent algorithms is often described in terms of their progress condition, which guarantees th... |
We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with $n$ vertices and $h$ holes, we require the agents to collaboratively explore and position themselves in such a way that every point in the polygon i... |
The introduction of cloud computing has provided opportunities for small businesses to implement enterprise systems (ES) in their organizations and thereby improve their business processes. While there have been many studies focusing on ES implementation among medium-large sized firms, the factors that influence the i... |
We present an analytical framework for gossip protocols based on the pairwise information exchange between interacting nodes. This framework allows for studying the impact of protocol parameters on the performance of the protocol. |
Persistence of updates to remote byte-addressable persistent memory (PM), using RDMA operations (RDMA updates), is a poorly understood subject. Visibility of RDMA updates on the remote server is not the same as persistence of those updates. |
Simulation especially real-time simulation have been widely used for the design and testing of real-time systems. The advancement of simulation tools has largely attributed to the evolution of computing technologies. |
This paper presents a randomized Las Vegas distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in $\tilde{O}(D + \sqrt{n})$ time and exchanges $\tilde{O}(m)$ messages (both with high proba... |
Enumerating simple cycles has important applications in computational biology, network science, and financial crime analysis. In this work, we focus on parallelising the state-of-the-art simple cycle enumeration algorithms by Johnson and Read-Tarjan along with their applications to temporal graphs. |
Failure detection protocols---a fundamental building block for crafting fault-tolerant distributed systems---are in many cases described by their authors making use of informal pseudo-codes of their conception. Often these pseudo-codes use syntactical constructs that are not available in COTS programming languages suc... |
Splitting the inference model between device, edge server, and cloud can improve the performance of EI greatly. Additionally, the non-orthogonal multiple access (NOMA), which is the key supporting technologies of B5G/6G, can achieve massive connections and high spectrum efficiency. |
Pipeline is a fundamental parallel programming pattern. Mainstream pipeline programming frameworks count on data abstractions to perform pipeline scheduling. |
With the emergence of distributed data, training machine learning models in the serverless manner has attracted increasing attention in recent years. Numerous training approaches have been proposed in this regime, such as decentralized SGD. |
We present a distributed solution to optimizing a convex function composed of several non-convex functions. Each non-convex function is privately stored with an agent while the agents communicate with neighbors to form a network. |
To harness the potential of advanced computing technologies, efficient (real time) analysis of large amounts of data is as essential as are front-line simulations. In order to optimise this process, experts need to be supported by appropriate tools that allow to interactively guide both the computation and data explor... |
Clustering analysis is of substantial significance for data mining. The properties of big data raise higher demand for more efficient and economical distributed clustering methods. |
As supercomputers become larger with powerful Graphics Processing Unit (GPU), traditional direct eigensolvers struggle to keep up with the hardware evolution and scale efficiently due to communication and synchronization demands. Conversely, subspace eigensolvers, like the Chebyshev Accelerated Subspace Eigensolver (C... |
As more and more service providers choose Cloud platforms, a resource provider needs to provision resources and supporting runtime environments (REs) for heterogeneous workloads in different scenarios. Previous work fails to resolve this issue in several ways: (1) it fails to pay attention to diverse RE requirements, ... |
In the push for exascale computing, energy efficiency is of utmost concern. System architectures often adopt accelerators to hasten application execution at the cost of power. |
The amount of data being produced at every epoch of second is increasing every moment. Various sensors, cameras and smart gadgets produce continuous data throughout its installation. |
Singular Value Decomposition (SVD) is a fundamental matrix factorization technique in linear algebra, widely applied in numerous matrix-related problems. However, traditional SVD approaches are hindered by slow panel factorization and frequent CPU-GPU data transfers in heterogeneous systems, despite advancements in GP... |
Dalek is an experimental compute cluster designed to evaluate the performance of heterogeneous, consumer-grade hardware for software design, prototyping, and algorithm development. In contrast to traditional computing centers that rely on costly, server-class components, Dalek integrates CPUs and GPUs typically found ... |
Many recent deep learning platforms rely on third-party libraries (such as cuBLAS) to utilize the computing power of modern hardware accelerators (such as GPUs). However, we observe that they may achieve suboptimal performance because the library functions are not used appropriately. |
Emerging research in edge devices and micro-controller units (MCU) enables on-device computation of Deep Learning Training and Inferencing tasks. More recently, contemporary trends focus on making the Deep Neural Net (DNN) Models runnable on battery-less intermittent devices. |
Modern computing paradigms, such as cloud computing, are increasingly adopting GPUs to boost their computing capabilities primarily due to the heterogeneous nature of AI/ML/deep learning workloads. However, the energy consumption of GPUs is a critical problem. |
Purposely modular, this protocol enables customization of several protocol properties, including the consensus properties implemented, blockchain type, the roots used, and virtual machine opcodes, among others. These modules enable implementing parties to control the behavior of their economy, with a minimal amount of... |
Serverless computing that runs functions with auto-scaling is a popular task execution pattern in the cloud-native era. By connecting serverless functions into workflows, tenants can achieve complex functionality. |
Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.