English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In this paper we study the performance of a bipartite network in whichcustomers arrive at the nodes of the network, but not all nodes are able toserve their customers at all times. Each node can be either active or inactive,and two nodes connected by a bond cannot be active simultaneously. Thissituation arises in wireless random-access networks where, due to destructiveinterference, stations that are close to each other cannot use the samefrequency band.  We consider a model where the network is bipartite, the active nodes switchthemselves off at rate 1, and the inactive nodes switch themselves on at a ratethat depends on time and on which half of the bipartite network they are in. Aninactive node cannot become active when one of the nodes it is connected to bya bond is active. The switching protocol allows the nodes to share activityamong each other. In the limit as the activation rate becomes large, we computethe crossover time between the two states where one half of the network isactive and the other half is inactive. This allows us to assess the overallactivity of the network depending on the switching protocol. Our results makeuse of the metastability analysis for hard-core interacting particle models onfinite bipartite graphs derived in an earlier paper. They are valid for a largeclass of bipartite networks, subject to certain assumptions. Proofs rely on acomparison with switching protocols that are not time-varying, through couplingtechniques.

Crossover times in bipartite networks with activity constraints and time-varying switching rates