相关论文: Thin times and random times' decomposition

Recently there has been much interest in graph-based learning, with applications in collaborative filtering for recommender networks, link prediction for social networks and fraud detection. These networks can consist of millions of…

For graphs $G$ and $T$, and a family of graphs $\mathcal{F}$ let $\mathrm{ex}(G,T,\mathcal{F})$ denote the maximum possible number of copies of $T$ in an $\mathcal{F}$-free subgraph of $G$. We investigate the algorithmic aspects of…

The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We present an efficient…

We consider a complete probability space $(\Omega,\mathcal{F},\mathbb{P})$, which is endowed with two filtrations, $\mathbb{G}$ and $\mathbb{F}$, assumed to satisfy the usual conditions and such that $\mathbb{F} \subset \mathbb{G}$. On this…

We prove that any given function can be smoothly approximated by functions lying in the kernel of a linear operator involving at least one fractional component. The setting in which we work is very general, since it takes into account…

We investigate the question, "how does time flow?" and show that time may change by inversions as well. We discuss its implications to a simple class of linear systems. Instead of introducing any unphysical behaviour, inversions can lead to…

We consider the class of conditional graph patterns (\emph{CGPs}) that allow user to query data graphs with complex patterns that contain negation and predicates. To overcome the prohibitive cost of subgraph isomorphism, we consider…

We consider the thick points of random walk, i.e. points where the local time is a fraction of the maximum. In two dimensions, we answer a question of Dembo, Peres, Rosen and Zeitouni and compute the number of thick points of planar random…

This work establishes a Space-Time Connectivity Theorem for normal currents. In analogy to classical results by Federer and Fleming as well as a recent theorem for integral currents by the second author, this result allows one to witness…

Given a sequence $(M^n)^{\infty}_{n=1}$ of nonnegative martingales starting at $M^n_0=1$, we find a sequence of convex combinations $(\widetilde{M}^n)^{\infty}_{n=1}$ and a limiting process $X$ such that…

Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…

In this letter we discuss the possibility of treating the spacetime by itself as a kind of deformable body for which we can define an fundamental lattice, just like atoms in crystal lattices. We show three signs pointing in that direction.…

A classic result of Paul, Pippenger, Szemer\'edi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained in NTIME(n) for some superlinear time-constructible…

We investigate a class of stochastic fragmentation processes involving stable and unstable fragments. We solve analytically for the fragment length density and find that a generic algebraic divergence characterizes its small-size tail.…

This letter extends the concept of graph-frequency to graph signals that evolve with time. Our goal is to generalize and, in fact, unify the familiar concepts from time- and graph-frequency analysis. To this end, we study a joint temporal…

Temporal graphs are graphs whose edges are only present at certain points in time. Reachability in these graphs relies on temporal paths, where edges are traversed chronologically. A temporal graph that offers all-pairs reachability is said…

For a group $G$ and a natural number $m$, a subset $A$ of $G$ is called $m$-thin if, for each finite subset $F$ of $G$, there exists a finite subset $K$ of $G$ such that $|Fg\cap A|\leqslant m$ for every $g\in G\setminus K$. We show that…

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…

Computations, where the number of results is much smaller than the input data and are produced through some sort of accumulation, are called Reductions. Reductions appear in many scientific applications. Usually, reductions admit an…

In this paper we establish a decoupling feature of the random interlacement process I^u in Z^d, at level u, for d \geq 3. Roughly speaking, we show that observations of I^u restricted to two disjoint subsets A_1 and A_2 of Z^d are…