On the log concavity of reliability and matroidal sequences (Q1325759): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/aama.1994.1004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963878765 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the log concavity of reliability and matroidal sequences |
scientific article |
Statements
On the log concavity of reliability and matroidal sequences (English)
0 references
3 July 1994
0 references
The reliability of a graph \(G\) is the probability that \(G\) is connected, given that the edges are independently operational with probability \(p\). This is known to be a polynomial in \(p\), and various sequences associated with this polynomial have been conjectured to be unimodal, and indeed, log concave. It is shown that for any graph \(G\), there is a subdivision for which the log concavity conjectures all hold. Further, evidence is provided for the well-known conjecture of the log concavity of the independent set numbers of a matroid.
0 references
reliability
0 references
sequences
0 references
unimodal
0 references
log concave
0 references
independent set
0 references
matroid
0 references
