Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

internal_edges function #24

Open
mtfishman opened this issue Dec 23, 2022 · 2 comments
Open

internal_edges function #24

mtfishman opened this issue Dec 23, 2022 · 2 comments

Comments

@mtfishman
Copy link
Member

mtfishman commented Dec 23, 2022 •
edited
Loading

This is a good idea for a generic graph function. It is the complement of the edge boundary of a subgraph (https://en.wikipedia.org/wiki/Boundary_(graph_theory) and boundary_edges added in #20).

As we discussed, a simple implementation would be internal_edges(g::AbstractGraph, vertices) = edges(subgraph(g, vertices)). Then this function could be defined as internal_edges(P::AbstractProjTTNO) = internal_edges(underlying_graph(P), sites(P)).

Originally posted by @mtfishman in ITensor/ITensorNetworks.jl#18 (comment)
@mtfishman
Copy link
Member Author

Related to ITensor/ITensorNetworks.jl#36.

@mtfishman
Copy link
Member Author

Here is a reference that defines "internal edges" as the edges within a graph partition/subgraph: https://www.cs.cmu.edu/afs/cs/academic/class/15210-s15/www/lectures/graph-contraction-notes.pdf.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@mtfishman