-
Universal Lossless Compression of Graphical Data
Graphical data is comprised of a graph with marks on its edges and verti...
09/21/2019 ∙ by Payam Delgosha, et al. ∙
0
∙
share
read it
-
Percolation Threshold Results on - Graphs: an Empirical Process Approach
In this paper we define a directed percolation over Erdos-Renyi graphs a...
12/05/2017 ∙ by Michael Kane, et al. ∙
0
∙
share
read it
-
Distributed Compression of Graphical Data
In contrast to time series, graphical data is data indexed by the nodes ...
02/21/2018 ∙ by Payam Delgosha, et al. ∙
0
∙
share
read it
-
From Sharma-Mittal to von-Neumann Entropy of a Graph
In this article, we introduce the Sharma-Mittal entropy of a graph, whic...
02/20/2019 ∙ by Souma Mazumdar, et al. ∙
0
∙
share
read it
-
Characterization of Time Series Via Rényi Complexity-Entropy Curves
One of the most useful tools for distinguishing between chaotic and stoc...
01/17/2018 ∙ by Max Jauregui, et al. ∙
0
∙
share
read it
-
Tensor entropy for uniform hypergraphs
In this paper, we develop a new notion of entropy for uniform hypergraph...
12/20/2019 ∙ by Can Chen, et al. ∙
24
∙
share
read it
-
Learning opacity in Stratal Maximum Entropy Grammar
Opaque phonological patterns are sometimes claimed to be difficult to le...
03/07/2017 ∙ by Aleksei Nazarov, et al. ∙
0
∙
share
read it
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs
08/02/2019 ∙ by Payam Delgosha, et al. ∙
0
∙
share
In this document, we introduce a notion of entropy for stochastic processes on marked rooted graphs. For this, we employ the framework of local weak limit theory for sparse marked graphs, also known as the objective method, due to Benjamini, Schramm, Aldous, Steele and Lyons. Our contribution is a generalization of the notion of entropy introduced by Bordenave and Caputo to graphs which carry marks on their vertices and edges. The theory of time series is the engine driving an enormous range of applications in areas such as control theory, communications, information theory and signal processing. It is to be expected that a theory of stationary stochastic processes indexed by combinatorial structures, in particular graphs, would eventually have a similarly wide-ranging impact.
READ FULL TEXT
Comments
There are no comments yet.