Unified Graph Analysis Report

Degree (Co-attendance) Analysis

People are connected if they attend the same meeting; a person's degree is how many unique people they co-attended with.

Interactive Network Visualization

Visual representation of the co-attendance graph. Nodes represent people, with size and color indicating degree (number of connections) - larger, darker nodes have more connections. Edges represent co-attendance - thicker, darker edges indicate more frequent co-attendance.

Interactions: Use mouse wheel to zoom, click and drag to pan, drag nodes to reposition. Hover over nodes or edges to see detailed information. Click on a node to highlight its connections.

Top Nodes by Degree

These are the people connected to the most unique others across meetings.

Rank	Node	Degree
1	AshleyDawn	95
2	PeterE	91
3	advanceameyaw	87
4	CallyFromAuron	81
5	Kateri	81
6	UKnowZork	79
7	Sucre n Spice	78
8	esewilliams	76
9	LordKizzy	76
10	Jeffrey Ndarake	73

Degree Distribution

How many people fall into each degree (number of unique co-attendees) bucket.

Degree	Count of Nodes
4	1
6	2
8	4
9	6
10	6
11	8
12	5
13	17
15	2
16	5
17	4
18	2
19	3
20	4
21	4
23	2
24	1
26	2
27	2
29	1
30	3
31	1
33	1
34	2
35	1
36	2
40	1
43	2
44	1
45	1
46	3
47	1
48	1
49	1
51	1
57	1
58	1
60	1
62	4
63	1
65	1
66	1
71	2
72	1
73	1
76	2
78	1
79	1
81	2
87	1
91	1
95	1

JSON Field Degree Analysis

Fields are connected when they appear together inside the same JSON object; a field's degree is the number of distinct fields it co-occurs with.

Top Fields by Degree

These fields co-occur with the largest variety of other fields.

Rank	Field	Degree
1	workingDocs	11
2	documenter	11
3	typeOfMeeting	11
4	purpose	11
5	host	11
6	peoplePresent	11
7	date	11
8	status	11
9	meetingVideoLink	10
10	tags	9

Degree Distribution

How many fields have each degree (number of distinct co-occurring fields).

Degree	Count of Fields
1	2
2	2
3	9
4	4
5	1
7	2
8	3
9	12
10	1
11	8

JSON Path Structure Analysis

Each JSON path represents a unique nested route (keys/array indices); depth shows how deeply information is nested.

• Total Unique Paths: 6832
• Maximum Depth: 6
• Average Depth: 4.20

Deepest JSON Paths (sample)

The deepest examples indicate where the data structure is most nested.

• [0].agendaItems[0].actionItems[0].text
• [0].agendaItems[0].actionItems[0].assignee
• [0].agendaItems[0].actionItems[0].dueDate
• [0].agendaItems[0].actionItems[0].status
• [0].agendaItems[0].decisionItems[0].decision
• [0].agendaItems[0].decisionItems[0].effect
• [0].agendaItems[0].decisionItems[1].decision
• [0].agendaItems[0].decisionItems[1].rationale
• [0].agendaItems[0].decisionItems[1].effect
• [0].agendaItems[0].decisionItems[2].decision

Most Common Parent Paths

Parents that appear most often, suggesting common structural hubs.

Rank	Parent Path	Count
1	[12].agendaItems[0]	26
2	[2].agendaItems[0]	21
3	[10].agendaItems[0]	21
4	[7].agendaItems[0]	19
5	[17].agendaItems[0]	19
6	[22].meetingInfo	19
7	[23].meetingInfo	19
8	[101].agendaItems[0]	19
9	[11].agendaItems[0]	18
10	[37].agendaItems[0]	18

Field Centrality (Co-occurrence)

Centrality scores highlight fields that are well-connected (degree), act as bridges (betweenness), are close to others (closeness), or connect to other influential fields (eigenvector).

Rank	Field	Degree	Betweenness	Closeness	Eigenvector
1	workingDocs	0.256	0.001	0.256	0.309
2	documenter	0.256	0.001	0.256	0.309
3	typeOfMeeting	0.256	0.001	0.256	0.309
4	purpose	0.256	0.001	0.256	0.309
5	host	0.256	0.001	0.256	0.309
6	peoplePresent	0.256	0.001	0.256	0.309
7	date	0.256	0.001	0.256	0.309
8	status	0.256	0.030	0.256	0.000
9	meetingVideoLink	0.233	0.000	0.234	0.290
10	tags	0.209	0.000	0.209	0.000

Clustering (Field Co-occurrence Graph)

Clustering measures how tightly a field's neighbors are connected to each other (higher means more triads).

Average Clustering Coefficient: 0.882

Top Nodes by Clustering Coefficient

Fields whose immediate neighborhoods are most tightly interlinked.

Rank	Field	Clustering
1	tags	1.000
2	workgroup	1.000
3	type	1.000
4	agendaItems	1.000
5	canceledSummary	1.000
6	noSummaryGiven	1.000
7	meetingInfo	1.000
8	workgroup_id	1.000
9	timestampedVideo	1.000
10	dueDate	1.000

Connected Components (Field Co-occurrence Graph)

Components are groups of fields that are all reachable from each other; multiple components suggest separate substructures.

• Number of Components: 6
• Component Sizes (top 10): [12, 12, 10, 4, 4, 2]

Sample of Largest Component Nodes (top 10)

• mediaLink
• timestampedVideo
• miroBoardLink
• meetingVideoLink
• documenter
• typeOfMeeting
• host
• peoplePresent
• workingDocs
• otherMediaLink

Review Audit

Community review scores and feedback for each analysis method. Reviews are stored locally in your browser and can also be loaded from the JSON file.

Note: Reviews are stored in your browser's localStorage. To share reviews or make them permanent, use the "Download Review as JSON" button and submit the JSON file to the repository.