Dynamics of vortices in disordered Josephson junctions arrays
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.
We consider models of N interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We introduce the key scaling concept of intensity; informally, the expected number of transitions per object per time ...
We address the problem of determining the \emph{optimal model complexity} for shape modeling. This complexity is a compromise between model specificity and generality. We show that the error of a model can be split into two components, the model error and ...
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasio ...
A major issue in modern ecology is to understand how ecological complexity at broad scales is regulated by mechanisms operating at the organismic level. What specific underlying processes are essential for a macroecological pattern to emerge? Here, we anal ...
The scope is to smooth the empirical distribution function of a random sample by minimizing a penalized sum of squared errors. The spline, which is the solution to this problem, is studied via the eigenvalue structure of the random matrices ocurring in its ...
In video surveillance and sports analysis applications, object trajectories offer the possibility of extracting rich information on the underlying behavior of the moving targets. To this end we introduce an extension of Point Distribution Models (PDM) to a ...
The number of probabilistic approaches to ``classic'' distributed systems problems such as reliable broadcast, consensus, or leader election, has further increased recently. Probabilistic algorithms, possibly starting from probabilistic system models, have ...
We define "random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or nonconvex domains, random walk on torus, billiards, city section, space graph, intercity and other mod ...
In recent years, the advent of robust tracking systems has enabled behavioral analysis of individuals based on their trajectories. An analysis method based on a Point Distribution Model (PDM) is presented here. It is an unsupervised modeling of the traject ...
This paper presents a calibration framework based on the generalized likelihood uncertainty estimation (GLUE) that can be used to condition hydrological model parameter distributions in scarcely gauged river basins, where data is uncertain, intermittent or ...
