English
Related papers

Related papers: A critical quartet for queuing couples

200 papers

We derive precise asymptotic expressions for the expectations, variances, covariance, and quite a few further mixed moments for the number of hairpins and the number of basepairs in RNA secondary structures, and give convincing evidence…

Combinatorics · Mathematics 2026-02-24 AJ Bu , Manuel Kauers , Doron Zeilberger

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

Combinatorics · Mathematics 2022-08-26 Ross G. Pinsky

This note displays an interesting phenomenon for percentiles of independent but non-identical random variables. Let $X_1,\cdots,X_n$ be independent random variables obeying non-identical continuous distributions and $X^{(1)}\geq \cdots\geq…

Statistics Theory · Mathematics 2019-06-11 Dong Xia

Let $G_1,\dots, G_m$ be independent Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having variable sizes $x_1,\dots, x_m\in [n]$ and densities $q_1,\dots, q_m\in [0,1]$. Letting $n,m\to+\infty$, we study the connectivity…

Probability · Mathematics 2023-11-08 Daumilas Ardickas , Mindaugas Bloznelis

A coupled phase-oscillator model consists of phase-oscillators, each of which has the natural frequency obeying a probability distribution and couples with other oscillators through a given periodic coupling function. This type of model is…

Adaptation and Self-Organizing Systems · Physics 2020-12-16 Ryosuke Yoneda , Kenji Harada , Yoshiyuki Y. Yamaguchi

Suppose $n$ boys and $n$ girls rank each other at random. We show that any particular girl has at least $({1\over 2}-\epsilon) \ln n$ and at most $(1+\epsilon)\ln n$ different husbands in the set of all Gale/Shapley stable matchings defined…

Combinatorics · Mathematics 2008-02-03 Donald E. Knuth , Rajeev Motwani , Boris Pittel

We consider a polling system: a queueing system of $N\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating…

Probability · Mathematics 2011-11-09 Onno Boxma , Offer Kella , Kamil Marcin Kosinski

In this paper, some general properties of Shannon information measures are investigated over sets of probability distributions with restricted marginals. Certain optimization problems associated with these functionals are shown to be…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Ivan Stanojević , Vojin Šenk

Conjunctive queries select and are expected to return certain tuples from a relational database. We study the potentially easier problem of counting all selected tuples, rather than enumerating them. In particular, we are interested in the…

Computational Complexity · Computer Science 2019-04-30 Holger Dell , Marc Roth , Philip Wellnitz

Consider a population consisting of n individuals, each of whom has one of d types (e.g. their blood type, in which case d=4). We are allowed to query this database by specifying a subset of the population, and in response we observe a…

Probability · Mathematics 2019-02-18 Ahmed El Alaoui , Aaditya Ramdas , Florent Krzakala , Lenka Zdeborova , Michael I. Jordan

Consider the random quadratic form $T_n=\sum_{1 \leq u < v \leq n} a_{uv} X_u X_v$, where $((a_{uv}))_{1 \leq u, v \leq n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal, and $X_1,$ $X_2, \ldots, X_n$ are i.i.d.…

Probability · Mathematics 2019-12-30 Bhaswar B. Bhattacharya , Somabha Mukherjee , Sumit Mukherjee

Consider the problem of finding high dimensional approximate nearest neighbors, where the data is generated by some known probabilistic model. We will investigate a large natural class of algorithms which we call bucketing codes. We will…

Information Theory · Computer Science 2016-11-17 Moshe Dubiner

We derive limiting distributions of symmetrized estimators of scatter, where instead of all $n(n-1)/2$ pairs of the $n$ observations we only consider $nd$ suitably chosen pairs, $1 \le d < \lfloor n/2\rfloor$. It turns out that the…

Statistics Theory · Mathematics 2023-08-21 Lutz Duembgen , Klaus Nordhausen

A collaborative distributed binary decision problem is considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $X^n=(X_1,\dots,X_n)$ and…

Information Theory · Computer Science 2016-04-11 Gil Katz , Pablo Piantanida , Merouane Debbah

This paper develops a method to use singles' data in a non-parametric revealed preference setting of collective household choice. We use it to test the controversial assumption of preference stability between singles and couples, without…

Econometrics · Economics 2026-05-07 Stefan Hubner

Stable matching in a community consisting of $N$ men and $N$ women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and…

Computer Science and Game Theory · Computer Science 2020-05-19 Simon Mauras

We consider a Markov chain of point processes such that each state is a super position of an independent cluster process with the previous state as its centre process together with some independent noise process. The model extends earlier…

Probability · Mathematics 2019-01-24 Jesper Møller , Andreas D. Christoffersen

The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…

Combinatorics · Mathematics 2024-01-09 Shi-Mei Ma , Hao Qi , Jean Yeh , Yeong-Nan Yeh

We present new values and bounds on the (normalised) closeness centrality $\bar{\mathsf{C}}_C$ of connected graphs and on its product $\bar{l}\bar{\mathsf{C}}_C$ with the mean distance $\bar{l}$ of these graphs. Our main result presents the…

Combinatorics · Mathematics 2023-07-19 Thomas Britz , Xin Hu , Abdellah Islam , Hopein Christofen Tang

Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…

Combinatorics · Mathematics 2019-12-06 Ljuben Mutafchiev
‹ Prev 1 3 4 5 6 7 10 Next ›