相关论文: Free Energy Approximations for CSMA networks

The free energy is a key quantity of interest in Ising models, but unfortunately, computing it in general is computationally intractable. Two popular (variational) approximation schemes for estimating the free energy of general Ising models…

We present a method to obtain numerically accurate values of configurational free energies of semiflexible macromolecular systems, based on the technique of thermodynamic integration combined with normal-mode analysis of a reference system…

Carrier Sense Multiple Access (CSMA) is widely used as a Medium Access Control (MAC) in wireless networks due to its simplicity and distributed nature. This motivated researchers to find CSMA schemes that achieve throughput optimality. In…

We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…

We consider the regret minimization problem in reinforcement learning (RL) in the episodic setting. In many real-world RL environments, the state and action spaces are continuous or very large. Existing approaches establish regret…

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…

Given a clique-width $k$-expression of a graph $G$, we provide $2^{O(k)}\cdot n$ time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted Steiner Tree, Connected Dominating Set, or Connected Vertex…

Many modern wireless networks integrate carrier sense mul-tiple access/collision avoidance (CSMA/CA) with exponential backoff as medium access control (MAC) technique. In order to decrease the MAC overhead and the collision probability, we…

Collisions are a main cause of throughput degradation in WLANs. The current contention mechanism used in IEEE 802.11 networks is called Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). It uses a Binary Exponential Backoff…

In this paper we propose resource allocation algorithm for uplink sparse code multiple access (SCMA) networks to maximize the energy efficiency (EE). Due to the joint optimization of factor graph matrix and power allocation matrix, the EE…

The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e.…

In this paper, we provide two new stable online algorithms for the problem of prediction in reinforcement learning, \emph{i.e.}, estimating the value function of a model-free Markov reward process using the linear function approximation…

CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has recently gained a lot of attentions since it has been proved that appropriate control of CSMA parameters guarantees…

In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…

The performance analysis of wireless CSMA networks is notoriously difficult due to the intricate sensing and interference relationships among links. Even the fundamental problem of throughput characterization remains open when sensing and…

We introduce a generalised micro-macro Markov chain Monte Carlo (mM-MCMC) method with pseudo-marginal approximation to the free energy, that is able to accelerate sampling of the microscopic Gibbs distributions when there is a time-scale…

To address the large gap between time scales that can be easily reached by molecular simulations and those required to understand protein dynamics, we propose a rapid self-consistent approximation of the side chain free energy at every…

In this paper, We propose a effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential delivering exponent alpha. we assume that the handling capacity of one vertex is…

The belief propagation (BP) algorithm is an efficient way to solve "inference" problems in graphical models, such as Bayesian networks and Markov random fields. The system-state probability distribution of CSMA wireless networks is a Markov…

Coherent energy transfer in pigment-protein complexes has been studied by mapping the quantum network to a kinetic network. This gives an analytic way to find parameter values for optimal transfer efficiency. In the case of the…