Flexible Queueing Architectures by Tsitsiklis, John N., Xu, Kuang

“…We study a multiserver model with n flexible servers and n queues, connected through a bipartite graph, where the level of flexibility is captured by an upper bound on the graph's average degree, dn. …”
Get full text

Brownian-Huygens Propagation: Modeling Wave Functions with Discrete Particle-Antiparticle Random Walks by Hrgovčić, Hrvoje J.

“…Consider a collection of particles executing random walks on an undirected bipartite graph embedded in $$\mathbb {R}^{D}$$ R D at discrete times $$\mathbb {Z}$$ Z , and assume those walks are “heat-like”, in the sense that a (conserved) density of particles obeys the heat equation in the continuum limit. …”
Get full text

Reaction Factoring and Bipartite Update Graphs Accelerate the Gillespie Algorithm for Large-Scale Biochemical Systems by Indurkhya, Sagar, Beal, Jacob S.

“…Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only O(n) storage for n reactions, rather than the O(n[superscript 2]) required for a graph that includes only reactions. …”
Get full text
Get full text
Get full text

A simple message-passing algorithm for compressed sensing by Chandar, Venkat B., Shah, Devavrat, Wornell, Gregory W.

“…We establish that when A corresponds to the adjacency matrix of a bipartite graph with sufficient expansion, a simple message-passing algorithm produces an estimate x^ of x satisfying ∥x-x^∥[subscript 1] ≤ O(n/k) ∥x-x[superscript(k)]∥1, where x[superscript(k)] is the best k-sparse approximation of x. …”
Get full text
Get full text
Get full text

Queueing system topologies with limited flexibility by Tsitsiklis, John N., Xu, Kuang

“…We study a multi-server model with n flexible servers and rn queues, connected through a fixed bipartite graph, where the level of flexibility is captured by the average degree, d(n), of the queues. …”
Get full text
Get full text

Erdos–Hajnal-type theorems in hypergraphs by Conlon, David, Fox, Jacob, Sudakov, Benny

“…However, it is known that an H-free graph must contain a complete or empty bipartite graph with parts of polynomial size. We prove an analogue of this result for 3-uniform hypergraphs, showing that if a 3-uniform hypergraph on n vertices is H-free, for any given H, then it must contain a complete or empty tripartite subgraph with parts of order c(logn)[superscript 1/2 + δ(H)], where δ(H) > 0 depends only on H. …”
Get full text

Duality theory for optimal mechanism design by Giannakopoulos, I

“…The dual system reveals the natural geometric nature of the problem and highlights its connection with the theory of bipartite graph matchings.</p> <p>We demonstrate the power of the framework by applying it to various special monopoly settings where a seller of multiple heterogeneous goods faces a buyer with independent item values drawn from various distributions of interest, to design both exact and approximately optimal selling mechanisms. …”

The complexity of approximately counting retractions by Focke, J, Goldberg, L, Zivny, S

“…The result is as follows: (1) Approximately counting retractions to a tree H is in FP if H is a star, a single looped vertex, or an edge with two loops. (2) Otherwise, if H is an irreflexive caterpillar or a partially bristled reflexive path, then approximately counting retractions to H is equivalent to approximately counting the independent sets of a bipartite graph — a problem which is complete in the approximate counting complexity class RHπ1. (3) Finally, if none of these hold, then approximately counting retractions to H is #P-complete under approximation-preserving reductions. …”

The complexity of approximately counting retractions by Focke, J, Goldberg, LA, Živný, S

“…The result is as follows: (1) Approximately counting retractions to a graph H of girth at least 5 is in FP if every connected component of H is a star, a single looped vertex, or an edge with two loops. (2) Otherwise, if every component is an irreflexive caterpillar or a partially bristled reflexive path, then approximately counting retractions to H is equivalent to approximately counting the independent sets of a bipartite graph—a problem that is complete in the approximate counting complexity class RH Π 1. (3) Finally, if none of these hold, then approximately counting retractions to H is equivalent to approximately counting the satisfying assignments of a Boolean formula. …”

Cohesive subgraph mining in large graphs by Yu, Kaiqiang

“…In this thesis, we study three cohesive subgraph mining problems on large graphs, namely (1) maximal k-biplex enumeration problem on bipartite graphs, (2) maximum k-biplex search problem on bipartite graphs, and (3) maximal quasi-clique enumeration problem on large general graphs. …”
Get full text

Gut permeability and osteoarthritis, towards a mechanistic understanding of the pathogenesis: a systematic review by Giorgio Guido, Guido Ausenda, Veronica Iascone, Emanuele Chisari

“…We propose a pathogenetic model in which dysbiosis is correlated to the bipartite graph of tight junctions and bacterially-produced products, aiming to direct future studies in the search of other bacterial products and tight junction disassembly regulators.KEY MESSAGESPrevious studies and methods have underestimated the impact of the gut-joint axis in osteoarthritis and have focussed on the characterisation of microbiota phenotypes rather than clear molecular mediators of disease.Gut dysbiosis is related to higher levels of bacterial toxins that elicit cartilage and synovium inflammatory pathways.Future research may benefit from focussing on both tight junctions and bacterially-produced products.…”
Get full text

IDENTIFICATION OF PROBLEM SITUATIONS IN FUNCTIONAL DIAGNOSTICS OF INTELLIGENT BUSINESS SYSTEMS by Vasyl Lavrentiyovych Lysytskyi, Mariia Olegivna Boiko

“…A complex of models has been developed to construct a bipartite graph of a problem situation and to analyze its problem-containing environment. …”
Get full text

Subtypes of relapsing-remitting multiple sclerosis identified by network analysis by Quentin Howlett-Prieto, Chelsea Oommen, Michael D. Carrithers, Donald C. Wunsch, Daniel B. Hier, Daniel B. Hier

“…Network analysis of the unipartite graph yielded a higher modularity score (0.49) than the bipartite graph (0.25). The bipartite network was partitioned into five communities which were named fatigue, behavioral, hypertonia/weakness, abnormal gait/sphincter, and sensory, based on feature characteristics. …”
Get full text

On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter by Bin Li, Zhikang Jiang, Jie Chen

“…In the first part, the paper introduces the three frameworks: the one-shot framework based on the compressed sensing (CS) solver, the peeling framework based on the bipartite graph and the iterative framework based on the binary tree search. …”
Get full text

Multiplayer Reach–Avoid Differential Games in 3D Space Inspired by Harris’ Hawks’ Cooperative Hunting Tactics by Wanying Ruan, Haibin Duan, Yongbin Sun, Wanmai Yuan, Jie Xia

“…Moreover, the matching algorithm for the case with pursuers outnumbered evaders is provided through constructing a weighted bipartite graph, and the cooperative tactics for multiple pursuers are proposed, inspired by the Harris’ Hawks intelligent cooperative hunting tactics. …”
Get full text

The Complex Structure of the Pharmacological Drug–Disease Network by Irene López-Rodríguez, Cesár F. Reyes-Manzano, Ariel Guzmán-Vargas, Lev Guzmán-Vargas

“…Here, we construct a bipartite graph in terms of active ingredients and diseases based on thoroughly classified data from a recognized pharmacological website. …”
Get full text

A Novel Unsupervised Classification Method for Sandy Land Using Fully Polarimetric SAR Data by Weixian Tan, Borong Sun, Chenyu Xiao, Pingping Huang, Wei Xu, Wen Yang

“…More specifically, this involves a beginning sub-step of superpixels generation via the Adaptive Simple Linear Iterative Clustering (ASLIC) algorithm when the feature vector combined with the spatial coordinate information are employed as input, and subsequently a sub-step of representative points selection as well as bipartite graph formation, followed by the spectral clustering algorithm to complete the classification task. …”
Get full text

Human-in-the-loop Outlier Detection by Chai, Chengliang, Cao, Lei, Li, Guoliang, Li, Jian, Luo, Yuyu, Madden, Samuel R

“…To address the second challenge, we propose a bipartite graph-based question selection strategy that is theoretically proven to be able to minimize the number of questions needed to cover all outlier candidates. …”
Get full text

Human-in-the-loop Outlier Detection by Chai, Chengliang, Cao, Lei, Li, Guoliang, Li, Jian, Luo, Yuyu, Madden, Samuel R

“…To address the second challenge, we propose a bipartite graph-based question selection strategy that is theoretically proven to be able to minimize the number of questions needed to cover all outlier candidates. …”
Get full text

Duality and dynamics of supersymmetric field theories from D-branes on singularities by Franco, Sebastián Federico

Get full text