Non-Exponential Variations for Classical Results in First Passage Percolation

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.

Accurate and reliable electricity load forecasts are becoming increasingly important as the share of intermittent resources in the system increases. Distribution System Operators (DSOs) are called to accurately forecast their production and consumption to ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

This thesis presents a comprehensive theory of information-theoretic measures for characterizing the complexity and higher-order dependence structures of graphs. We introduce multivariate complexity and dependence measures for graphs within the framework o ...

This article focuses on spectral methods for recovering communities in temporal networks. In the case of fixed communities, spectral clustering on the simple time-aggregated graph (i.e., the weighted graph formed by the sum of the interactions over all tem ...

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Atomistic simulations performed with a family of model potential with tunable hardness have proven to be a great tool for advancing the understanding of wear processes at the asperity level. They have been instrumental in finding a critical length scale, w ...

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

Colloid particle size plays an important role in contaminant adsorption and clogging in the hyporheic zone, but it remains unclear how the particle size changes during the transport of colloids. This study investigated the variation of the particle size of ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Water distribution systems (WDSs) are complex networks with numerous interconnected junctions and pipes. The robustness and reliability of these systems are critically dependent on their network structure, necessitating detailed analysis for proactive leak ...

In recent years, there has been a surge of interest in predicting computed activation barriers, to enable the acceleration of the automated exploration of reaction networks. Consequently, various predictive approaches have emerged, ranging from graph-based ...

We study the k-connectivity augmentation problem (k-CAP) in the single-pass streaming model. Given a (k − 1)-edge connected graph G = (V, E) that is stored in memory, and a stream of weighted edges (also called links) L with weights in {0, 1, . . ., W }, t ...

Obesity represents a significant public health concern and is linked to various comorbidities and cognitive impairments. Previous research indicates that elevated body mass index (BMI) is associated with structural changes in white matter (WM). However, a ...

The generation of squeezed Fock states by the one or more photon subtraction from a two-mode entangled Gaussian (TMEG) state is theoretically addressed. We showed that an arbitrary order Fock state can be generated this way and we obtained a condition that ...

The spatial distribution of dwarf galaxies around their host galaxies is a critical test for the standard model of cosmology because it probes the dynamics of dark matter halos and is independent of the internal baryonic processes of galaxies. Comoving pla ...

Reliable descriptions of erosion events are foundational to effective frameworks relevant to the fate of tidal landscape evolution. Besides the rhythmic, predictable action of tidal currents, erosion in shallow tidal environments is strongly influenced by ...

Non-Exponential Variations for Classical Results in First Passage Percolation

Chat with Graph Search

Probabilistic Load Forecasting of distribution power systems based on empirical copulas

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

The Power of Two Matrices in Spectral Algorithms for Community Recovery

An Information-Theoretic Framework for Multiplex Graphs

Recovering Static and Time-Varying Communities Using Persistent Edges

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

A story of two transitions: From adhesive to abrasive wear and from ductile to brittle regime

Graph generative deep learning models with an application to circuit topologies

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Network-based kinetic models: Emergence of a statistical description of the graph topology

Extensions of Peer Prediction Incentive Mechanisms

Effects of Hyporheic Exchange and Settlement on the Particle Size Distribution of Colloids

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Towards an Understanding of Hydraulic Sensitivity: Graph Theory Contributions to Water Distribution Analysis

Benchmarking machine-readable vectors of chemical reactions on computed activation barriers

Streaming Algorithms for Connectivity Augmentation

White adipose tissue distribution and amount are associated with increased white matter connectivity

Generation of squeezed Fock states by measurement

The phase-space distribution of the M 81 satellite system

Statistical characterization of erosion and sediment transport mechanics in shallow tidal environments - Part 1: Erosion dynamics