bio | website | web.mat.bham.ac.uk/~barberba |
---|---|---|
location | Birmingham, UK | |
age | ||
visits | member for | 2 years, 8 months |
seen | 21 hours ago | |
stats | profile views | 685 |
Postdoc in Birmingham with Daniela Kühn.
Apr 10 |
reviewed | No Action Needed Entropy inequality |
Apr 10 |
reviewed | Reviewed How can I proof that $Set^I \simeq Set /I$? |
Apr 9 |
reviewed | Reviewed Variance of the maximum likelihood estimator of Rayleigh Distribution |
Apr 8 |
comment |
Edge-disjoint cycles in graphs
If a graph is an edge-disjoint union of $p$ $k$-cycles then obviously the optimum is $p$. Are you asking about the case when the $p$ $k$-cycles overlap? Or possibly whether it's easy to find a decomposition if you know that there is one? In either case, I'm afraid I don't know. |
Apr 8 |
revised |
Diameter of sum-graph over a non-meager set
can't be sure that we stay inside N |
Apr 8 |
comment |
Diameter of sum-graph over a non-meager set
@IlyaBogdanov, you're quite right. I don't think this is serious, because we can restrict attention to just the large elements of $S$ without harming the density, and we still get one $m$ that works for all final segments of $S$ (see Lemma 6 of arxiv.org/abs/1308.0488). I'll have a look: hopefully the details won't be too messy. |
Apr 8 |
answered | Edge-disjoint cycles in graphs |
Apr 8 |
answered | Diameter of sum-graph over a non-meager set |
Apr 4 |
awarded | Custodian |
Apr 2 |
answered | Dense high-degree sub-graphs of dense graphs |
Apr 1 |
answered | Infinite non-splittable graphs |
Mar 30 |
comment |
Have topographs been studied before?
The information content of a topography appears to be that of an undirected graph together with some additional directed edges. It's not clear to me that there is anything else that can be said about these objects in this generality. (In case it's useful, your first example is called taking powers of a graph.) |
Mar 25 |
reviewed | Reviewed Averages of bounded function |
Mar 23 |
reviewed | Reviewed Maximum occupancy balls in bins with limited independence |
Mar 23 |
reviewed | Reviewed Analysis of Sobolev spaces |
Mar 23 |
reviewed | Reviewed Is there an algorithm to solve quadratic Diophantine equations? |
Mar 21 |
reviewed | Reviewed Harmonic function, inversion |
Mar 21 |
reviewed | No Action Needed Variance of truncated normal distribution |
Mar 17 |
comment |
Generalized expression for balls and bins problem
If there are two bins and one ball is thrown into them with uniform probability, are you expecting the answer to be $1/2$ (the average number of balls per bin) or $1$ (the average number of balls among the set of bins with at least one ball)? |
Mar 17 |
comment |
Surjective marriages
Yes, there's no right to expect matchings from $M$ to $W$ to be bijective once the graph is infinite. |