• Corpus ID: 53224137

# Limits of Ordered Graphs and Images

@article{BenEliezer2018LimitsOO,
title={Limits of Ordered Graphs and Images},
author={Omri Ben-Eliezer and Eldar Fischer and Amit Levi and Yuichi Yoshida},
journal={ArXiv},
year={2018},
volume={abs/1811.02023}
}
• Published 5 November 2018
• Mathematics
• ArXiv
The emerging theory of graph limits exhibits an interesting analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described naturally in analytic language. We extend the theory of graph limits to the ordered setting, presenting a limit object for dense vertex-ordered graphs, which we call an orderon. Images are an example of dense ordered bipartite graphs, where the rows and the columns constitute the vertices, and pixel…
2 Citations

### Limits of Latin squares.

• Mathematics
• 2020
We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the cut distance, and a

### Efficient Removal Lemmas for Matrices

• Mathematics, Computer Science
APPROX-RANDOM
• 2017
This work establishes much more efficient removal lemmas for several special cases of the above problem and combines their efficient conditional regularity lemma for matrices with additional combinatorial and probabilistic ideas.

## References

SHOWING 1-10 OF 37 REFERENCES

### Limits of dense graph sequences

• Mathematics
J. Comb. Theory, Ser. B
• 2006

### Testing Hereditary Properties of Ordered Graphs and Matrices

• Mathematics
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
The proof bridges the gap between techniques related to the regularity lemma, used in the long chain of papers investigating graph testing, and string testing techniques and develops a Ramsey-type lemma for multipartite graphs with undesirable edges.

### Large Networks and Graph Limits

• Mathematics
The book Large Networks and Graph Limits, xiv + 475 pp., published in late 2012, comprises five parts, the first an illuminating introduction and the last a tantalizing taste of how the scope of the

### Graph limits and parameter testing

• Mathematics
STOC '06
• 2006
We define a distance of two graphs that reflects the closeness of both local and global properties. We also define convergence of a sequence of graphs, and show that a graph sequence is convergent if

### Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics

• Mathematics
• 2012
We consider sequences of graphs (Gn) and dene various notions of convergence related to these sequences including \left-convergence," dened in terms of the densities of homomorphisms from small

### Hypergraph limits: A regularity approach

• Yufei Zhao
• Mathematics
Random Struct. Algorithms
• 2015
A new proof and construction of hypergraph limits is given, inspired by the original approach of Lovasz and Szegedy, with the key ingredient being a weak Frieze-Kannan type regularity lemma.

### Convergent sequences of sparse graphs: A large deviations approach

• Mathematics, Computer Science
Random Struct. Algorithms
• 2017
This paper introduces a new notion of convergence of sparse graphs, which it is called Large Deviations or LD‐convergence, and which is based on the theory of large deviations, and establishes several previously unknown relationships between the other notions of convergence.

### Efficient testing of large graphs

• Mathematics
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
• 1999
This theorem is used to prove that first order graph properties not containing a quantifier alternation of type "/spl forall//spl exist/" are always testable, while it is shown that some properties containing this alternation are not.