On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function

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.

Humans are comparison machines: comparing and choosing an item among a set of alternatives (such as objects or concepts) is arguably one of the most natural ways for us to express our preferences and opinions. In many applications, the analysis of data con ...

This thesis develops a unified framework for modeling and solving various classes of rich routing problems with stochastic demands, including the VRP and the IRP. The work is inspired by the problem of collecting recyclables from sensorized containers in G ...

Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...

Dynamic optimization problems affected by uncertainty are ubiquitous in many application domains. Decision makers typically model the uncertainty through random variables governed by a probability distribution. If the distribution is precisely known, then ...

We consider the dynamics of swarms of scalar Brownian agents subject to local imitation mechanisms implemented using mutual rank-based interactions. For appropriate values of the underlying control parameters, the swarm propagates tightly and the distances ...

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities

\frac{a}{n}

and

\frac{b}{n}

respectively. We consider the ...

We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which ...

We study the nonlinear stochastic heat equation in the spatial domain R, driven by space-time white noise. A central special case is the parabolic Anderson model. The initial condition is taken to be a measure on R, such as the Dirac delta function, but th ...

We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication ...

A double-normal pair of a finite set S of points that spans R-d is a pair of points {p, q} from S such that S lies in the closed strip bounded by the hyperplanes through p and q perpendicular to pq. A double-normal pair {p, q} is strict if S \ {p,q} lies i ...

We show that the transcendence degree of a real function field over an arbitrary real base field is a strict lower bound for its Pythagoras number and a weak lower bound for all its higher Pythagoras numbers. ...

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function

Chat with Graph Search

Efficient Learning from Comparisons

Rich Vehicle and Inventory Routing Problems with Stochastic Demands

Algorithmic Resource Verification

Dimensionality Reduction in Dynamic Optimization under Uncertainty

Intearcting Brownian Swarms: Some Analytical Results

Partial Recovery Bounds for the Sparse Stochastic Block Model

Lyapunov Exponents for Branching Processes in a Random Environment: The Effect of Information

Moments And Growth Indices For The Nonlinear Stochastic Heat Equation With Rough Initial Conditions

Expected Loss Analysis for Authentication in Constrained Channels

Double-Normal Pairs In Space

Lower bounds for Pythagoras numbers of function fields

On the DCJ Median Problem