« first day (2945 days earlier)      last day (1396 days later) » 

12:23 AM
@MartinSleziak now has three questions
0
Q: Period of sum of periodic sequences

Celine HarumiLet $m_t$ and $v_t$ be two periodic real sequences. Assume that for some constant $a$, it holds that $m_t/a+v_t$ is periodic with fundamental period $k>0$. Is $m_t/b+v_t$ also $k$-periodic for any real number $b$? Moreover, is there any condition such that $k$ becomes its fundamental period?

 
 
13 hours later…
1:04 PM
May 29 '18 at 1:13, by Martin Sleziak
Two new tags in the same question - and .
A new tag was created by John Cataldo. He created also a tag-excerpt and a tag-wiki.
In graph theory and statistics, a graphon (also known as a graph limit) is a symmetric measurable function W : [ 0 , 1 ] 2 → [ 0 , 1 ] {\displaystyle W:[0,1]^{2}\to [0,1]} , that is important in the study of dense graphs. Graphons arise both as a natural notion for the limit of a sequence of dense graphs, and as the fundamental defining objects of exchangeable random graph models. Graphons are tied to dense...
0
Q: Graphon model for random graphs and almost surely dense graphs

John CataldoConsider the random graph generating process from a graphon. A random graph model is an exchangeable random graph model if and only if it can be defined in terms of a (possibly random) graphon. It follows from this definition and the law of large numbers that, if $W\ne0$, exchangeable random g...

1 message moved to ­Trash
Posts where the tag was added removed (including the editors): data.stackexchange.com/math/query/1105163/… data.stackexchange.com/math/query/1038474/…
So the tag was probably removed by the script which removes tags with a single occurrence after 6 months - since nothing is visible in the revision history: math.stackexchange.com/posts/2799216/revisions
Posts where the tag was added removed (including the editors): data.stackexchange.com/math/query/1105163/… data.stackexchange.com/math/query/1038474/…
The above queries did not find older occurrences of . But, as I mentioned, existed for on one question.
May 29 '18 at 1:13, by Martin Sleziak
0
Q: Graph Version of (Weak) Szemeredi Regularity Via Grpahon Version of (Weak) Szemeredi Regularity

caffeinemachine$\newcommand{\mc}{\mathcal}$ $\newcommand{\set}[1]{\{#1\}}$ Notation and Definitions Let $G=(V, E)$ be a graph. For $X, Y\subseteq V$, we write $e_G(X, Y)$ to denote the number of edges in $G$ with one end-point in $X$ and the other end-point in $Y$; the edges with both end-points in $X\cap Y$ ...

 

« first day (2945 days earlier)      last day (1396 days later) »